| 摘要 |
An optimal route searching method is provided to reduce the searching range and searching time by inserting heuristic cost, distance cost, and azimuth cost in a route searching process. A method for searching an optimal route from the present spot to the destination comprises the steps of: calculating the heuristic cost, distance cost, and azimuth cost to plural nodes(H1~H4,L1~L4,alpha1~alpha4) adjacent to the present spot; computing the cost of the weighted sum for each node by multiplying the heuristic cost, distance cost, and azimuth cost by a pre-set weighted value and adding up the result; and selecting the node with the minimum weighted sum cost from plural nodes, as a minimum cost adjacent node. |
