JP5492455B2 - Navigation device - Google Patents

Description

  The present invention relates to navigation technology.

  Conventionally, in a navigation apparatus, a route search technique such as Dijkstra's method that uses a route with a low link cost by adding the link costs of a node that is a point on a traveling route and a link that connects the nodes. Is used. Patent Document 1 describes a technique regarding such a navigation device.

JP 2009-80127 A

  In the navigation device as described above, it is possible to avoid setting the route including the narrow road by taking measures such as setting a high link cost for the narrow road and prohibiting the setting of the route uniformly. It is. However, if such measures are taken, a route that excludes narrow roads may be set even in the vicinity of the starting point or destination where the range of road selection is small, and an efficient route may not be presented.

  An object of the present invention is to provide a technique for presenting an efficient route while avoiding traveling on a narrow road as much as possible.

In order to solve the above problems, a navigation device according to the present invention includes a route search unit that searches for a route from a departure point to a destination, and the road type is a general road when the route search unit searches for a route. A detection means for detecting a point that becomes a narrow road and again becomes a general road, and a determination means for determining whether or not the point detected by the detection means satisfies a predetermined condition, the route search means, When it is determined by the determination means that a predetermined condition is satisfied, a route including the point is searched to the destination, and when the determination means determines that the predetermined condition is not satisfied, The route is searched by excluding the point, and the point detected by the detecting means is included in a range within a predetermined distance from the departure place, or included in a range within a predetermined distance from the destination, The above And certain conditions, characterized in that.

