A New Path Planning Algorithm Based on Partitioned Urban Transportation Network

摘要：

To meet the requirement of real-time vehicle navigation, a new path planning algorithm based on partitioned urban transportation network is proposed in this paper. The foundation of the algorithm is that an actual road network has its particular spatial distribution features, and GIS has strong visual editing functions for transportation network. According to the size of the transportation network, with the GIS platform SuperMap, we partition the network into a certain amount of rectangular blocks, and then according to the starting node and the destination node, the searching area of the algorithm is restricted reasonably. With the actual example given, the experimental results prove the high operational efficiency and strong practicality of the new algorithm.

关键词： path planning urban transportation network dijkstra algorithm restricted searching area supermap GIS

作者: Cheng Lin Wang Meiling

作者单位: School of Automation Beijing Institute of Technology Beijing, China

会议类型: 国际会议

会议名称: The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

会议地点: 太原

会议语种:英文

页码: 13-17

在线出版日期: 2010-10-22（万方平台首次上网日期，不代表论文的发表时间）