The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Online map-matching based on Hidden Markov model for real-time traffic sensing applications
Open accessAbstract
In many Intelligent Transportation System (ITS) applications that crowd-source data from probe vehicles, a crucial step is to accurately map the GPS trajectories to the road network in real time. This process, known as map-matching, often needs to account for noise and sparseness of the data because (1) highly precise GPS traces are rarely available, and (2) dense trajectories are costly for live transmission and storage. We propose an online map-matching algorithm based on the Hidden Markov Model (HMM) that is robust to noise and sparseness. We focused on two improvements over existing HMM-based algorithms: (1) the use of an optimal localizing strategy, the variable sliding window (VSW) method, that guarantees the online solution quality under uncertain future inputs, and (2) the novel combination of spatial, temporal and topological information using machine learning. We evaluated the accuracy of our algorithm using field test data collected on bus routes covering urban and rural areas. Furthermore, we also investigated the relationships between accuracy and output delays in processing live input streams. In our tests on field test data, VSW outperformed the traditional localizing method in terms of both accuracy and output delay. Our results suggest that it is viable for low latency applications such as traffic sensing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Cited by
A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation
Yuan, H., & Li, G. (2021) · Data Science and Engineering · doi:10.1007/s41019-020-00151-z · Cited by 389
Kaffash, S., Nguyen, A. T., & Zhu, J. (2021) · International Journal of Production Economics · doi:10.1016/j.ijpe.2020.107868 · Cited by 343
Resilience metrics and measurement methods for transportation infrastructure: the state of the art
Sun, W., Bocchini, P., & Davison, B. D. (2020) · Sustainable and Resilient Infrastructure · doi:10.1080/23789689.2018.1448663 · Cited by 295
A Survey of Traffic Data Visualization
Chen, W., Guo, F., & Wang, F.-Y. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2436897 · Cited by 294
Cross-Area Travel Time Uncertainty Estimation From Trajectory Data: A Federated Learning Approach
Zhu, Y., Ye, Y., Liu, Y., & Yu, J. J. Q. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3203457 · Cited by 35
Metadata
- Authors
- Goh, C. Y., Dauwels, J., Mitrovic, N., Asif, M. T., Oran, A., & Jaillet, P.
- Venue
- 2012 15th International IEEE Conference on Intelligent Transportation Systems
- Publisher
- IEEE
- Published
- 2012-09
- Pages
- 776-781
- OpenAlex
- W2145022515
- Cited by
- 228
- References
- 1
- FWCI
- 9.87
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.