DocumentCode
3237017
Title
Dynamic Path Planning Algorithm Based on Time-Dependent Road Network
Author
Xuren Wang ; Chunfeng Ran
Author_Institution
Inf. Eng. Coll., Capital Normal Univ., Beijing, China
fYear
2012
fDate
6-8 Nov. 2012
Firstpage
222
Lastpage
225
Abstract
In order to solve the shortest path planning problem in the time-dependent road network, we proposed a landmark-oriented heuristic algorithm based on the dynamic shortest tree (DALT). Experimental results show that the DALT algorithm in dynamic scenarios, not only to ensure the robustness and accuracy of the query, but also get better query time. In addition, by comparison with the classical static shortest path algorithm, the DALT algorithm in the preprocessing time and query efficiency achieved better performance.
Keywords
path planning; query processing; traffic engineering computing; transportation; trees (mathematics); DALT algorithm; dynamic path planning algorithm; dynamic shortest tree; landmark-oriented heuristic algorithm; time-dependent road network; traffic conditions; Algorithm design and analysis; Educational institutions; Heuristic algorithms; Path planning; Planning; Roads; Routing; A*; heuristic search; landmark-oriented; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Systems (GCIS), 2012 Third Global Congress on
Conference_Location
Wuhan
Print_ISBN
978-1-4673-3072-5
Type
conf
DOI
10.1109/GCIS.2012.9
Filename
6449521
Link To Document