An off-line map-matching algorithm for incomplete map databases

59Citations
Citations of this article
95Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The task of map-matching consists of finding a correspondence between a geographical point or sequence of points (e.g. obtained from GPS) and a given map. Due to many reasons, namely the noisy input data and incomplete or inaccurate maps, such a task is not trivial and can affect the validity of applications that depend on it. This includes any Transport Research projects that rely on post-hoc analysis of traces (e.g. via Floating Car Data). In this article, we describe an off-line map-matching algorithm that allows us to handle incomplete map databases. We test and compare this with other approaches and ultimately provide guidelines for use within other applications. This project is provided as open source. © European Conference of Transport Research Institutes (ECTRI) 2009.

Cite

CITATION STYLE

APA

Pereira, F. C., Costa, H., & Pereira, N. M. (2009). An off-line map-matching algorithm for incomplete map databases. European Transport Research Review, 1(3), 107–124. https://doi.org/10.1007/s12544-009-0013-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free