TPRGraphMM: Graph-Based Vehicle Map Matching by Travel Pattern Recognition

This paper presents TPRGraphMM, an innovative map matching model that incorporates travel pattern recognition into Graph-Based Vehicular Map Matching (GraphMM), and utilizes an automated parameter optimization framework to determine the model parameters to enhance the accuracy of map matching. In the field of map matching, adverse natural conditions often lead to data interruptions, resulting in sparse trajectories, which significantly increases the difficulty of accurately mapping trajectory data to the road network. To address this issue, the model proposed in this study offers an effective solution. The study utilizes the dataset collected by Tencent Maps for research purposes. TPRGraphMM has proven to substantially surpass existing methods in accuracy, Longest Common Subsequence (LCS), and precision. Notably, against the GraphMM model, our model achieved accuracy enhancements of 5.6<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">%</sup>,4.3<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">%</sup>, and 7.7% at 30-second, 60-second, and 120-second intervals, respectively. Concurrently, LCS improvements were recorded at 3.1%, 2.6%, and 4.4% for the same intervals. These results demonstrate the transformative impact of integrating travel mode recognition into map matching algorithms.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/msn63567.2024.00145
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TPRGraphMM: Graph-Based Vehicle Map Matching by Travel Pattern Recognition

Y E Fei, Mingbo Niu, Yang Liu, Ying Li
Data Management and Algorithms
article

TPRGraphMM: Graph-Based Vehicle Map Matching by Travel Pattern Recognition

Y E Fei, Mingbo Niu, Yang Liu, Ying Li
article en

Abstract

This paper presents TPRGraphMM, an innovative map matching model that incorporates travel pattern recognition into Graph-Based Vehicular Map Matching (GraphMM), and utilizes an automated parameter optimization framework to determine the model parameters to enhance the accuracy of map matching. In the field of map matching, adverse natural conditions often lead to data interruptions, resulting in sparse trajectories, which significantly increases the difficulty of accurately mapping trajectory data to the road network. To address this issue, the model proposed in this study offers an effective solution. The study utilizes the dataset collected by Tencent Maps for research purposes. TPRGraphMM has proven to substantially surpass existing methods in accuracy, Longest Common Subsequence (LCS), and precision. Notably, against the GraphMM model, our model achieved accuracy enhancements of 5.6<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">%</sup>,4.3<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">%</sup>, and 7.7% at 30-second, 60-second, and 120-second intervals, respectively. Concurrently, LCS improvements were recorded at 3.1%, 2.6%, and 4.4% for the same intervals. These results demonstrate the transformative impact of integrating travel mode recognition into map matching algorithms.

Chang'an University (CN), Tsinghua University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 66%
Data Management and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.