The offline map matching problem and its efficient solution

Abstract

In this paper we present an efficient solution to the offline map matching problem that occurs in the area of position measurements on a road network: given a set of measured positions, what was the most probable trip that led to these measurements? For this, we assume a user who moves according a certain degree of optimality across a road network. A solution has to face certain problems; most important: as a single measurement may be mapped to multiple positions on the road network, the total number of combination exceeds any reasonable limit.