Title :
A Fast Path Planning Algorithm for Vehicle Navigation System
Author :
Jun, Bi ; Zhu Guang-yu ; Xie Zheng-yu
Author_Institution :
Beijing Jiaotong Univ., Beijing
Abstract :
This paper proposes an algorithm for seeking the shortest path between two nodes in city´s road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not exceed 0(N), while N is the number of road network nodes. The application results show that the algorithm has good practicability.
Keywords :
computational complexity; path planning; road vehicles; search problems; transportation; trees (mathematics); algorithm analysis; bidirectional search; binary tree; path planning algorithm; raise seeking speed; road network nodes; time complexity; vehicle navigation system; Algorithm design and analysis; Binary trees; Bismuth; Equations; Gold; Joining processes; Navigation; Path planning; Road transportation; Road vehicles;
Conference_Titel :
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location :
Haikou
Print_ISBN :
978-0-7695-2875-5
DOI :
10.1109/ICNC.2007.26
