Generalized Maneuvers in Route Planning

TL;DR

This paper introduces a generalized model for route planning that incorporates complex maneuvers like turn restrictions and traffic delays, and adapts Dijkstra's algorithm to efficiently handle these irregularities in road networks.

Contribution

It presents a novel, flexible model for maneuvers in route planning and extends Dijkstra's algorithm to work with this model without modifying the underlying graph.

Findings

The model can handle complex and negative maneuvers.

Enhanced Dijkstra's algorithm efficiently solves route queries with maneuvers.

Applicable to real-world road networks with irregularities.

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.