Generalized Maneuvers in Route Planning

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

HLINĚNÝ Petr MORIŠ Ondrej

Year of publication 2012
Type Article in Periodical
Magazine / Source Computing and Informatics
MU Faculty or unit

Faculty of Informatics

Citation
Web paper
Doi http://dx.doi.org/10.1007/978-3-642-25929-6_15
Field Informatics
Keywords route planning; road network; maneuver
Description We study an important practical aspect of the route planning problem in real-world road networks -- \emph{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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.