A Fast Path Planning Algorithm for Vehicle Navigation System

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.

[1]  G. Pang,et al.  Adaptive route selection for dynamic route guidance system based on fuzzy-neural approaches , 1995, Pacific Rim TransTech Conference. 1995 Vehicle Navigation and Information Systems Conference Proceedings. 6th International VNIS. A Ride into the Future.

[2]  Mengyin Fu,et al.  A practical route planning algorithm for vehicle navigation system , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[3]  Grantham K. H. Pang,et al.  Adaptive route selection for dynamic route guidance system based on fuzzy-neural approaches , 1995 .

[4]  Xiong Luo,et al.  An Intensified Ant Colony System Algorithm Applied to a Class of Air Vehicle Route Planning Problem , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.