| 摘要 |
PROBLEM TO BE SOLVED: To reduce a calculation quantity necessary for searching a route so as to shorten a searching time. SOLUTION: When a linear distance from a search starting point Ps to a destination point Pd or to its peripheral point is represented by A, a total cumulative distance from the search starting point Ps to an intersection Pn1 adjacent to an aimed intersection pi is represented by D, and a linear distance from the search starting point Ps to the adjacent intersection Pn1, is represented by B, a cost C to the adjacent intersection Pn1 is found from the following equation: C=D+k(A-B); k means a coefficient. Then, a route requiring a minimum cost among the routes to the adjacent intersection Pn1 and this cost are stored in accordance with the adjacent intersection Pn1, and in the similar way, a route and its cost are stored in accordance with other adjacent intersection Pn2, etc. Subsequently, using the stored respective adjacent intersections Pn1, Pn2, etc., as the aimed intersections, a searching network is extended for searching a route to the destination. |
