| 摘要 |
PROBLEM TO BE SOLVED: To provide a method of providing a route of shortest cost in a short time as the optimum route. SOLUTION: Two points are determined on the map data, an uppermost hierarchy on which a route is searched, is determined in accordance with the positional relationship between two points before searching the optimum route between two points on the map data, and further an intermediate hierarchy on which the route is not searched is determined in accordance with the positional relationship between two points from the intermediate hierarchy between the uppermost hierarchy and a lowermost hierarchy on which the routes are searched, to determine a search candidate hierarchy on which the route is searched. Then the optimum route between determined two points is searched while transferring to an upper hierarchy among the search candidate hierarchy in accordance with the expansion of a searching range. COPYRIGHT: (C)2006,JPO&NCIPI |
