Map matching based on multi-layer road index
Introduction
The application of continuous location data in transportation research has become commonplace. It creates an increasing need for georeferencing, i.e. associating these data with other geographical objects for further analysis. One of the most frequently performed georeferencing tasks is to match GPS trajectories to road networks, often known as map matching (MM) (Zheng, 2015). In the on-line mode, the MM operation forms the foundation for navigation systems that have become an integrated part of driving experience (Hashemi and Karimi, 2014). In the off-line mode, it is mainly used to identify routes consisting of a sequence of intersections and roads. Once the routes are recovered, they can be used to examine route choice behavior (Giannotti et al., 2007, Liu et al., 2014, Zheng, 2015, Xie et al., 2017), determine travel times on road segments (Wang et al., 2014), and estimate the delay incurred at intersections (Liu et al., 2009), among other applications. It is the off-line mode that concerns us here.
To the best of our knowledge, no commercial software exists that performs map matching “automatically”, partly because road networks often come with vastly different formats and quality. Consequently, transportation researchers who are thrilled with the availability of GPS trajectories often face the daunting challenge of developing an MM algorithm to meet their own needs. The purpose of this paper is to address this challenge by proposing a new and efficient MM algorithm.
At first glance, MM seems a rather straightforward operation that typically consists of two steps: (1) identify the right road segment for each GPS point and (2) knit the matched segments together to form a continuous path. The devil, however, is in the details. On the one hand, GPS data for civilian applications is subject to a limit of location precision.1 In addition, any particular set of GPS trajectories may have errors generated by humans and instruments (Skog and Handel, 2009, Bhowmick and Narvekar, 2018). These errors often lead to irregular sampling intervals (SIs) that could turn a seemingly easy task into a difficult guesswork (Oran and Jaillet, 2017). On the other hand, road networks or maps available to researchers may be of limited quality. In some cases, these networks are simply out of date. More often, however, they may not be designed to cover all existing roads. For example, networks used for urban travel forecasting typically ignore minor local roads (Quddus et al., 2007, Yuan et al., 2012). If a portion of a GPS trajectory happens to lie on these roads, mismatching is inevitable. Hence, the key is to detect and resolve these data quality issues while performing map matching.
Interestingly, we humans can often correctly identify a path from a GPS trajectory littered with missing and/or erroneous data. One advantage of human judgment is the ability to rule out the “impossible” sub-routes created by the problematic GPS points, by taking a holistic view of the trajectory. Indeed, a path typically consists of just a few main distinctive segments which are often easily recognizable from such a holistic view (Gotsman and Kanza, 2015).
This insight leads to a class of “global” MM algorithms attempting to process multiple points together, sometimes even the entire trajectory, to infer the correct path. An early example in this class is the local look-ahead strategy (see e.g., Bernstein and Kornhauser, 1998, White et al., 2000). The idea is to simultaneously process several points to create a piecewise linear curve, which is then compared against the candidate curves formed by individually matched road links. Chawathe (2007) proposed a global algorithm that recognizes spatial heterogeneity in the positional accuracy of GPS points. The algorithm divides a trajectory into segments based on a measure of similarity between the trace points and nearby links. Those segments with higher similarity measures will be given priority when the actual matching operation takes place. Effectively, they are used as “anchors” to match low-similarity segments.
In this paper we propose a MM algorithm that utilizes topological information created through a network pre-process. The method first groups the links in the road network into segments, based on a set of rules called “Cross Continuity Conditions” (3C). The goal is to include in each segment the links that may share a street name and/or have similar orientation and geometry characteristics. For example, a long arterial street traversing through many city blocks may be represented as a single segment with a unique index. Accordingly, we introduce a semantic map called a multi-layer road index (MRI) system, in which segments are represented in the highest layer and links are in the lowest. Using the MRI system, the proposed algorithm, dubbed segment-based MRI (SMRI), first divides each trajectory into segments, and then applies a global strategy to find the best match for each segment. The SMRI algorithm is compared against three state-of-the-art MM algorithms from the literature, namely the hidden Markov matching (HMM) algorithm (Jagadeesh and Srikanthan, 2017), the multi-criteria dynamic programming matching (MDP) algorithm (Chen et al., 2014) and (3) the locality-based map-matching (LBMM) algorithm (Chandio et al., 2015). Two metrics are employed to evaluate the map matching quality: (1) the accuracy ratio of matched points, or ARP (i.e., the ratio of successfully matched trajectory points against manually verified ground truth trajectories); and (2) the time consumed in processing, or TCP (i.e., the average time required to process one thousand points). To get ground truth data, we design and perform numerous test drives with predefined paths that totals 234 km. GPS trajectories recorded during the test drives are used to evaluate the algorithms. The experiment results show that the SMRI algorithm consistently outperforms the benchmark algorithm in terms of both matching accuracy and efficiency.
Fig. 1 provides an overview of the study, which consists of three parts: preprocessing the map data to create the multi-layer road index system; preprocessing GPS data and segment-based matching. The rest of this paper is organized as follows. Section 2 discusses related studies. Section 3 defines the Multi-Layer Road Index (MRI) System and introduces the Cross Continuity Conditions (3C). It also develops an Extended Intersection Continuity Negotiation (EICN) algorithm. In Section 4, we present the SMRI algorithm and Section 5 reports the results of numerical experiments designed to evaluate the performance of the SMRI algorithm. The last section concludes the paper and discusses the directions for future research.
Section snippets
Literature review
Map matching (MM) algorithms have been extensively studied for more than two decades. Bernstein and Kornhauser (1998) and White et al. (2000) proposed a curve-to-curve MM method to support third-generation personal navigation assistants. Through comparison with point-to-point and point-to-curve matching, they recognize using road topological information can help improve matching quality. Pyo et al. (2001) proposed a multiple hypothesis technique, which relies on dead reckoning to fill the void
Definitions
A road map is generally represented as a directed network where nodes correspond to street intersections and links to road segments. The node-link structure is widely used in transportation because of its simplicity. However, for map matching such a structure loses some useful information, of which an important piece is the fact that many links can be viewed as belonging to a long “road”, referred as the cross-link relationship in this paper. Often such a relationship can be identified as a
Segment-based MRI (SMRI) algorithm
We are now ready to propose a map matching (MM) algorithm that utilizes the information embedded in the MRI system created in the previous section. The basic idea is to break the entire trajectory into segments and apply a global matching algorithm to each segment. Segmentation promises to better balance efficiency and accuracy because it (i) avoids being trapped in subpaths mistakenly identified by incremental matching, and (ii) reduces the work required to perform path enumeration and
Test data and environment
The test GPS data used in our experiment was collected by a mobile GPS application called “GPSkit”2. The data set includes 26 trajectory trips with a total distance of 234 km. Each test trip has an average sample interval of 2 s. The test road network (located in Xi’an, China) and sample trips recorded for the experiments are shown in Fig. 7. The network consists of links and GPS points. Basic statistics of the sample trajectories, such
Conclusions
In this paper we propose a new map matching algorithm for processing GPS trajectories for off-line applications. Our method takes a holistic view of the entire trajectory and finds its match by first dividing it into several segments. Such segmentation is enabled by preprocessing the original road network and creating a multi-layer road index (MRI) system. For each segment, a global map matching strategy is employed to identify the best match.
Our numerical experiments show that, when the sample
Acknowledgments
This research was funded by the Chinese National Nature Science Foundation (Grant No. 51908462, 71971178 and 51878062); the Special Fund for Basic Scientific Research Funds of Central Universities of Changan University (Grant No. 310821175025); the GAIA Collaborative Research Funds for Young Scholars and the Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University. The work was also partially funded by the United States National Science Foundation under the
References (45)
- et al.
Matching planar maps
J. Algorithms
(2003) - et al.
A green self-adaptive approach for online map matching
IEEE Access
(2018) - et al.
An introduction to map matching for personal navigation assistants
Geometr. Distrib.
(1998) - et al.
Trajectory outlier detection for traffic events: A survey
- Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C., 2005. On map-matching vehicle tracking data. In: ‘International...
- et al.
An Approach for Map-Matching Strategy of GPS-Trajectories Based on the Locality of Road Networks
(2015) - et al.
A study of pre-processing technique for map-matching schemes of gps-enabled vehicles
Ijcds J.
(2017) - Chawathe, S.S., 2007. Segment-based map matching. In ‘Intelligent Vehicles Symposium’, pp....
- et al.
Map-matching algorithm for large-scale low-frequency floating car data
Int. J. Geogr. Inform. Sci.
(2014) - F. Marchal, J. Hackney, K.W.A., Hackney, J., Axhausen, K.W., 2005. Efficient Map Matching of Large Global Positioning...
Trajectory pattern mining
Antmapper: an ant colony-based map matching approach for trajectory-based applications
IEEE Trans. Intell. Transp. Syst.
A dilution-matching-encoding compaction of trajectories over road networks
Geoinformatica
A critical review of real-time map-matching algorithms: Current issues and future directions
Comput. Environ. Urban Syst.
On-line map-matching framework for floating car data with low sampling rate in urban road networks
Iet Intell. Transp. Syst.
Map matching for low-sampling-rate gps trajectories by exploring real-time moving directions
Inform. Sci.
If-matching: towards accurate map-matching with information fusion
IEEE Trans. Knowledge Data Eng.
Online map-matching of noisy and sparse location data with hidden markov and route choice models
IEEE Trans. Intell. Transp. Syst.
Topological analysis of urban street networks
Environ. Plan. B: Plan. Des.
Adaptive fuzzy-network-based c-measure map-matching algorithm for car navigation system
IEEE Trans. Industr. Electron.
Likelihood-based offline map matching of gps recordings using global trace information
Transport. Res. Part C: Emerg. Technol.
Cited by (21)
Understanding the route choice preferences of private and dock-based public bike users using GPS data in Seoul, South Korea
2024, Journal of Transport GeographyA shared parking optimization framework based on dynamic resource allocation and path planning
2023, Physica A: Statistical Mechanics and its ApplicationsOptimal allocation and adjustment mechanism of shared parking slots considering combined parking resources
2023, Transportation LettersA map matching-based method for electric vehicle charging station placement at directional road segment level
2022, Sustainable Cities and SocietyCitation Excerpt :Compared to the existing studies on EVCS placement, this study contributes to the literature in the following aspects: (1) proposing an MCDM model based on the SMRI-based map matching technique to find the optimal solution in EVCS placement using directional road segments as the analysis unit; (2) considering traffic attributes, charging demand attributes, and land price in the TOPSIS model to select the optimal EVCS placement; (3) developing a new charging demand estimation method that considers the arrival trips and the variation of charging demand for different trip purposes; (4) presenting a method for evaluating the utility of the optimal solution for EVCS placement. The MRI system is a technique for pre-processing GIS road networks (Wu et al., 2021; Wu et al., 2020). It classifies all links in the GIS map of road networks into different groups.
A multiscale road matching method based on hierarchical road meshes
2024, Earth Science InformaticsA Path Increment Map Matching Method for High-Frequency Trajectory
2023, IEEE Transactions on Intelligent Transportation Systems