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...

When a natural disaster occurred, some roads cannot be used anymore and sometimes blocked. Also, survivors and refugees cannot follow the evacuation procedures by just using default maps after disaster. A previous study proposed a safety route guidance system that can be used after natural disasters by using participatory sensing. The system estimates safe routes and generates an evacuation map...

nowadays the quality of life is one of the factors that have special standing in the context of urban planning studies. this factor became significant due to the increasing importance of quality of life in the monitoring of public policy and its role as an efficient tool in the management and planning. urban life quality is usually measured through the surveying and evaluation of subjective per...

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, ...

We present improved methods for computing a set of alternative source-to-destination routes in road networks in the form of an alternative graph. The resulting alternative graphs are characterized by minimum path overlap, small stretch factor, as well as low size and complexity. Our approach improves upon a previous one by introducing a new pruning stage preceding any other heuristic method and...

This paper presents a multi-agent system for planning, plan optimization and plan executionmonitoring in a real-time railroad transportation scenario. The planning process is implemented as incremental anytime algorithm that is capable of integrating new task specifications in the ongoing planning and planexecutionprocess. An initial solution is obtained by executing thecontractnet protocol for...

This paper presents results from a comparison of text and speech input methods on TravelMan, a multimodal route guidance application for mobile phones. TravelMan provides public transport information in Finland. The application includes a range of input methods, such as speech and predictive text inputs. In this paper we present results from the user evaluation focusing on entry rates of multi-...