A Quick Map-Matching Algorithm by Using Grid-Based Selecting

Wang, Zuyun; Du, Yong; Wang, Gang; Wu, Dongrui

doi:10.1109/ettandgrs.2008.217

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we use the important notations and descriptions which are shown in the Table II. [12]. In order to balance a load in each sub-graph, our proposed technique guarantees that each sub-graph is created while satisfying a constraint.…”

Section: The Proposed Pre-processing Modelmentioning

confidence: 99%

“…Authors claimed that the process of pre-computing distances and partitioning a large network to small regions can save storage and computation cost. Author in [12] proposed quick mapmatching algorithm based on structure of road network, on which road network is divided into two levels and partitions into small grids (mesh). Author claimed that old road network model is not sufficient need to be adapted to the requirement for the efficient mapmatching.…”

Section: Related Workmentioning

confidence: 99%

“…Wherein spatial road network database, roads are modeled in the graph, where road junctions and road segments are nodes and edges, respectively. To propose new model of road network is fundamental problem in Geographic Information System (GIS) databases for LBS applications [9][10][11][12][13]. The best map-matching approaches are highly depended on the accuracy and correctness of underlying road networks [11].…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A Study of Pre-Processing Technique for Map-Matching Schemes of GPS-Enabled Vehicles

Chandio¹,

Zhang²,

Kalhoro³

et al. 2017

IJCDS

View full text Add to dashboard Cite

This study towards the Map-Matching process that is useful to align a location of Global Positioning System (GPS) of vehicles on the digital road networks. Today's GPS-enabled vehicles in developed countries generate a big volume of GPS data. On the other hand, the development of new roads in the city enables the road network very complex and difficult to match the vehicles' location. So therefore, different techniques (i.e., pre-processing techniques) may be applied before the map-matching process is a recent concern of the Intelligent Transport System (ITS) research community. In this paper, we introduce the pre-processing technique; splitting the road network graph and processing the Single Source Shortest Path (SSSP) in synchronize parallel processing in the Hadoop environment. The proposed technique enables the map-matching schemes efficient to align the GPS points on the digital road networks. In the experimental work, the results of the map-matching schemes (i.e., found in the literature review) incorporated with our proposed pre-processing technique shows better performance in aspect to the response time.

show abstract

Section: The Proposed Pre-processing Modelmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%