Skip to Main Content
The goal of map-matching algorithms is to identify the road taken by a vehicle and to compute an estimate of the vehicle position on that road using a digital map. In this paper, a map-matching algorithm based on interval analysis and the belief function theory is proposed. The method combines the outputs from existing bounded-error estimation techniques with piecewise rectangular roads that are selected using evidential reasoning. A set of candidate roads is first defined at each time step using the topology of the map and a similarity criterion, and a mass function on the set of candidate roads is computed. An overall estimate of the vehicle position is then derived after the most probable candidate road has been selected. This method allows multiple road junction hypotheses to efficiently be handled and can cope with missing data. In addition, the implementation of the method is quite simple, because it is based on geometrical properties of boxes and rectangular road segments. Experiments with simulated and real data demonstrate the ability of this method to handle junction situations and to compute an accurate estimate of the vehicle position.