A route planning algorithm for the shortest distance based on the division road network

Jing Zhang; Li Li; Lin Zhang; Yijin Chen

doi:10.1117/12.765577

6 August 2007 A route planning algorithm for the shortest distance based on the division road network

Jing Zhang, Li Li, Lin Zhang, Yijin Chen

Proceedings Volume 6754, Geoinformatics 2007: Geospatial Information Technology and Applications; 67543K (2007) https://doi.org/10.1117/12.765577
Event: Geoinformatics 2007, 2007, Nanjing, China

Abstract

A division route planning algorithm for the shortest distance is proposed in the paper. The algorithm promotes searching efficiency and shortens calculating time. This paper first introduces the division road network which is different from traditional road network. The division road network model divide a road network into several division road networks. Vehicle navigation system can be accomplished in these division road networks. These division road networks are connected by TransferNodes and TransferLinks which are defined in ISO 19133 and extended in the division road network model. These division road networks can combine into an integrated road network or be divided further. Topology relationship of the road network is still integrated. The division route planning algorithm for the shortest distance is based on the division road network. The division route planning algorithm constructs the division searching strategy to shorten the route planning time by dividing the road network. A practical application example of the algorithm in real-time vehicle navigation systems is given. And the experimental results show that the result is correct and the time for calculating the shortest path between two arbitrary points within the road network can be shortened efficiently.

Citation Download Citation

Jing Zhang, Li Li, Lin Zhang, and Yijin Chen "A route planning algorithm for the shortest distance based on the division road network", Proc. SPIE 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 67543K (6 August 2007); https://doi.org/10.1117/12.765577

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available