Share Email Print

Proceedings Paper

A quick route planning algorithm in vehicle navigation system
Author(s): Ying Song; Yanling Zhao; Jing Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

A quick route planning algorithm is proposed in the paper to improve searching efficiency and shorten calculating time. In order to reduce the data of computing and storage, the road network is divided into several small road networks called division road networks at first. The division road network is connected by boundary nodes and boundary edges. The start point and the end point are belonging to different division road networks. Then, the shortest path among the start point, the end point and boundary nodes is searched, the shortest path from the beginning point to the end point can be found by combining these shortest paths. By dividing the road network, searching space is reduced and searching time is shortened. Moreover, due to the shortest paths between boundary nodes are calculated and saved in computer in advance, so the computing time is shortened a lot. In the end of the paper, a practical application example of the algorithm in realtime vehicle navigation systems is given. The experimental results show that it's a good and efficiency way of calculating the shortest path between two arbitrary points within the road network.

Paper Details

Date Published: 10 November 2007
PDF: 5 pages
Proc. SPIE 6795, Second International Conference on Space Information Technology, 67954B (10 November 2007); doi: 10.1117/12.774570
Show Author Affiliations
Ying Song, China Univ. of Mining and Technology (China)
Henan Province Land and Resources Bureau (China)
Yanling Zhao, China Univ. of Mining and Technology (China)
Jing Zhang, China Univ. of Mining and Technology (China)

Published in SPIE Proceedings Vol. 6795:
Second International Conference on Space Information Technology
Cheng Wang; Shan Zhong; Jiaolong Wei, Editor(s)

© SPIE. Terms of Use
Back to Top