Table of Contents
Fetching ...

Offline Map Matching Based on Localization Error Distribution Modeling

Ruilin Xu, Yuchen Song, Kaijie Li, Xitong Gao, Kejiang Ye, Fan Zhang, Juanjuan Zhao

TL;DR

This paper tackles offline map matching under sparse trajectories by addressing two core limitations: nonuniform localization error distributions across urban regions and the difficulty of handling local non-shortest paths. It introduces LNSP, which combines fine-grained LED modeling derived from fixed-route bus trajectories with a sliding-window offline MM framework that uses region-aware path scoring and NSP detection. The approach yields significant improvements in accuracy and efficiency on Shenzhen bus and taxi datasets, outperforming established baselines. The work demonstrates that region-specific LED modeling and local NSP handling can robustly enhance map matching in complex urban environments, with potential for broader multimodal extensions in the future.

Abstract

Offline map matching involves aligning historical trajectories of mobile objects, which may have positional errors, with digital maps. This is essential for applications in intelligent transportation systems (ITS), such as route analysis and traffic pattern mining. Existing methods have two main limitations: (i) they assume a uniform Localization Error Distribution (LED) across urban areas, neglecting environmental factors that lead to suboptimal path search ranges, and (ii) they struggle to efficiently handle local non-shortest paths and detours. To address these issues, we propose a novel offline map matching method for sparse trajectories, called LNSP, which integrates LED modeling and non-shortest path detection. Key innovations include: (i) leveraging public transit trajectories with fixed routes to model LED in finer detail across different city regions, optimizing path search ranges, and (ii) scoring paths using sub-region dependency LED and a sliding window, which reduces global map matching errors. Experimental results using real-world bus and taxi trajectory datasets demonstrate that the LNSP algorithm significantly outperforms existing methods in both efficiency and matching accuracy.

Offline Map Matching Based on Localization Error Distribution Modeling

TL;DR

This paper tackles offline map matching under sparse trajectories by addressing two core limitations: nonuniform localization error distributions across urban regions and the difficulty of handling local non-shortest paths. It introduces LNSP, which combines fine-grained LED modeling derived from fixed-route bus trajectories with a sliding-window offline MM framework that uses region-aware path scoring and NSP detection. The approach yields significant improvements in accuracy and efficiency on Shenzhen bus and taxi datasets, outperforming established baselines. The work demonstrates that region-specific LED modeling and local NSP handling can robustly enhance map matching in complex urban environments, with potential for broader multimodal extensions in the future.

Abstract

Offline map matching involves aligning historical trajectories of mobile objects, which may have positional errors, with digital maps. This is essential for applications in intelligent transportation systems (ITS), such as route analysis and traffic pattern mining. Existing methods have two main limitations: (i) they assume a uniform Localization Error Distribution (LED) across urban areas, neglecting environmental factors that lead to suboptimal path search ranges, and (ii) they struggle to efficiently handle local non-shortest paths and detours. To address these issues, we propose a novel offline map matching method for sparse trajectories, called LNSP, which integrates LED modeling and non-shortest path detection. Key innovations include: (i) leveraging public transit trajectories with fixed routes to model LED in finer detail across different city regions, optimizing path search ranges, and (ii) scoring paths using sub-region dependency LED and a sliding window, which reduces global map matching errors. Experimental results using real-world bus and taxi trajectory datasets demonstrate that the LNSP algorithm significantly outperforms existing methods in both efficiency and matching accuracy.

Paper Structure

This paper contains 24 sections, 2 equations, 8 figures, 5 tables.

Figures (8)

  • Figure 1: LNSP Framework
  • Figure 2: Sliding Window Matching Process
  • Figure 3: Local Non-Shortest Path
  • Figure 4: Local NP Detection
  • Figure 5: Examples of Sub-region GPS Error Distribution Fitting
  • ...and 3 more figures