| 摘要 |
PURPOSE:To eliminate a rout including a backup part by the backup information obtained by communication between cars on road, display the shortest route, and allow the search of an optimum route even in a traffic backup. CONSTITUTION:A route searching part 52 searches, for example, a link 0-1-2 as an optimum route (first route candidate), a link 3-4-5 as a second route candidate, a link 0-6-4-5 as third route candidate, and the like up to a eighth route candidate, and stores them in a route candidate storing part 53. A backup presence judging part 54 judges the presence of a traffic backup by the information of a VIES receiver. In case of NO, the optimum route is displayed, and in case of YES, initialization is conducted with an ordinal (i) as 1 to judge whether a backup is present in the link of the i-th candidate. In case of YES, 1 is added to the candidate ordinal (i), the same judgment is conducted. Namely, the delay is present in any one of the link 0-2 in the first candidate, and the link 3-5 in the second candidate. In case of NO, the i-th candidate is displayed. Thus, by adding the dynamic information of backup, an optimum route capable of arriving at a target position can be determined. |