FIG. 1 is a schematic configuration diagram of a navigation device. FIG. 2 is a diagram illustrating the configuration of the link table. FIG. 3 is a diagram showing the configuration of the route information table. FIG. 4 is a functional configuration diagram of the arithmetic processing unit. FIG. 5 is a flowchart of the detailed route search process. FIG. 6 is a diagram illustrating a positional relationship between the departure point, the destination, and the road. FIG. 7 is a diagram illustrating a positional relationship between the departure point, the destination, and the road. FIG. 8 is a flowchart of a modified example of the detailed route search process.

  Hereinafter, a navigation device 100 which is an in-vehicle device to which an embodiment of the present invention is applied will be described with reference to the drawings.

  FIG. 1 shows a configuration diagram of the navigation device 100.

  The navigation device 100 includes an arithmetic processing unit 1, a display 2, a storage device 3, a voice input / output device 4 (including a microphone 41 as a voice input device and a speaker 42 as a voice output device), an input device 5, and a ROM. A device 6, a vehicle speed sensor 7, a gyro sensor 8, a GPS (Global Positioning System) receiver 9, an FM multiplex broadcast receiver 10, and a beacon receiver 11 are provided.

  The arithmetic processing unit 1 is a central unit that performs various processes. For example, the present location is detected based on information output from various sensors 7 and 8, the GPS receiver 9, the FM multiplex broadcast receiver 10, and the like. Further, map data necessary for display is read from the storage device 3 or the ROM device 6 based on the obtained current location information.

  The arithmetic processing unit 1 develops the read map data in graphics, and displays a mark indicating the current location on the display 2 in a superimposed manner. Further, using the map data or the like stored in the storage device 3 or the ROM device 6, the starting point (current location) and the destination (or the waypoint, transit point, stopover point, etc.) instructed by the user ) Are searched for the optimum route (recommended route). Further, the user is guided using the speaker 42 and the display 2.

  The arithmetic processing unit 1 of the navigation device 100 has a configuration in which each device is connected by a bus 25. The arithmetic processing unit 1 includes a CPU (Central Processing Unit) 21 that executes various processes such as numerical calculation and control of each device, and a RAM (Random Access Memory) that stores map data, arithmetic data, and the like read from the storage device 3. ) 22, a ROM (Read Only Memory) 23 for storing programs and data, and an I / F (interface) 24 for connecting various types of hardware to the arithmetic processing unit 1.

  The display 2 is a unit that displays graphics information generated by the arithmetic processing unit 1 or the like. The display 2 is configured by a liquid crystal display, an organic EL display, or the like.

  The storage device 3 is composed of at least a readable / writable storage medium such as an HDD (Hard Disk Drive) or a nonvolatile memory card.

  In this storage medium, a link table 200 that is map data (including link data of links constituting roads on a map) necessary for a normal route search device, and a route information table 250 are stored.

  FIG. 2 is a diagram showing the configuration of the link table 200. The link table 200 includes, for each mesh identification code (mesh ID) 201, which is a partitioned area on the map, link data 202 of each link constituting a road included in the mesh area.

  For each link ID 211 that is a link identifier, the link data 202 includes coordinate information 222 of two nodes (start node and end node) constituting the link, a road type 223 indicating the type of road including the link, and a link length. Link length 224 indicating the link travel time 225 stored in advance, a start connection link that is a link connected to the start node of the link, and an end connection link that is a link connected to the end node of the link A start connection link, an end connection link 226, a speed limit 227 indicating a speed limit of a road including the link, and the like are included.

  Here, by distinguishing the start node and the end node for the two nodes constituting the link, the upward direction and the downward direction of the same road are managed as different links.

  FIG. 3 is a diagram showing the configuration of the route information table 250. The route information table 250 is a table that stores, for each route number that identifies a route, the traveling order of the traveling links, the ID that identifies the traveling link, and the road attribute of the link.

  For example, the route information table 250 includes the route number 251 for specifying a route, the order 252 for specifying the traveling order of the traveling links, the link ID 253 for identifying the traveling links, and the road attributes identified by the link ID 253. And a road attribute 254 to be specified.

  The route number 251 stores a route number that is information for identifying a route from other routes.

  The order 252 stores information for specifying the traveling order of the links constituting the route.

  The link ID 253 stores a link ID that is information for specifying links specified in the order specified in the order 252 among the links constituting the route.

  The road attribute 254 stores information on the road attribute of the link specified by the link ID 253, that is, “general road” and “narrow road”. The “general road” includes road attributes corresponding to the type of management source, such as “national road”, “prefectural road”, and “city road”.

  Returning to FIG. The voice input / output device 4 includes a microphone 41 as a voice input device and a speaker 42 as a voice output device. The microphone 41 acquires sound outside the navigation device 100 such as a voice uttered by a user or another passenger.

  The speaker 42 outputs a message to the user generated by the arithmetic processing unit 1 as an audio signal. The microphone 41 and the speaker 42 are separately arranged at a predetermined part of the vehicle. However, it may be housed in an integral housing. The navigation device 100 can include a plurality of microphones 41 and speakers 42.

  The input device 5 is a device that receives an instruction from the user through an operation by the user. The input device 5 includes a touch panel 51, a dial switch 52, and other hardware switches (not shown) such as scroll keys and scale change keys.

  The touch panel 51 is mounted on the display surface side of the display 2 and can see through the display screen. The touch panel 51 specifies a touch position corresponding to the XY coordinates of the image displayed on the display 2, converts the touch position into coordinates, and outputs the coordinate. The touch panel 51 includes a pressure-sensitive or electrostatic input detection element.

  The dial switch 52 is configured to be rotatable clockwise and counterclockwise, generates a pulse signal for every rotation of a predetermined angle, and outputs the pulse signal to the arithmetic processing unit 1. The arithmetic processing unit 1 obtains the rotation angle from the number of pulse signals.

  The ROM device 6 includes at least a readable storage medium such as a ROM (Read Only Memory) such as a CD-ROM or a DVD-ROM, or an IC (Integrated Circuit) card. In this storage medium, for example, moving image data, audio data, and the like are stored.

  The vehicle speed sensor 7, the gyro sensor 8, and the GPS receiver 9 are used by the navigation device 100 to detect the current location (own vehicle position).

  The vehicle speed sensor 7 is a sensor that outputs a value used to calculate the vehicle speed.

  The gyro sensor 8 is composed of an optical fiber gyro, a vibration gyro, or the like, and detects an angular velocity due to the rotation of the moving body.

  The GPS receiver 9 receives a signal from a GPS satellite and measures the distance between the mobile body and the GPS satellite and the rate of change of the distance with respect to three or more satellites to thereby determine the current location, travel speed, and travel of the mobile body. It measures the direction.

  The FM multiplex broadcast receiver 10 receives an FM multiplex broadcast signal transmitted from an FM multiplex broadcast station. FM multiplex broadcasting includes VICS (Vehicle Information Communication System: Registered Trademark) information, current traffic information, regulatory information, SA / PA (service area / parking area) information, parking information, weather information, and FM multiplex general information. As text information provided by radio stations.

  The beacon receiving device 11 receives rough current traffic information such as VICS information, regulation information, SA / PA (service area / parking area) information, parking lot information, weather information, emergency alerts, and the like. For example, it is a receiving device such as an optical beacon that communicates by light and a radio beacon that communicates by radio waves.

  FIG. 4 is a functional block diagram of the arithmetic processing unit 1. As illustrated, the arithmetic processing unit 1 includes a main control unit 101, an input receiving unit 102, an output processing unit 103, a route searching unit 104, and a route excluding unit 105.

  The main control unit 101 is a central functional unit that performs various processes, and controls other processing units according to the processing content. In addition, information on various sensors, the GPS receiver 9 and the like is acquired, and the current location is specified by requesting the map matching unit 104 and the like. In addition, the travel history is stored in the storage device 3 for each link by associating the travel date and time with the position as needed. Further, the current time is output in response to a request from each processing unit. Further, an optimum route (recommended route) connecting the starting point (current location) and the destination instructed by the user is searched, and the user is guided using the speaker 42 and the display 2 so as not to deviate from the recommended route.

  The input receiving unit 102 receives an instruction from the user input via the input device 5 or the microphone 41, and controls each unit of the arithmetic processing unit 1 so as to execute processing corresponding to the requested content. For example, when the user requests a search for a recommended route, the output processing unit 103 is requested to display a map on the display 2 in order to set a destination.

  The output processing unit 103 receives screen information to be displayed, converts it into a signal for drawing on the display 2, and instructs the display 2 to draw.

  The route search unit 104 searches for a route to the destination using information indicating the current location detected by the main control unit 101, map data stored in the link table 200, and the like. Specifically, for example, the route search unit 104 searches for a route to the destination according to a route search method such as the Dijkstra method, with the position indicated by the information indicating the current location as the departure point. The route search unit 104 stores a route obtained as a result of the search in the route information table 250, and stores one of them as a recommended route.

  When the route searching unit 104 searches for a route, the route excluding unit 105 excludes a route having a characteristic of returning from a general road to a general road via a narrow road. The route excluding unit 105 does not exclude a route where the point of returning from a narrow road to a general road is near the departure point or near the destination.

  Each functional unit of the arithmetic processing unit 1, that is, the main control unit 101, the input receiving unit 102, the output processing unit 103, the route searching unit 104, and the route excluding unit 105 is constructed by the CPU 21 reading and executing a predetermined program. Is done. Therefore, the RAM 21 stores a program for realizing the processing of each functional unit.

  In addition, in order to make an understanding of the structure of the navigation apparatus 100 easy, each above-mentioned component is classified according to the main processing content. Therefore, the present invention is not limited by the way of classifying the components and their names. The configuration of the navigation device 100 can be classified into more components depending on the processing content. Moreover, it can also classify | categorize so that one component may perform more processes.

  Each functional unit may be constructed by hardware (ASIC, GPU, etc.). Further, the processing of each functional unit may be executed by one hardware or may be executed by a plurality of hardware.

