JP6478793B2 - Navigation device, travel route setting method and program - Google Patents

Description

  The present invention relates to a navigation device, a travel route setting method, and a program for setting a travel route of a vehicle to a destination.

  Conventionally, when there is a traffic jam section ahead on the toll road that is running, the required time and toll for the current route traveling directly in this traffic jam section, and once getting off the toll road avoiding this traffic jam section and paying again 2. Description of the Related Art A navigation device is known that determines a travel route of a vehicle by comparing a required time and a toll for a return route returning to a road (see, for example, Patent Document 1). Specifically, in this navigation device, (Case 1) when the required time of the return route is shorter than the time difference threshold than the required time of the current route, (Case 2) the increase in the toll on the return route is the current value. When the toll for the route falls within a range lower than the toll difference threshold, (Case 3) When both Case 1 and Case 2 are satisfied, the return route is the vehicle travel route Set as

JP 2008-58083 A

  By the way, in the navigation device disclosed in Patent Document 1, it is necessary to separately calculate the required time and toll for each of the current route and the return route, and then it is necessary to compare these calculation results, so the processing becomes complicated. There was a problem. Especially when there are multiple traffic congestion sections on the toll road, there may be multiple return routes included in the travel route to reach the destination, so the number of routes to be compared increases. Processing is further complicated. In addition, there is a problem that a route for getting on the toll road once getting off is selected and the toll on the toll road increases.

  The present invention was created in view of these points, and its purpose is to suppress an increase in tolls when setting a travel route to a destination in consideration of traffic congestion on a toll road. It is another object of the present invention to provide a navigation device, a travel route setting method, and a program that can simplify processing.

In order to solve the above-described problems, a navigation device according to the present invention includes a destination setting unit that sets a destination, and a map that stores map data including costs as transit times for each of a plurality of links corresponding to a road. When searching for a travel route to the destination based on the data storage means and the map data stored in the map data storage means, rejoin when rejoining the toll road of the same road type as the toll road once passed A route search means that searches for a travel route by adding costs and determines a travel route with the smallest total cost until reaching the destination. Toll roads of the same road type are all proportional to the distance. has, Ru toll road der continuous from toll road that once passed.

The travel route setting method of the present invention includes a step of setting a destination by the destination setting means and a map data including a cost as a transit time for each of a plurality of links corresponding to the road. When searching for a driving route, when rejoining a toll road of the same road type as the toll road that has passed once, the re-joining cost is added to search for the driving route, and the total cost to reach the destination is the smallest and a step of determining a travel route by the route searching means, toll roads of the same road type are all have a fee system which is proportional to the distance, Ru toll road der continuous from toll road that once passed.

The travel route setting program of the present invention is a map data storage for storing a map data including a cost as a passing time for each of a plurality of links corresponding to a road, and a destination setting means for setting a destination. And a toll road of the same road type as the toll road that has passed once when searching for a travel route to the destination based on the map data stored in the map data storage means , both of which are proportional to the distance It has a toll system, and when rejoining a toll road from a toll road that has passed once , the re-join cost is added to search the travel route, and the travel route with the smallest total cost to reach the destination is determined Function as route search means.

When rejoining a toll road having the same road type, a rejoining cost is added, so it is difficult for such a travel route to be determined as an optimal travel route with a small total cost, and once alighting a single toll road Increase in toll due to riding again can be suppressed. In addition, it is possible to perform a route search process equivalent to the conventional one in which the search branch is extended between the departure point and the destination without obtaining a plurality of routes to the destination and comparing the tolls. The processing can be simplified.
In addition, the above-mentioned toll roads of the same road type all have a charge system proportional to the distance, and by making the toll road continuous from the toll road that has passed once, the connected road system having a distance proportional charge system It becomes possible to suppress rejoining to the toll road.

  Further, the traffic information acquisition means for acquiring the traffic information described above, and a cost correction means for correcting the cost of the link associated with the traffic information based on the traffic information, the route search means includes the cost correction means. When searching for a travel route to the destination using the cost corrected by the above, it is desirable to perform a route search using the rejoining cost. This makes it possible to determine an optimal travel route without increasing tolls when traffic congestion or congestion occurs in some sections on the toll road.

  Further, the vehicle further comprises road type information storage means for storing road type information for specifying the road type of the toll road that has passed once, and the route search means stores the road type of the toll road to be merged again in the road type information storage means. When the road type is the same as the road type specified by the road type information, it is desirable to add the rejoining cost. Thereby, it can be easily known whether or not the toll road to be merged from now on is the same as the toll road once traveled.

  Further, it is desirable that the road type of the toll road that has traveled most recently is specified by the road type information described above. This makes it possible to reliably add the rejoining cost when joining the toll road that leads to an increase in tolls.

  In addition, it is preferable that the travel route search in consideration of the rejoining cost by the route search unit described above is performed when the traffic information is acquired by the traffic information acquisition unit. As a result, it is possible to determine an optimum travel route at the time when traffic congestion or congestion occurs while suppressing an increase in tolls on the toll road.

