Algorithm Based on Layering Search to Routes Planning of Vehicle Navigation System

Abstract:

This Paper Introduces a Method of Designing and Organizing Road Network Data and Clarifies Algorithm Based on Layering Search, Suitable for Computing the Routes of Vehicle Navigation in Big Districts. the Algorithm Is Calculated in the High Grade Road Network, and then in the Local Refinement. the Method Is to Get a Point in the Calculated High Grade Route and then Calculate the Optimal Route from the Start Point to the Point (the Selected Point Should Be a Node near to the End), so Does the End Point. the Algorithm Was Applied to the Routes Planning and the Experimental Results Show that the Use of Data Structure and Algorithm Saves Storage Space and Greatly Improves the Calculation Efficiency.

• Periodical: Applied Mechanics and Materials (Volume 214)
• Pages: 749-754
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.214.749
• Online since: November 2012
• Authors: Xiong He, Yi Yang Gao, Tao Chen
• Keywords: Algorithms Based on Layering Search, Global Positioning System (GPS), Routes Planning, Vehicle Navigation System

References

[1] Liu Jiyu, Li Zhenghang, Wan Yuehu etc. Principle and Application of Global Positioning System [M]. BeiJing: Surveying and Mapping Press, 1993: 126-130.

[2] Zhao Weihua, Zhang Fujia, Liang Hongbin. Research and Realization of Optimum Path Search in Vehicle Guidance and Location System [J]. Journal of Hangzhou Institute of Electronic Engineering, 2003, 23(1): 56-59.

[3] Sun Jiaping. Optimization Algorithm for Route Analysis in Embedded Navigation System [J]. Electronic Engineer, 2006, 32(9): 10-12.

[4] Meng Qinghao, Zhang minglu, Liu dawei, Peng shangxian. AGV Global Path Planning Using Double-Direction Algorithm [J]. Journal of Tianjin University, 1998, 31(6): 747-751.)

[5] Yue Yang, Gong Jianya. An Efficient Implementation of Shortest Path Algorithm based on Dijkstra Algorithm [J]. Journal of Wuhan Technical University of Surveying and Mapping, 1999, 24 (3): 210-212.

[6] Zhan F B. Three Fastest Shortest Path Algorithms on Real Road Networks [J]. Journal of Geographic Information and Decision Analysis, 1997, 1(1): 69-82.

[7] Yan Ge, Jian Wang, Youxin You, et al. Research Progress on Dynamic Route Planning of Vehicle Navigation [J]. Journal of Highway and Transportation Research and Development, 2010, 27(11): 113-117.

[8] Okutan II, Stephanedes Y J. Dynamic Prediction of Traffic Volume through Kalman Filtering Theory [J].Transportation Research Part B: Methodological, 1984, 18(1): 1-11.

DOI: 10.1016/0191-2615(84)90002-x

[9] SM ITH B L, DEMETSKYM J. Traffic Flow Forecasting: Comparison of Modeling App roaches [J]. Journal of Transportation Engineering, 1997, 123 (4): 261-266.

[10] MARK S D, MARK R C. Short2term Inter2urban Traffic Forecasts Using Neural Networks [J]. International Journal of Forecasting, 1997, 13(1): 21-31.