Generalized maneuvers in route planning

Authors:
Petr Hlině/ný/;Ondrej Mori$#353/
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic
Venue:
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Year:
2011

Citing 7
Cited 0

Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Modeling Costs of Turns in Route Planning

Geoinformatica
Shortest Path Algorithms in Transportation models: classical and innovative aspects

Shortest Path Algorithms in Transportation models: classical and innovative aspects
Bi-directional and heuristic search in path problems

Bi-directional and heuristic search in path problems
Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

ACM SIGART Bulletin
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Scope-based route planning

ESA'11 Proceedings of the 19th European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study an important practical aspect of the route planning problem in real-world road networks --- maneuvers. Informally, maneuvers represent various irregularities of the road network graph such as turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. We propose a generalized model which can handle arbitrarily complex (and even negative) maneuvers, and outline how to enhance Dijkstra's algorithm in order to solve route planning queries in this model without prior adjustments of the underlying road network graph.