基于分层道路网络的新型路径规划算法

为了降低路径规划算法的搜索空间，同时使得规划的结果更加合理，提出一种分层路径规划算法．该算法利用道路网络中道路的不同等级特性对路网进行分层处理，构造分层搜索策略，达到加快路径规划速度的目的．结合路径规划算法在实时车辆导航系统中的实际应用，给出了该算法的一个应用实例．实验结果表明，该算法能将路网中任意两点间的最短路径解算时间控制在1s之内．

A New Route Planning Algorithm Based on the Hierarchical Road Network

A hierarchical route planning algorithm is proposed in the paper to reduce the searching space of the algorithm, and makes the planning result more reasonable. Based on the different hierarchic rank of the roads in a road net, the algorithm processes the net by its hierarchical scenario, and constructs the hierarchical searching strategy, to promote the searching efficiency. As a practical application of the algorithm in real-time vehicle navigation systems, one example is given, and the experimental results show that the time for calculating the shortest path between two arbitrary points within the road network can be reached to within 1 second by the new algorithm.