| 摘要 |
PROBLEM TO BE SOLVED: To select an optimal route with the shortest distance (time) or the like from a plurality of routes while assuming no a priori knowledge and avoiding traffic stop, no entry, or the like. SOLUTION: An optimal route searching device includes: a means for evaluating a path in which the number of turns is gradationally increased from a one-time-turn L-shaped path to an LR shape and outputting a quasi-optimal route; a means for circulating route avoidance and traffic ban route avoidance including a pass, change, and backtracking measure, if unable to move forward or to turn in a predetermined direction in a searching area; a means for preventing overlapping search of the same routes in an area outside a searching assumed area, and a dynamic traffic improper route change area created by closing vehicular traffic or traffic jam, and cutting an unnecessary branch route or an unnecessary circulating route; a means for searching a direct advance priority measure by four kinds of azimuth priority arbitration methods in accordance with a goal direction when there is four azimuths; a means for searching a route by a measure modified to a priority arbitration method in accordance with a goal direction; and a means for cutting of an unnecessary route, determining a shortest equivalent distance route, determining a shortest searching time and outputting a shortest route. COPYRIGHT: (C)2011,JPO&INPIT |
