DocumentCode
531960
Title
A new path planning algorithm based on partitioned urban transportation network
Author
Lin, Cheng ; Meiling, Wang
Author_Institution
Sch. of Autom., Beijing Inst. of Technol., Beijing, China
Volume
8
fYear
2010
fDate
22-24 Oct. 2010
Abstract
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.
Keywords
geographic information systems; path planning; traffic engineering computing; transportation; GIS platform SuperMap; partitioned urban transportation network; path planning algorithm; real-time vehicle navigation; spatial distribution features; Geographic Information Systems; Navigation; Partitioning algorithms; Visualization; Dijkstra algorithm; SuperMap GIS; path planning; restricted searching area; urban transportation network;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location
Taiyuan
Print_ISBN
978-1-4244-7235-2
Electronic_ISBN
978-1-4244-7237-6
Type
conf
DOI
10.1109/ICCASM.2010.5619214
Filename
5619214
Link To Document