Web and Wireless Geographical Information Systems, W2GIS 2018

  • Luaces M
  • Karimipour F
ISSN: 0302-9743
N/ACitations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

Map matching is not always perfect and sometimes produces mismatches. Thus, there is a degree of uncertainty for how well a map-matching algorithm will perform under certain circumstances. Circumstantial factors include accuracies of sensor data and surrounding road network structure, among others. This paper attempts to shed light on this uncertainty and proposes a methodology for predicting performances of map matching algorithms at given locations on a digital road network. In short, using a vehicle’s position, the proposed methodology can be employed to predict the performance of a mapmatching algorithm at that position. Since map-matching algorithms are different in their logic of matching vehicle’s positions to road segments, there should be a separate prediction algorithm based on the methodology for each mapmatching algorithm. To demonstrate the methodology’s benefits, a probability algorithm to predict the performance of a point-to-curve map-matching algorithm is outlined.

Cite

CITATION STYLE

APA

Luaces, M. R., & Karimipour, F. (2018). Web and Wireless Geographical Information Systems, W2GIS 2018 (Vol. 10819, pp. 124–142). Retrieved from http://link.springer.com/10.1007/978-3-642-37087-8%0Ahttp://link.springer.com/10.1007/978-3-319-90053-7

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