It is a figure which shows the detailed structure of the navigation apparatus of one Embodiment. It is a flowchart which shows the operation | movement procedure of the navigation apparatus which performs a route search after acquiring traffic information and performing cost correction. 3 is a flowchart showing a detailed operation of a route search process in step 108 shown in FIG. 2. It is explanatory drawing of the driving | running route which considered the confluence cost. It is a flowchart which shows the operation | movement procedure of the modification which performs the route search process in consideration of the rejoining cost whenever it acquires new traffic information. Replacement of the travel route when the toll corresponding to the travel route obtained in the second and subsequent route search processing is the same as the toll of the previous travel route or lower than the toll of the previous travel route It is a flowchart which shows the operation | movement procedure of the modification which performs this.

  Hereinafter, a navigation device according to an embodiment to which the present invention is applied will be described with reference to the drawings. FIG. 1 is a diagram illustrating a detailed configuration of a navigation device according to an embodiment. As shown in FIG. 1, the navigation device 100 of this embodiment includes a navigation controller 1, a map data storage device 2, an operation unit 3, a vehicle position detection unit 4, a display device 5, an audio unit 6, a beacon transceiver 7, an FM. A multiplex broadcast receiver 8 is included. This navigation device is mounted on a vehicle.

  The navigation controller 1 executes a predetermined operation program using a CPU, a ROM, a RAM, and the like, thereby performing a map image display operation around the vehicle position and a route search process for setting a travel route connecting the departure point and the destination. In addition, various functions such as a route guidance operation for guiding the traveling of the vehicle along the traveling route and a reception operation of traffic information sent from the VICS (registered trademark) center are realized. The detailed configuration of the navigation controller 1 will be described later.

  The map data storage device 2 is a storage medium that stores map data necessary for map display, facility search, route search, and the like and a reading device thereof. The map data storage device 2 stores map data in units of rectangular figure leaves divided into appropriate sizes by longitude and latitude. The map data of each leaf can be specified and read by designating the leaf number.

  The map data includes (1) a drawing unit composed of various data necessary for map display, and (2) a road unit composed of data necessary for various processes such as map matching, route search, and route guidance. (3) An intersection unit composed of detailed data of the intersection is included.

  Further, the drawing unit described above has a background necessary for displaying the VICS conversion layer data necessary for specifying the corresponding road based on the traffic jam information sent from the VICS center and the buildings or rivers. Layer data and character layer data necessary for displaying a city name, a road name, and the like are included.

  In the road unit described above, a line connecting a certain intersection on the road and another adjacent intersection is called a link, and an intersection connecting two or more links is called a node. The road unit includes a connection node table storing detailed data of all nodes and a link table storing detailed data of links specified by two adjacent nodes. In the link table, for each link, a cost (static cost) that is a time required for the passage of the link is associated.

  The map data storage device 2 is realized by a hard disk device or a semiconductor memory, or by a DVD and its reading device. Further, the map data storage device 2 may be replaced with a communication device (not shown) to acquire map data from an external map distribution server (not shown).

  The operation unit 3 is for receiving user instructions (operations), and includes various operation buttons and operation knobs. In addition, the operation unit 3 includes a touch panel attached to the screen of the display device 5, and an operation instruction can be performed when a user directly points a part on the screen with a finger or the like. Yes. The vehicle position detection unit 4 includes, for example, a GPS receiver, an orientation sensor, a distance sensor, and the like, detects the vehicle position (longitude, latitude) at a predetermined timing, and outputs the detection result.

  The display device 5 is configured by, for example, an LCD (liquid crystal display device), and displays a map image around the vehicle position based on the video signal output from the navigation controller 1. The audio unit 6 outputs a guidance voice or the like generated based on the voice signal input from the navigation controller 1 into the vehicle interior.

  The beacon transmitter / receiver 7 performs two-way communication via radio waves mainly with radio beacons installed on highways, and both with optical beacon transceivers installed mainly on general roads. The traffic information sent from the VICS center is received by performing the direct communication. The FM multiplex broadcast receiver 8 receives traffic information included in multiplexed data superimposed on a general FM broadcast. The traffic information received by the beacon transmitter / receiver 7 and the FM multiplex broadcast receiver 8 includes traffic information indicating how much the specific section on the road is congested, event information indicating an accident or freezing of the road, It includes regulatory information such as face-to-face traffic.

  Next, a detailed configuration of the navigation controller 1 will be described. 1 includes a map buffer 10, a map readout control unit 12, a map drawing unit 14, a vehicle position calculation unit 20, a facility search unit 30, a destination setting unit 32, a route search processing unit 34, and a state flag storage. A unit 35, a route guidance processing unit 36, a VICS information acquisition unit 40, a VICS information drawing unit 42, a cost correction unit 50, a travel route replacement unit 52, an input processing unit 60, and a display processing unit 70.

  The map buffer 10 temporarily stores map data read from the map data storage device 2. This map data includes data necessary for drawing map images, data necessary for searching facilities by specifying search conditions, data necessary for route search and route guidance, road type and traffic of toll roads At least data on fees is included. The map reading control unit 12 sends a map data reading request within a predetermined range in accordance with the vehicle position calculated by the vehicle position calculating unit 20 or the position designated by the user by operating the operation unit 3. Output to. Based on the map data stored in the map buffer 10, the map drawing unit 14 performs drawing processing necessary for displaying a map image on the display device 5 to create map image drawing data.

  The vehicle position calculation unit 20 calculates the vehicle position based on the detection data output from the vehicle position detection unit 4, and if the calculated vehicle position is not on the road of the map data, the vehicle position calculation unit 20 calculates the vehicle position. Perform map matching processing to correct.

  The facility search unit 30 searches for a facility that satisfies the search conditions set using the operation unit 3 based on the map data stored in the map buffer 10. For example, as a search condition, there may be a case where a facility genre is specified and candidate facilities are narrowed down, or a case where a telephone number or an address is specified to narrow down facilities. After a specific facility is extracted in this way, a route search process using this facility as a destination, a display of a map around the facility and detailed information, and the like are performed.

  The destination setting unit 32 sets a destination necessary for the route search processing performed by the route search processing unit 34. For example, a case where a facility extracted by a search by the facility search unit 30 is set as a destination or a point on a map image directly designated by a user by operating the operation unit 3 is set as a destination. It is done.

  The route search processing unit 34 sets a travel route (guidance route) connecting the departure point and the destination (or waypoint) according to a predetermined search condition by route search processing. For example, the vehicle position calculated by the vehicle position calculation unit 20 is set as the departure place. Further, the destination set by the destination setting unit 32 is set as the destination of the route search process. For specific contents of the route search process, various methods such as Dijkstra method and horizontal search method can be used.

  The state flag storage unit 35 stores a state flag as road type information for specifying the road type of the toll road when passing through a toll road when obtaining a travel route that reaches the destination by the route search process. If there are a plurality of travel route candidates in the course of the route search process, this status flag is set and stored for each travel route.

  The route guidance processing unit 36 superimposes and displays the guidance route obtained by the route search processing by the route search processing unit 34 on the map, or creates guidance route drawing data for displaying an enlarged view of a right / left turn intersection. At the same time, the route guidance processing is performed by generating an audio signal such as intersection guidance necessary for guiding the traveling of the vehicle along the guidance route.

  The VICS information acquisition unit 40 performs a process of acquiring traffic information (VICS information) transmitted from the VICS center and received by the beacon transmitter / receiver 7 and the FM multiplex broadcast receiver 8. The traffic information included in the traffic information may include not only the traffic congestion level (the level of traffic congestion and congestion) but also the travel time of the link (the time required for passing) along with the traffic congestion level.

  The VICS information drawing unit 42 performs drawing processing for creating traffic information image drawing data corresponding to traffic jam information, event information, and restriction information included in the traffic information acquired by the VICS information acquisition unit 40. For example, an arrow image as an auxiliary image having a color corresponding to the content (smooth, congestion, traffic jam) of the section specified by the traffic information is drawn, or the location specified by the event information or the regulation information is added to the content A process for drawing a predetermined icon image is performed.

  The cost correction unit 50 corrects the cost of the link associated with the traffic information (congestion information) based on the congestion information. When only the traffic congestion level is included in the traffic congestion information, the cost corresponding to each link is corrected by multiplying the original static cost by a weighting factor corresponding to the traffic congestion level (smooth, congestion, traffic congestion). Is called. For example, assuming that the weighting coefficient in the case of “smooth” is set to 1, the weighting coefficient in “congestion” is set to 2, and the weighting coefficient in “congestion” is set to 4, these weighting coefficients corresponding to the contents of the degree of congestion Is multiplied by the original static cost. Further, when both the congestion degree and the travel time are included as the traffic jam information, the cost of each link is corrected so that the cost corresponds to the travel time. In addition, the correction method based on the traffic jam information currently performed can be applied as it is for the correction of the cost by the cost correction unit 50.

  As a result of the route search processing unit 34 performing a plurality of route searches at different times by the route search processing unit 34, the travel route replacement unit 52 finds a toll corresponding to the second travel route obtained in the subsequent route search. When the toll corresponding to the first travel route obtained in (1) is the same or lower, the second travel route is replaced with the first travel route. Thereafter, processing such as display by the route guidance processing unit 36 is performed using the replaced second traveling route as a guidance route.

  The input processing unit 60 outputs commands for performing operations corresponding to various operation instructions input from the operation unit 3 toward each unit in the navigation controller 1. The display processing unit 70 receives the map image drawing data created by the map drawing unit 14 and the traffic information image drawing data created by the VICS information drawing unit 42, and overlays the traffic information image on the map image. The image is displayed on the screen of the display device 5.

  The destination setting unit 32 described above is the destination setting unit, the map buffer 10 is the map data storage unit, the route search processing unit 34 is the route search unit, the VICS information acquisition unit 40 is the traffic information acquisition unit, and the cost correction unit. Reference numeral 50 corresponds to the cost correction means, the state flag storage unit 35 corresponds to the road type information storage means, and the travel route replacement unit 52 corresponds to the travel route replacement means.

  The navigation device 100 according to the present embodiment has such a configuration. Next, an operation for setting a travel route to a destination partially including a toll road by route search processing will be described.

  FIG. 2 is a flowchart showing an operation procedure of the navigation device that searches for a route after acquiring traffic information and correcting a cost.

  The route search processing unit 34 determines whether route search processing is instructed by the user (step 100). If not instructed, a negative determination is made and this determination is repeated. Further, when a route search process is instructed by the user using the operation unit 3, an affirmative determination is made in the determination of step 100.

  Next, the route search processing unit 34 sets the vehicle position calculated by the vehicle position calculation unit 20 as a starting point of the route search processing, and also sets the destination set by the destination setting unit 32 for the route search processing. The destination is set (step 102). Further, the VICS information acquisition unit 40 determines whether or not traffic information has been acquired from the VICS center (step 104). When the traffic information is acquired, an affirmative determination is made, and the cost correction unit 50 corrects the cost of the link associated with the traffic information (congestion information) based on the traffic congestion information (step 106).

  After cost correction or when traffic information is not acquired and a negative determination is made in the determination in step 104, the route search processing unit 34 performs route search processing and performs the optimum from the departure point to the destination. A simple travel route (guidance route) is set (step 108). A predetermined route guidance process is performed by the route guidance processing unit 36 using the travel route set in this way.

  FIG. 3 is a flowchart showing the detailed operation of the route search process in step 108 shown in FIG. The operation procedure shown in FIG. 3 shows an example of route search processing, and route search processing having other algorithms may be performed.

  When the route search process is started, first, the route search processing unit 34 searches for an adjacent intersection adjacent to the target intersection (step 200). In addition to the intersection where two or more roads (links) intersect, the intersection includes a starting point and a destination set in the route search process, an entrance and an exit of a toll road such as a highway. At the start of the route search, an adjacent intersection adjacent to this departure point is searched with the departure point as the target intersection.

  Next, the route search processing unit 34 determines whether or not the searched adjacent intersection is an exit of a toll road (step 202). When the adjacent intersection is an exit of a toll road, an affirmative determination is made, and the route search processing unit 34 stores a state flag as road type information for identifying the road type of the toll road in the state flag storage unit 35 (step 204).

  Next, or when the adjacent intersection is not an exit of the toll road, after a negative determination is made in the determination of step 202, the route search processing unit 34 determines whether or not the searched adjacent intersection is the entrance of the toll road. (Step 206). When the adjacent intersection is an entrance of a toll road, an affirmative determination is made, and the route search processing unit 34 is the same as the toll road to which the road type of the toll road that is about to enter has passed once. It is determined whether or not (step 208). Here, the cases where “the road types are the same” include (1) the same name, (2) the toll road that has the same toll system and that continues from the toll road once passed, 3) All are toll roads that have a uniform section system (the charge is constant when traveling within a predetermined section regardless of the distance traveled), and are toll roads that continue from the toll road once passed. (4) All There are cases where the toll road is proportional to the distance and the toll road is continuous from the toll road once passed, or a combination of these.

  If the road type of the toll road to be entered is not the same as the road type of the nearest toll road that has passed once (including the case of entering the toll road for the first time), an affirmative determination is made in the determination of step 208 Is called. In this case, the route search processing unit 34 sets a rejoining cost to be added when the link costs are summed (step 210). If it is not the entrance of the toll road (negative determination in the determination of step 206) or the road type is different (negative determination in the determination of step 208), this re-merging cost is not set (or “ 0 ”is set).

  Next, the route search processing unit 34 calculates the total cost to the adjacent intersection (step 212). In the calculation of the total cost, in addition to the link cost corresponding to the link, this node cost is also added when the node cost as the time required for passing through the node is taken into consideration. In addition, when the rejoining cost is set in step 210 described above, the rejoining cost is also an addition target. When there are a plurality of adjacent intersections, the calculation of the total cost is performed separately for each adjacent intersection.

  Next, the route search processing unit 34 determines whether there is a common adjacent intersection (step 214). If there is a common adjacent intersection, an affirmative determination is made, and the route search processing unit 34 selects the route with the smaller total cost (step 216).

  Next, or when there is no common adjacent intersection, a negative determination is made in the determination in step 214, and then the route search processing unit 34 registers the previous adjacent intersection (step 218). In addition, the route search processing unit 34 determines whether or not the adjacent intersection coincides with the destination (step 220). If it does not match the destination, a negative determination is made, the process returns to step 200, and the processing after the next adjacent intersection search is repeated.

  Further, when the adjacent intersection coincides with the destination, an affirmative determination is made in the determination of step 220. In this case, the route search processing unit 34, when there is a travel route (existing travel route) to the destination via another route searched so far, to the newly searched destination The total cost of the travel route is compared with the total cost of the existing travel route, and a travel route with a small total cost is set as the guidance route (step 222).

  Next, the route search processing unit 34 determines whether the total cost to each adjacent intersection calculated in step 212 is smaller than the total cost of the optimum guide route set in step 222 at that time. Is determined (step 224). If there is an adjacent intersection with a small total cost, an affirmative determination is made, the process returns to step 200, and the processing after the next adjacent intersection search is repeated. On the other hand, if all of the total costs up to each adjacent intersection exceed the optimal total cost of guidance accounting already found at that time, a negative determination is made in the determination of step 224, and a series of route search processing Ends.

  As described above, in the navigation device 100 of the present embodiment, since the rejoining cost is added when joining the toll road having the same road type again, such a travel route is regarded as an optimal travel route with a small total cost. It becomes difficult to be determined, and an increase in toll due to getting off one toll road and getting on again can be suppressed. In addition, it is possible to perform a route search process equivalent to the conventional one in which the search branch is extended between the departure point and the destination without obtaining a plurality of routes to the destination and comparing the tolls. The processing can be simplified.

  In addition, when searching for a travel route to the destination using the corrected cost based on the acquired traffic information, a route search using the rejoining cost is performed, so that traffic jams or traffic congestion may occur in some sections on the toll road. When congestion occurs, it is possible to determine an optimal travel route without increasing tolls.

  Further, a state flag storage unit 35 for storing a state flag as road type information for specifying the road type of the toll road that has passed once is provided, and when the road type is the same as the road type specified by the stored state flag By adding the re-merging cost, it is possible to easily know whether or not the toll road to be merged is the same as the toll road that has once traveled.

  Further, by specifying the road type of the toll road that has traveled most recently, it is possible to reliably add the rejoining cost when joining the toll road that leads to an increase in tolls.

  Moreover, it becomes possible to suppress rejoining to the same toll road reliably by making the toll road of the same road type into the toll road with the same name. Or, toll roads of the same road type have the same toll system, and toll roads that continue from toll roads that have passed once are restrained from rejoining to a toll road that has the same toll system It becomes possible to do. In addition, all toll roads of the same road type have a toll road system with a uniform section system, and a toll road that has a uniform section system toll system by making the toll road continuous from the toll road once passed It is possible to suppress rejoining. In addition, all the toll roads of the same road type have a toll road that is proportional to the distance, and are toll roads that are continuous from the toll road that has passed once, so that the toll road has a toll road that is proportional to the distance. It is possible to suppress rejoining.

  FIG. 4 is an explanatory diagram of a travel route considering the merging cost. In FIG. 4, S is the departure place, M1 is the first toll road (for example, the Tokyo Outer Expressway), M2 is the second toll road (for example, the Metropolitan Expressway), and JCT is from the first toll road M1. Junction that branches to the second toll road M2, T is a traffic jam section occurring on the second toll road M2, IC1 is an interchange as an exit on the first toll road, IC2 is the second toll road M2 The interchange as the upper entrance, IC3 is the interchange as the exit on the second toll road.

  In the conventional route search process that makes it difficult to get off from the toll road once running, even if there is a traffic jam section T when driving on the first and second toll roads M1 and M2, the traffic jam is very heavy. As long as the section T is not long, the travel route R1 via the junction JCT is set and the route guidance is performed to the destination G.

  On the other hand, in the route search process of the present embodiment, even when getting off at the exit IC1 on the first toll road M1 and joining the toll road M2 again at the entrance IC2 on the second toll road M2, Since no special cost addition is performed at the time of getting on and off, an optimal travel route R2 (a minimum cost total) including a general road is determined based solely on the total cost for each link or node. . Moreover, since the road types of the first and second toll roads M1 and M2 are different from each other, even if a general road is included in the middle, the toll is increased compared to the travel route R1 in which the general road is not included in the middle. Never do.

  In addition, this invention is not limited to the said embodiment, A various deformation | transformation implementation is possible within the range of the summary of this invention. For example, in the above-described embodiment, after obtaining the traffic information (step 104 in FIG. 2) and correcting the link cost (step 106 in FIG. 2), the route search process considering the rejoining cost (FIG. 2). Step 108) is performed, however, the route search process may be performed in consideration of the rejoining cost regardless of whether the traffic information is acquired or the link cost is corrected based on the traffic information.

  Further, every time new traffic information is acquired, a route search process in consideration of the rejoining cost may be performed. FIG. 5 is a flowchart illustrating an operation procedure of a modified example in which a route search process is performed in consideration of the rejoining cost every time new traffic information is acquired. The flowchart shown in FIG. 5 is different from the flowchart shown in FIG. 2 in that after the route search process in step 108 is completed, the process returns to step 104 and repeats the traffic information acquisition determination and subsequent steps. In this way, when new traffic information is received, the route search process that considers the rejoining cost is repeated again, so that the optimal driving route when traffic congestion or congestion occurs increases the toll fee for toll roads It becomes possible to determine while suppressing the above.

  In addition, as a result of performing the route search process considering the rejoining cost multiple times at different times, the toll corresponding to the second travel route obtained in the later route search was obtained in the previous route search When the toll corresponding to the first travel route is the same or lower, the second travel route may be replaced with the first travel route.

  For example, in the operation procedure shown in FIG. 5, the route search process (step 108) is performed a plurality of times at different times. Alternatively, the route search process may be performed every time a predetermined time elapses or every time a predetermined distance is traveled.

  FIG. 6 shows a case where the toll corresponding to the travel route obtained in the second and subsequent route search processing is the same as the toll of the previous travel route or lower than the toll of the previous travel route. It is a flowchart which shows the operation | movement procedure of the modification which replaces a driving route. The flowchart shown in FIG. 6 differs from the flowchart shown in FIG. 3 in that steps 226 and 228 are added. Below, it demonstrates paying attention to these added points. Note that the first route search process is performed according to the flowchart shown in FIG. 3, and the second and subsequent route search processes are performed according to the flowchart shown in FIG.

  In the second and subsequent route search processing, after the optimum travel route is set as the guide route (negative determination in the determination in step 224), the travel route replacement unit 52 performs communication of the guide route newly set this time in step 222. It is determined whether the charge is the same as the communication charge of the guide route set last time or a fixed amount than the communication charge of the guide route set last time (step 226). If the amount is the same or lower, an affirmative determination is made, and the travel route replacement unit 52 replaces the new guide route with the previous guide route (step 228).

  In this way, the route search process is performed multiple times at different times, and when a guide route with the same or low communication fee is found, this new guide route is adopted to respond to changes in road conditions, etc. It is possible to determine an optimal travel route while suppressing an increase in tolls on toll roads.

  In the above-described embodiment, the navigation device 100 mounted on a vehicle has been described. However, the present invention can also be applied to route search processing performed by executing a map application on a mobile terminal device, a personal computer, or the like.

  As described above, according to the present invention, since the rejoining cost is added when rejoining the toll road having the same road type, such a travel route is determined as an optimum travel route with a small total cost. It becomes difficult to increase the toll due to getting off one toll road and getting on again. In addition, it is possible to perform a route search process equivalent to the conventional one in which the search branch is extended between the departure point and the destination without obtaining a plurality of routes to the destination and comparing the tolls. The processing can be simplified.

