Mining Driving Preferences in Multi-cost Networks

Abstract

When analyzing the trajectories of cars, it often occurs that the selected route differs from the route a navigation system would propose. Thus, to predict routes actually being selected by real drivers, trajectory mining techniques predict routes based on observations rather than calculated paths. Most approaches to this task build statistical models for the likelihood that a user travels along certain segments of a road network. However, these models neglect the motivation of a user to prefer one route over its alternatives. Another shortcoming is that these models are only applicable if there is sufficient data for the given area and driver. In this paper, we propose a novel approach which models the motivation of a driver as a preference distribution in a multi-dimensional space of traversal costs, such as distance, traffic lights, left turns, congestion probability etc.. Given this preference distribution, it is possible to compute a shortest path which better reflects actual driving decisions. We propose an efficient algorithm for deriving a distribution function of the preference weightings of a user by comparing observed routes to a set of pareto-optimal paths. In our experiments, we show the efficiency of our new algorithm compared to a naive solution of the problem and derive example weighting distributions for real world trajectories.