Algorithm engineering exhibited an impressive surge of interest during the last years, spearheaded by one of the showpieces of algorithm engineering: computation of shortest paths. In principle, Dijkstra’s classical algorithm can solve this problem. However, for continental-sized transportation networks, Dijkstra’s algorithm would take up to 10 seconds for finding a suitable connection, which i...

Route planning is a popular application for mobile devices, but still some problems have not been solved for road networks of continental size. Major constraints are the limited resources, that do not allow entire road networks to be held in main memory. Only a fraction of the complete road network can be held in main memory at once – most of the data must reside in external memory. To allow ef...

Route planning is an important problem for a number of diverse applications including intelligent transportation systems, space applications, autonomous robotics, and military guidance and navigation systems [1, 4, 5, 9—11]. We address the routing problem in the context of route planning for aircraft (rotorcraft or fixed-wing, manned or unmanned), though our approach can be easily extended to t...

We consider the problem of finding cheapest flight routes through free route airspaces in a 2D setting. We subdivide the airspace into regions determined by a Voronoi subdivision around the points from a weather forecast. This gives rise to a regular grid of rectangular regions (quads) with every quad having an associated vector-weight that represents the wind magnitude and direction. Finding a...

We study a dynamic scenario of the static route planning problem in road networks. Particularly, we put accent on the most practical dynamic case – increased edge weights (up to infinity). We show how to enhance the scope-based route planning approach presented at ESA’11, [16] to intuitively by-pass closures by detours. Three variants of a detour “admissibility” are presented – from a simple on...

There is a variety ofapplications thatcan benefit from the ability oautomatically find optimal orgood routes from real maps. There have been therefore several efforts ocreate and use real maps in computer applications. However, for the purpose ofroute planning, maps cannot beseen as static and complete, as there are dynamic factors and missing information that affect the selection of good route...

This paper describes a methodology and initial results of predicting traffic by autonomous agents within a vehicle route planning system. The traffic predictions are made using AQ21, a natural induction system that learns and applies attributional rules. The presented methodology is implemented and experimentally evaluated within a multiagent-based simulation system. Initial results obtained by...

vi

Situation dependent route planning gathers increasing interest as cities become crowded and jammed. We present a system for individual trip planning that incorporates future traffic hazards in routing. Future traffic conditions are computed by a Spatio-Temporal Random Field based on a stream of sensor readings. In addition, our approach estimates traffic flow in areas with low sensor coverage u...

In this paper we discuss personalized planning (as opposed to personalized information retrieval) where instead of recommending atomic information assets to users, the goal is to construct composite plans that reflect the complex problem solving preferences of users within a particular domain. Specifically, we describe our dual approach to personalized route planning and bring together, for the...