A methodology for predicting performances of map-matching algorithms

  • Authors:

  • Hassan A. Karimi;Thomas Conahan;Duangduen Roongpiboonsopit

  • Affiliations:

  • Geoinformatics Laboratory, School of Information Science and Telecommunications, University of Pittsburgh, Pittsburgh, PA;Geoinformatics Laboratory, School of Information Science and Telecommunications, University of Pittsburgh, Pittsburgh, PA;Geoinformatics Laboratory, School of Information Science and Telecommunications, University of Pittsburgh, Pittsburgh, PA

  • Venue:
  • W2GIS'06 Proceedings of the 6th international conference on Web and Wireless Geographical Information Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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 map-matching 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 map-matching algorithm. To demonstrate the methodology's benefits, a probability algorithm to predict the performance of a point-to-curve map-matching algorithm is outlined.