[Description of operation]
Next, the operation of the navigation device 100 will be described.

  FIG. 5 is a flowchart of a detailed route search process for excluding, from the search target, a route that returns from a narrow road to a general road during route search. This flow is started when the navigation device 100 accepts a route search instruction from a user with designation of a destination.

  First, the route search unit 104 specifies an adjacent node having a minimum cost from the departure place as a search tip. Then, the attribute of the link that reaches the search tip is stored as the current link attribute (step S001).

  Specifically, the route search unit 104 inquires of the main control unit 101 about the current location, and the main control unit 101 specifies the current location (departure location) and passes it to the route search unit 104. Then, the route search unit 104 sets the current location as the departure location, and identifies a node adjacent to the departure location (arriving within one link). Then, the route search unit 104 specifies an adjacent node that minimizes the link cost from the departure place among such nodes, and specifies the node as a search tip. Then, the route search unit 104 identifies the link that reaches the search tip, and stores the attribute of the link as the current link attribute. For example, the route search unit 104 specifies the road attribute of the link that reaches the search tip by acquiring information on the road type 223 from the link data for the link stored in the link table 200.

  Next, the route search unit 104 newly specifies a node having the lowest link cost from the departure place among the nodes adjacent to the search tip as the search tip. Then, the attribute stored as the current link attribute is stored as the previous link attribute, and the attribute of the link reaching the search tip is stored as the current link attribute (step S002).

  Specifically, the route search unit 104 specifies a node adjacent to the search tip (arriving within one link). Then, the route search unit 104 specifies an adjacent node that minimizes the link cost from the departure place among such nodes, and newly specifies the node as a search tip. Then, the route search unit 104 identifies the link that reaches the search tip, and stores the attribute of the link as the current link attribute. At that time, the already stored current link attribute is saved as the previous link attribute.

  Next, the route search unit 104 determines whether the search tip is in contact with the destination (step S003). Specifically, the route search unit 104 determines whether or not the node specified as the search tip is a node in contact with the nearest link to the destination.

  When the search tip is in contact with the destination (“Yes” in step S003), the route search unit 104 ends the detailed route search process and instructs the main control unit 101 to present the route as a route candidate to the user. Make a request.

  When the search tip does not contact the destination (“No” in step S003), the route exclusion unit 105 has the previous link attribute “normal road” and the current link attribute information “narrow road”. Is determined (step S004). Specifically, the route exclusion unit 105 determines whether or not the information of the previous link attribute stored in step S002 is “general road”, that is, “national road”, “prefectural road”, “city road”, etc. Determine. If the previous link attribute information is “general road”, the route excluding unit 105 determines whether or not the current link attribute information stored in step S002 is “narrow road”.

  When the information of the previous link attribute applies to “general road” and the current link attribute is “narrow road” (“Yes” in step S004), the route excluding unit 105 displays flag information on the RAM 22 (not shown). Set to “ON”. Then, the route exclusion unit 105 returns the process to step S002 (step S005).

  If the previous link attribute information does not apply to “general road” or the current link attribute is not “narrow road” (“No” in step S004), the route exclusion unit 105 determines that the flag information is “ON” and Then, it is determined whether or not the information of the previous link attribute is “narrow road” and the information of the current link attribute is applicable to “general road” (step S006).

  Specifically, the route exclusion unit 105 determines whether or not the flag information on the RAM 22 set in step S005 is set to “ON”. If the flag information is set to “ON”, the route exclusion unit 105 determines whether the information of the previous link attribute is “narrow road”. If the information of the previous link attribute is “narrow road”, the route exclusion unit 105 indicates that the information of the current link attribute is “general road”, that is, “national road”, “prefectural road”, “city road”, etc. It is determined whether or not.

  If the flag information is not “ON”, the previous link attribute information is not “narrow road”, or the current link attribute information does not apply to “general road” (“No” in step S006), route exclusion The unit 105 returns the process to step S002.

  If the flag information is “ON”, the previous link attribute information is “narrow road”, and the current link attribute information is “general road” (“Yes” in step S006), the route The excluding unit 105 determines whether or not the search tip is within a predetermined distance from the departure point or the destination (step S007). Specifically, the route excluding unit 105 determines whether or not the position of the node at the search tip is within a predetermined distance from the departure point (for example, within a predetermined distance of 300 m), and the destination It is determined whether or not the position is within a predetermined distance (for example, within a predetermined distance of 300 m). Then, the route excluding unit 105 determines whether or not the node at the leading end of the search satisfies one of the following conditions: a predetermined distance from the departure place or a predetermined distance from the destination.

  When the search tip is within a predetermined distance from the departure point or destination (“Yes” in step S007), the route excluding unit 105 returns the process to step S002.

  When the search tip is not within the predetermined distance from the departure point and the destination (“No” in step S007), the route exclusion unit 105 sets the search tip node as a dead end node, and sets the next point of the search tip node. An adjacent node having the minimum cost is set as a search tip, and an attribute of a link reaching the search tip is stored as a current link attribute. Then, the route exclusion unit 105 returns the process to step S003.

  The above is the processing content of the detailed route search processing. In the above processing flow, for the predetermined distance used in step S007, the predetermined distance from the departure place and the predetermined distance from the destination are the same, but the distance is not limited to this and may be different.

  By performing the detailed route search process described above, the navigation device 100 can avoid searching for a route that passes from a general road through a narrow road and returns to the general road again during the route search. In addition, when the point returning from the narrow road to the general road is near the departure point or the destination, the route search is possible even if the route passes the narrow road from the general road and returns to the general road again.

  The embodiment of the present invention has been described above.

  According to one embodiment of the present invention, the navigation device 100 can set an efficient route while avoiding traveling on a narrow road as much as possible.

  6 and 7 are diagrams showing examples of route search by the navigation apparatus according to the present invention.

  6 and 7, a starting point 300 (or a starting point 305) and a destination 301 (or a destination 306) are shown, and links 310, 311 having a general road attribute as neighboring roads. 312, 313, and 314 and a link 315 having a narrow road attribute are shown. The link 310 is connected to the link 311 at the node 320, and is connected to the link 312 at the link 311 and the node 322. The link 312 is connected to the link 313 at the node 323, and the link 313 is connected to the link 314 at the node 324. The link 314 and the link 315 are connected at the node 321, and the link 315 is connected to the links 310 and 311 at the node 320.

  In FIG. 6A, the departure point 300 is located along the link 310, and a region 350 within a predetermined distance of the departure point 300 includes a node 320 to which the link 310 and the link 315 are connected. Yes. In addition, the destination 301 is located along the link 314, and a region 360 within a predetermined distance of the destination 301 includes a node 321 to which the link 314 and the link 315 are connected.

  In such a case, when searching for a route from the departure point 300 to the destination 301, assuming that all links have the same link cost, the link 310 enters the link 315 at the node 320 and the node 321 The route to the link 314 in FIG.

  In FIG. 6A, the route searched by the route search unit 104 is also the shortest route. Specifically, the attribute of the link 310 is “general road”, the attribute of the link 315 is “narrow road”, and the attribute of the link 314 is “general road”. It seems that such a route cannot be searched due to the specification of the detailed route search processing that cannot be searched because it corresponds to a route passing through a narrow road. However, in the state of FIG. 6A, the position of the node 321 returning from the narrow road to the general road, that is, the node 321 entering the link 314 from the link 315 is included in the area 360 within a predetermined distance from the destination 301. Therefore, it is possible to search even with such a route.

  In FIG. 6B, the departure point 305 is located along the link 311, and a region 320 within a predetermined distance of the departure point 305 does not include the node 320 to which the link 310 and the link 315 are connected. . In addition, the destination 306 is located along the link 314, and the area 360 within a predetermined distance of the destination 306 does not include the node 321 to which the link 314 and the link 315 are connected.

  In such a case, when searching for a route from the departure point 305 to the destination 306, assuming that all links have the same link cost, the link 311 enters the link 315 at the node 320, and the node 321 The route to the link 314 in FIG.

  However, in FIG. 6B, the route searched by the route search unit 104 is not the shortest route. For example, the route 311 enters the link 312 at the node 322 and enters the link 313 at the node 323. The path to the link 314 at the node 324 is the path.

  More specifically, first, in the route having the minimum cost, the attribute of the link 311 is “general road”, the attribute of the link 315 is “narrow road”, and the attribute of the link 314 is “general road”. is there. According to the specification of the detailed route search process that cannot be searched because it corresponds to a route passing through a narrow road, such a route is not searched because the node 321 is set to be impassable. Further, in the state of FIG. 6B, the position of the node 321 that returns from the narrow road to the general road, that is, the node 321 that enters the link 314 from the link 315 is included in the area 360 within a predetermined distance from the destination 306. There are no exemption exceptions. For this reason, the route having the minimum cost is not searched, the link 311 enters the link 312 at the node 322, the node 323 enters the link 313, and the node 324 searches for the route to the link 314.

  In FIG. 7A, the departure place 300 is located along the link 310, and an area 350 within a predetermined distance of the departure place 300 includes a node 320 to which the link 310 and the link 315 are connected. In addition, the destination 306 is located along the link 314, and an area 360 within a predetermined distance of the destination 306 includes a node 321 to which the link 314 and the link 315 are connected.

  In such a case, when searching for a route from the departure point 300 to the destination 306, assuming that all the links have the same link cost, the link 310 enters the link 315 at the node 320 and the node 321 The route to the link 314 in FIG.

  However, in FIG. 7A, the route searched by the route search unit 104 is not the shortest route, and for example, enters the link 311 at the node 320 from the link 310 and links 312 from the link 311 to the node 322. , The node 323 enters the link 313, and the node 324 reaches the link 314 as a route.

  Specifically, first, in the route having the lowest cost, the attribute of the link 310 is “general road”, the attribute of the link 315 is “narrow road”, and the attribute of the link 314 is “general road”. is there. According to the specification of the detailed route search process that cannot be searched because it corresponds to a route passing through a narrow road, such a route is not searched because the node 321 is set to be impassable. Further, in the state of FIG. 7A, the position of the node 321 that returns from the narrow road to the general road, that is, the node 321 that enters the link 314 from the link 315 is included in the area 360 within a predetermined distance from the destination 306. There are no exemption exceptions. Therefore, the route having the minimum cost is not searched, and the link 310 enters the link 311 at the node 320, the link 311 enters the link 312 at the node 322, the node 323 enters the link 313, and the node 324 enters the link 314. The route to reach is searched.

  In FIG. 7B, the departure point 305 is located along the link 311, and an area 350 within a predetermined distance of the departure point 305 does not include the node 320 to which the link 310 and the link 315 are connected. . In addition, the destination 301 is located along the link 314, and a region 360 within a predetermined distance of the destination 301 includes a node 321 to which the link 314 and the link 315 are connected.

  In such a case, when searching for a route from the departure point 305 to the destination 301, assuming that all links have the same link cost, the link 311 enters the link 315 at the node 320, and the node 321. The route to the link 314 in FIG.

  In FIG. 7B, the route searched by the route search unit 104 is also the shortest route. More specifically, first, the attribute of the link 311 is “general road”, the attribute of the link 315 is “narrow road”, and the attribute of the link 314 is “general road”. It seems that such a route cannot be searched due to the specification of the detailed route search processing that cannot be searched because it corresponds to a route passing through a narrow road. However, in the state of FIG. 7B, the position of the node 321 that returns from the narrow road to the general road, that is, the node 321 that enters the link 314 from the link 315 is included in the area 360 within a predetermined distance from the destination 301. Therefore, it is possible to search even with such a route.

  The present invention is not limited to the above embodiment. The above embodiment can be variously modified within the scope of the technical idea of the present invention. For example, the detailed route search processing in the above embodiment can be the processing content shown in FIG.

  FIG. 8 is a flowchart of a detailed route search process for excluding, from the search target, a route returning from a narrow road to a general road during route search. This flow is started when the navigation device 100 accepts a route search instruction from a user with designation of a destination.

  First, the route search unit 104 searches for a plurality of routes to the departure destination by a search method such as the Dijkstra method (step S101).

  Next, the route search unit 104 determines whether there is an unevaluated route among the plurality of routes searched in step S101 (step S102).

  If there is no unevaluated route (“No” in step S102), the route search unit 104 presents the route of “non-exclusion” evaluation to the user as a recommended route candidate, and ends the detailed route search process. (Step S103).

  When there is an unevaluated route (“Yes” in step S102), the route exclusion unit 105 selects one route from the unevaluated routes (step S104).

  Next, the route excluding unit 105 includes a link of “narrow road” on the destination side of the link whose attribute is “general road” in the order from the departure point of the selected route to the destination. Further, it is determined whether or not a portion having a feature of including a link that is a “general road” on the destination side is included (step S105).

  When the portion having the feature is not included (“Yes” in step S105), the route excluding unit 105 advances the process to step S109.

  When the portion having the characteristic is included (“No” in step S105), the route excluding unit 105 indicates that all nodes indicating intersections entering the “narrow road” from the “general road” in the portion are in the vicinity of the departure point. Alternatively, it is determined whether it is included in the vicinity of the destination (step S106).

  Specifically, the route excluding unit 105 extracts all the nodes indicating the intersections that enter the “narrow road” from the “general road” in the portion, and all the extracted nodes have a predetermined distance ( For example, it is determined whether it is included in any range within 300 m) or within a predetermined distance (for example, 300 m) from the destination.

  If there is a node that is not included in the vicinity of the departure point or destination (“No” in step S106), even if one of the nodes indicating the intersection that enters the “narrow road” from the “general road” (step S106), the route exclusion unit 105 designates the evaluation of the selected route as “excluded”. Then, the route exclusion unit 105 returns the process to S102 (step S107).

  When all the nodes indicating the intersections entering the “narrow road” from the “general road” are included in the vicinity of the departure point or the destination (“Yes” in step S106), the route excluding unit 105 It is determined whether or not all nodes indicating intersections entering from the “narrow road” to the “general road” are included in the vicinity of the departure point or the vicinity of the destination (step S108).

  Specifically, the route excluding unit 105 extracts all the nodes indicating intersections that enter the “general road” from the “narrow road” from the portions having the characteristics determined in step S105, and all the extracted nodes are Then, it is determined whether it is included in any range within a predetermined distance (for example, 300 m) from the departure place or within a predetermined distance (for example, 300 m) from the destination.

  If there is a node that is not included in the vicinity of the departure point or destination (“No” in step S108), even if one of the nodes indicating the intersection entering from the “narrow road” to the “general road” is present, the route exclusion unit In step S107, the process proceeds to step S107, and the selected route is evaluated as “excluded”.

  When all the nodes indicating the intersections entering the “narrow road” from the “general road” are included in the vicinity of the departure point or the vicinity of the destination (“Yes” in step S108), the route excluding unit 105 selects the selected route. The evaluation of is “non-excluded”. Then, the route exclusion unit 105 returns the process to S102 (step S109).

  The above is the content of the modified example of the detailed route search process.

  By doing in this way, it becomes possible to exclude the route via the narrow road from the searched route while suppressing an increase in the amount of calculation of the route search process which is a process with a high calculation processing load in the navigation device 100. .

  Further, in this modification, when the entry node from the general road to the narrow road is not included in the vicinity of the departure place or the vicinity of the destination, it is slightly different from the above embodiment in that it is “excluded”. . In order to make this the same specification as that of the above embodiment, it may be modified so that the process of step S106 in FIG. 8 is not performed. By modifying in this way, the same specifications as in the above embodiment can be obtained, in which the “exclusion” evaluation is not performed when the return node from the narrow road to the general road is included near the departure point or near the destination. .

  The above is an example of modification.

  In the above embodiment, an example in which the present invention is applied to an in-vehicle navigation device has been described. However, the present invention is not limited to an in-vehicle navigation device and can be applied to all navigation devices.

