| 摘要 |
PURPOSE: To search the shortest route for connecting the present position to the goal on a route network data consisting of link and node within a shorter time. CONSTITUTION: An estimated route cost is divided into a plurality of ranges, a plurality of searching work memories having a column for recording a node under search are preliminarily prepared in conformation to each section, and the node stored in the searching work memory is transferred to the searching work memory having a larger route cost according to the search of the route. When the route cost to the goal is less than the route cost corresponding to the empty work memory S14, S15 at a point of time when at least one route to the goal could be searched, the route to the goal searched so far is determined as the shortest route without performing a further search. Thus, the number of routes to be searched can be suppressed, and the time required for the route search can be shortened. |
