| 摘要 |
<p>PURPOSE:To decrease extremely the number of search branches, and to execute a search in a short time by executing a route search by taking into consideration not only a route length between nodes but also a distance between the next candidate node and an object node. CONSTITUTION:A start node, an object node, and continuous intermediate nodes are denoted as S, G and Vi, Vj, respectively, and an evaluation function H(Vi, Vjx) for selecting the node Vj from the node Vi is defined by an expression. In this case, l(Vjx, G), l(Vi, Vjx), and L denote a distance between the next candidate node Vjx and the object node G, a distance between the present node Vi and the next candidate node Vjx, and the maximum distance between the nodes, respectively. Accordingly, values A(Vix, G) and B (Vi, Vjx) are normalized by the distance L. Wa and Wb are coefficients for weighting of each variable A(Vjx, G), and B(Vi, Vix). By varying suitably weighting of each term, an optimum route search can be executed.</p> |
