一种分层A~＊路径搜索算法及性能

The Hierarchical A~＊ Path-finding Algorithm and Performances

基于层次道路网提出了一种分层A*路径搜索算法,其特点是在同一层路网中采用A*算法,而在层次切换时采用一种启发式定向搜索入口节点的方法。既顾及了道路等级性和朝着目标行进等驾驶员的心理因素,又可以获得比传统算法更快的求解速度。实验表明,该算法是可行的、高效的。

We present a hierarchical A＊ path-finding algorithm based on hierarchical road networks in this paper,which should be immediately applied when the road sub-networks belongs to a same layer and another approach of heuristic directional search will be run when we want to find an entrance node from one layer to another.The algorithm not only considers the driver＇s psychological inclination（road＇s hierarchy and driving toward the destination） but also run more quickly than the traditional algorithms.The experiments show that this algorithm is feasible and efficient.