DESCRIPTION OF SYMBOLS 1 Navigation controller 2 Map data storage device 4 Vehicle position detection part 7 Beacon transmitter / receiver 8 FM multiplex broadcast receiver 10 Map buffer 12 Map reading control part 14 Map drawing part 20 Vehicle position calculation part 30 Facility search part 32 Destination setting part 34 Route search processing unit 35 Status flag storage unit 36 Route guidance processing unit 40 VICS information acquisition unit 42 VICS information drawing unit 50 Cost correction unit 52 Travel route replacement unit 100 Navigation device

Claims (7)

Destination setting means for setting the destination;
Map data storage means for storing map data including costs as transit times for each of a plurality of links corresponding to roads;
When searching for a travel route to the destination based on the map data stored in the map data storage means, a rejoining cost is added when rejoining a toll road of the same road type as the toll road that has passed once A route search means for searching for a travel route and determining a travel route with the smallest total cost to reach the destination;
Wherein the toll road with the same road type are all have a fee system which is proportional to the distance, the navigation device according to toll roads der characterized Rukoto continuing from toll road that once passed. In claim 1,
Traffic information acquisition means for acquiring traffic information;
Cost correcting means for correcting the cost of the link associated with the traffic information based on the traffic information;
The route search means performs a route search using the rejoining cost when searching for a travel route to the destination using the cost corrected by the cost correction means. Navigation device. In claim 1 or 2,
Road type information storage means for storing road type information for specifying the road type of the toll road that has passed once;
The route search means adds the rejoining cost when the road type of the toll road to be rejoined is the same as the road type specified by the road type information stored in the road type information storage means. A navigation device characterized by performing. In claim 3,
A navigation device characterized in that the road type of the toll road that has traveled most recently is specified by the road type information. In claim 2,
The navigation device according to claim 1, wherein the search for the travel route in consideration of the re-merging cost by the route search unit is performed when the traffic information is acquired by the traffic information acquisition unit. Setting a destination by a destination setting means;
When searching for a travel route to the destination based on map data including the cost as a transit time for each of a plurality of links corresponding to the road, it joins again with a toll road of the same road type as the toll road that has passed once A re-joining cost is added when searching for a travel route, and a travel route with the smallest total cost up to the destination is determined by the route search means;
Have a, the toll roads of the same road type are all have a fee system which is proportional to the distance, the travel route setting method characterized toll roads der Rukoto continuous from the time a toll road that has passed. Computer
Destination setting means for setting the destination;
Map data storage means for storing map data including costs as transit times for each of a plurality of links corresponding to roads;
When searching for a travel route to the destination based on the map data stored in the map data storage means, the toll road of the same road type as the toll road that has passed once , both of which are proportional to the distance When the road is merged again from the toll road that has passed once to the continuous toll road , a re-join cost is added to search for a travel route, and the travel route with the smallest total cost to reach the destination A route search means to determine;
Travel route setting program to make it function.

Images