KIT | KIT-Bibliothek | Impressum | Datenschutz

A fast and tight heuristic for A∗ in road networks

Strasser, Ben; Zeitz, Tim

We study exact, efficient and practical algorithms for route planning in large road networks. Routing applications often require integrating the current traffic situation, planning ahead with traffic predictions for the future, respecting forbidden turns, and many other features depending on the exact application. While Dijkstra’s algorithm can be used to solve these problems, it is too slow for many applications. A* is a classical approach to accelerate Dijkstra’s algorithm. A* can support many extended scenarios without much additional implementation complexity. However, A*’s performance depends on the availability of a good heuristic that estimates distances. Computing tight distance estimates is a challenge on its own. On road networks, shortest paths can also be quickly computed using hierarchical speedup techniques. They achieve speed and exactness but sacrifice A*’s flexibility. Extending them to certain practical applications can be hard. In this paper, we present an algorithm to efficiently extract distance estimates for A* from Contraction Hierarchies (CH), a hierarchical technique. We call our heuristic CH-Potentials. Our approach allows decoupling the supported extensions from the hierarchical speed-up technique. ... mehr

Verlagsausgabe §
DOI: 10.5445/IR/1000135205
Veröffentlicht am 12.07.2021
DOI: 10.4230/LIPIcs.SEA.2021.6
Zitationen: 2
Cover der Publikation
Zugehörige Institution(en) am KIT Institut für Theoretische Informatik (ITI)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2021
Sprache Englisch
Identifikator ISBN: 978-3-9597718-5-6
ISSN: 1868-8969
KITopen-ID: 1000135205
Erschienen in 19th International Symposium on Experimental Algorithms (SEA 2021). Ed.: D. Coudert
Veranstaltung 19th International Symposium on Experimental Algorithms (SEA 2021), Nizza, Frankreich, 07.06.2021 – 09.06.2021
Verlag Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI)
Seiten Art.-Nr.: 6
Serie Leibniz International Proceedings in Informatics (LIPIcs) ; 190
Schlagwörter route planning, shortest paths, realistic road networks
Nachgewiesen in Scopus
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page