Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-depend...

Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we present two variants of a new compilation scheme from conformant probabilistic planning problems (CPP) to variants of classical planning. In CPP, we are given a set of actions – which we assume to be deterministic in this paper, a distribution over initial states, a goal co...

Planning is traditionally associated with the search for sequences of actions spread over time. In this paper we present a component placement problem (CPP), which is concerned with sequences of actions spread in the space of wide-area networks. We argue that, despite the lack of a time component, the CPP is a planning problem. We discuss complexity of the CPP and similarities between the CPP a...

In previous work we proposed a new evolutionary algorithm , GA , which incorporates features of both the classical search algorithm A and genetic algorithms. In this paper we describe the application of GA to a hard opti-misation problem, route planning in complex terrains for Computer Generated Forces (CGF). We report the performance of the algorithm on a large number of route-planning problem...

We provide an implementation of an exact route planning algorithm on a mobile device that answers distance queries in a road network of a whole continent instantaneously, i.e., with a delay of 20–200ms, which is virtually not observable for a human user. We exploit spatial and hierarchical locality properties to design a significantly compressed external-memory graph representation, which can b...

In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both optimal and conflict-free. We also present a set of...

There have been several e orts to create and use real maps in computer applications that automatically nd good map routes. In general, online map representations do not include information that may be relevant for the purpose of generating good realistic routes, including for example tra c patterns, construction, or number of lanes. Furthermore, the notion of a good route is dependent on a vari...

In this paper, we present an overview over existing speed-up techniques for timedependent route planning. Apart from only explaining each technique one by one, we follow a more systematic approach. We identify basic ingredients of these recent techniques and show how they need to be augmented to guarantee correctness in time-dependent networks. With the ingredients adapted, three efficient spee...

We present an algorithm to compute shortest paths on continental road networks with arbitrary metrics (cost functions). The approach supports turn costs, enables real-time queries, and can incorporate a new metric in a few seconds—fast enough to support real-time traffic updates and personalized optimization functions. The amount of metric-specific data is a small fraction of the graph itself, ...