Generalized Maneuvers in Route Planning for Computing and Informatics

Authors

  • Petr Hliněný Masaryk University, Faculty of Informatics, Botanická 68a, 602 00 Brno
  • Ondrej Moriš Masaryk University, Faculty of Informatics, Botanická 68a, 602 00 Brno

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 extend traditional Dijkstra's Algorithm in order to solve route planning queries in this model without prior adjustments of the underlying road network graph. Finally, we also briefly evaluate practical performance of our approach (as compared to ordinary Dijkstra on an amplified network graph).

Downloads

Download data is not yet available.

Downloads

Published

2012-08-10

How to Cite

Hliněný, P., & Moriš, O. (2012). Generalized Maneuvers in Route Planning for Computing and Informatics. COMPUTING AND INFORMATICS, 31(3), 531–549. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/1007

Issue

Section

Special Section Articles