Realization of the Optimization of Dijkstra Algorithm in Vehicle Navigation

Article Preview

Abstract:

Vehicle navigation plays an important part in intelligent transportation. The optimal route of navigation was selected based on the optimization of the algorithm of Dijkstra in topology storage structure, node storage order in topology network and route weight of Dijkstra, thus reducing participating nodes, advancing optimization speed and improving efficiency in optimization process.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

399-403

Citation:

Online since:

June 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Wan Li, Huang Zhixiong. Research of Optimized Algorithm of Dijkstra Based on GIS in Selecting Address for Logistics Centre [J]. Application Research of Computers, 2007,8 (24): 289-291

Google Scholar

[2] Cai Jun, Li Qianfu, etc. Research and Realization of Optimized Algorithm of Dijkstra [J]. Information Technology. 2011.4

Google Scholar

[3] Feng Xinxin. Optimized Realization of Dijkstra Algorithm in Embedded GIS[J]. Journal of Beijing Technology University, 2009,10(29):873-876

Google Scholar

[4] Fu Meng-yin. Design and Implementation of Bidirectional Dijkstra Algorithm[J]. Journal of Beijing Technology University: English Edition, 2003,12 (4) :366-370

Google Scholar

[5] Zhu Yuxi, Cui Ruchun, etc. Research and Implement of Searching the Shortest Route through GPS[J]. Computer Engineering Design, 2005,26 (29):2437-2439

Google Scholar

[6] A quick map matching method suited to vehicle navigator system [J]. Journal of Beijing Technology University, 2005, 25(3):225-229

Google Scholar

[7] Kim S, Kim J H. Q-factor map matching method using adaptive fuzzy network[Z]. IEEE International Fuzzy Systems Conference, Seoul, Korea, 1999.

DOI: 10.1109/fuzzy.1999.793015

Google Scholar