Regional road network shortest path algorithm in vehicle navigation systems

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

According to the characteristics of the regional road network, analyze the connectivity among the road sections, and draw to seek the regional road network the shortest path algorithm between two nodes. First, the paper will introduce the research background and significance of the vehicle navigation system, and analyze the research status and development prospects of the issue; secondly, build the regional road network model according to the transportation network map; then further describes Floyd algorithm of the shortest path, and gives the C language code; finally, take actual traffic map in Tangshan city of Hebei province as network model, the paper achieves purpose by the use of Floyd algorithm and provides a scientific and rational calculation basis for system realization. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Li, Y., Yang, A., & Li, D. (2013). Regional road network shortest path algorithm in vehicle navigation systems. In Communications in Computer and Information Science (Vol. 392 PART II, pp. 343–353). Springer Verlag. https://doi.org/10.1007/978-3-642-53703-5_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free