A re-optimization dynamic shortest path algorithm for vehicle navigation

The traffic congestion changes over time in the real transportation network, and the vehicle navigation is a real-time processing. Both the accuracy and time performance of navigation algorithm are important. To respond rapidly to transportation network changes, this paper proposes two new dynamic s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Geoscience and Remote Sensing Symposium proceedings s. 3109 - 3112
Hlavní autoři: Jincheng Jiang, Lixin Wu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2014
Témata:
Algorithm design and analysis
dynamic variation
Educational institutions
Heuristic algorithms
Navigation
re-optimization method
shortest path
traffic congestion
Vehicle dynamics
vehicle navigation
Vehicles
ISSN:2153-6996
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The traffic congestion changes over time in the real transportation network, and the vehicle navigation is a real-time processing. Both the accuracy and time performance of navigation algorithm are important. To respond rapidly to transportation network changes, this paper proposes two new dynamic shortest path algorithms based on the re-optimization method. The algorithms take full advantage of the previous search results, thus they take relatively few computing time to obtain the optimal solution. Experimental results demonstrate that the proposed algorithms can be applied to vehicle navigation in the transportation network with dynamic variation of the travel times on arcs and runs much faster than the traditional Dijkstra algorithm.
ISSN:2153-6996
DOI:10.1109/IGARSS.2014.6947135