p.1803
p.1807
p.1811
p.1819
p.1822
p.1826
p.1830
p.1835
p.1840
Research on Vehicle Path Planning Base on Intelligent Transport System
Abstract:
Typical shortest path is Dijkstra algorithm, its time complexity is O (n2). A map of the citys road network has many nodes, if we use the Dijkstra algorithm, the time complexity of the algorithm is too high and the speed of resolution this problem is slow. In order to change this situation, we are discussed from the aspects of algorithm design, puts forward the improved bidirectional search algorithm. Practice has proved that, the improved algorithm can improve the search speed and it suitable for intelligent transportation system.
Info:
Periodical:
Pages:
1822-1825
Citation:
Online since:
February 2014
Price:
Сopyright:
© 2014 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: