2018
DOI: 10.1007/s41324-018-0214-y
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the performance of map matching algorithms for navigation systems: an empirical study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(6 citation statements)
references
References 27 publications
0
6
0
Order By: Relevance
“…The point-to-curve method projects each point to the geometrically closest edge, while the curve-to-curve matching algorithms align each vehicle traveling trajectories with the closest network road links. Although these approaches are simple and intuitive, they are sensitive to noise, and connectivity problems exist during link transitions, resulting in unexpected results (Quddus et al, 2006;Singh et al, 2019;White et al, 2000). In Bouju et al (2002), authors reviewed the point-to-point and point-to-curve algorithms for map-matching processes in rural and urban areas, and pointed out three essential factors: historical data, topological information, and road design characteristics to improve the matching accuracy.…”
Section: Geometric Algorithmsmentioning
confidence: 99%
“…The point-to-curve method projects each point to the geometrically closest edge, while the curve-to-curve matching algorithms align each vehicle traveling trajectories with the closest network road links. Although these approaches are simple and intuitive, they are sensitive to noise, and connectivity problems exist during link transitions, resulting in unexpected results (Quddus et al, 2006;Singh et al, 2019;White et al, 2000). In Bouju et al (2002), authors reviewed the point-to-point and point-to-curve algorithms for map-matching processes in rural and urban areas, and pointed out three essential factors: historical data, topological information, and road design characteristics to improve the matching accuracy.…”
Section: Geometric Algorithmsmentioning
confidence: 99%
“…Finally, four different paths in Beijing were taken as examples, and the effectiveness and superiority of this method were verified. Singh et al [6] collected 47 km of track route data set, compared the map matching algorithms based on geometry, topology and Kalman filter, and found that the performance of the map matching algorithm based on Kalman filter was significantly better than the other two algorithms. In this study, the map matching algorithm for traffic route planning was briefly introduced, the part of the optimal path selection in the traditional map matching algorithm was improved by using Bayes theorem, and finally the two algorithms were simulated.…”
Section: Introductionmentioning
confidence: 99%
“…As the essential data preprocessing step, the map-matching problem has been studied for more than two decades [14]. However, despite the massive number of map-matching algorithms proposed, only a few surveys [28,56,74,103,114,136] classify or compare them. Quddus [103] et al first summarised the early algorithms in 2007.…”
Section: Map-matching Algorithmsmentioning
confidence: 99%
“…Such categorisation was widely accepted but is now obsolete as it fails to classify most of the new methods proposed afterwards. Nevertheless, apart from some recent topic-specific surveys [56,74], this categorisation is still widely adopted by recent papers [73,101,118,122] and surveys [114], which indicates the need of a review in this field. Besides, recent works bring various new matching frameworks [112,119] and tuning techniques [57,63,81,95] to solve the map-matching problem on new types of positioning data (DGPS, inertial sensor, laser scanner [86], camera [71]) and new queries (lane-level map-matching [41,71,86]).…”
Section: Map-matching Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation