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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE International Geoscience and Remote Sensing Symposium proceedings S. 3109 - 3112
Hauptverfasser: Jincheng Jiang, Lixin Wu
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2014
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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