Shortest path algorithms optimize the costs of a journey in a network. For route planning algorithms, networks are usually modeled as graphs. Different cost functions are used, like the length of a path, or the travel time. Costs are traditionally attached to edges in the graph. For some important route planning problems costs that are associated with pairs of edges can be identified. For examp...

We develop a web service for route finding in OpenStreetMap (OSM) following an activity-centred approach: the aim is not only to assist the user in travelling from A to B, but also to perform a series of specified activities along the way. This is particularly important e.g. for electric mobility, where activities can take place while the battery of the car is recharging. For specifying activit...

Current navigation systems provide clear guidance for moving from one place to another while taking little explicit account of traditional strategies for route planning. This study observed twelve older people working in pairs planning a route with the aim of extracting the benefits to older people for using their lifelong procedures. Conclusions include that personal requirements for routes ar...

We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy cost, on large scale road networks. The precomputation receives as input a directed graph, two edge weight functions t(e) and c(e), and a discrete interval [L,U ]. The resulting flexible query algorithm finds for a pa...

We consider the problem of designing lines in a public transport system, where we include user-optimal route choice. The model we develop ensures that there is enough capacity present for every passenger to travel on a shortest route. We present two different integer programming formulations for this problem, and discuss exact solution approaches. To solve large-scale line planning instances, w...

Ever since public transit agencies have found their way to the Web, they inform travelers using route planning software made available on their website. These travelers also need to be informed about other modes of transport, for which they have to consult other websites, or for which they have to ask the transit agency’s server maintainer to implement new functionalities. In this demo, we intr...

This thesis explores collaborative route planning for pedestrians, where the users’s experience with the system and with the suggested routes augment the route planning for other users. I describe a technique for sharing experiences between groups of users that share some common characteristics. The technique is demonstrated with an experimental application running on Smartphones and PDAs. The ...

hr this paper, H'e describe an interface agellt, nvo different route planning agents and a pilot study lVI!ich examined whether these agents could support a team planning task. The MokSAF interface ageut li11ks an Artificial brtel/igeuce (AI) route-planning agent to a Geographic Information S."stem (G/Si. The user .spec{fies a start and an end poim and the route-plwmillg agent finds a minimum c...

In this paper a novel method of reference places' detection to build topological models is described, as well as an algorithm for route planning based on Fuzzy Petri Nets. The proposed method for the detection of reference places does not employ sensory information but the information provided by the robot's control subsystem. The reference places and the navigation strategies between places ar...

A common, yet diicult, task for people is planning satisfactory driving routes. Automatic systems for driving directions exist, but one of their major diiculties is the range of individual diierence regarding what constitutes a good route and a bad route. We introduce an adaptive user interface for route planning that uses relative feedback to model individual route preferences. Our experiments...