DESCRIPTION OF SYMBOLS 1 ... Arithmetic processing part, 2 ... Display, 3 ... Memory | storage device, 4 ... Voice output device, 5 ... Input device, 6 ... ROM device, 7 ... Vehicle speed sensor 8 ... Gyro sensor, 9 ... GPS receiver, 10 ... FM multiplex broadcast receiver, 11 ... Beacon receiver, 21 ... CPU, 22 ... RAM, 23 ... ROM, 24 ... I / F, 25 ... Bus, 41 ... Microphone, 42 ... Speaker, 51 ... Touch panel, 52 ... Dial switch, 100 ... Navigation device, 101. ..Main control unit 102... Input reception unit 103... Output processing unit 104... Route search unit 105. Information table

Claims (3)

Route search means for searching for a route from the departure point to the destination;
When the route search means searches for a route, a detection means for detecting a point where the road type is changed from a general road to a narrow road and becomes a general road again;
Determination means for determining whether or not the point detected by the detection means satisfies a predetermined condition;
With
The route search means includes
When it is determined by the determination means that a predetermined condition is satisfied, a route including the point is searched to the destination,
If it is determined by the determination means that the predetermined condition is not satisfied, the route is searched excluding the point,
The predetermined condition is that the point detected by the detecting means is included in a range within a predetermined distance from the departure place, or included in a range within a predetermined distance from the destination,
A navigation device characterized by that. The navigation device according to claim 1,
In the process of searching for the route to be searched from the departure place to the destination, the route search means,
When a node connected to a link whose road type is a narrow road is detected on the route from a link whose road type is a general road, the node is identified as the first node. ,
When it is detected that the route closer to the destination than the first node includes a node connected from a link whose road type is a narrow road to a link whose road type is a general road, Identify the node as the second node,
If the second node is included in a range within a predetermined distance from the departure place, or if the second node is included in a range within a predetermined distance from the destination, the second node is routed Search for a route that includes
A navigation device characterized by that. The navigation device according to claim 1 or 2,
The route search means includes
Search multiple routes from the starting point to the destination,
Excluding a route that does not satisfy the predetermined condition from the plurality of routes;
A navigation device characterized by that.

Images