Generalized Maneuvers in Route Planning
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.
KeywordsRoad Network Distance Estimate Route Planning Transportation Research Part Query Algorithm
Unable to display preview. Download preview PDF.
- 8.Jiang, J., Han, G., Chen, J.: Modeling turning restrictions in traffic network for vehicle navigation system. In: Proceedings of the Symposium on Geospatial Theory, Processing, and Applications (2002)Google Scholar
- 10.Pallottino, S., Scutella, M.G.: Shortest path algorithms in transportation models: classical and innovative aspects. Technical report, Univ. of Pisa (1997)Google Scholar
- 11.Pohl, I.S.: Bi-directional and heuristic search in path problems. PhD thesis, Stanford University, Stanford, CA, USA (1969)Google Scholar
- 12.Schultes, D.: Route Planning in Road Networks. PhD thesis, Karlsruhe University, Karlsruhe, Germany (2008)Google Scholar