A Real Time Topological Map Matching Methodology for GPS/GIS-Based Travel Behavior Studies

2015 ◽  
pp. 422-439
Author(s):  
Carola A. Blazquez ◽  
Pablo A. Miranda
Keyword(s):  
Real Time ◽  
Spatial Data ◽  
Travel Behavior ◽  
Map Matching ◽  
Gps Measurements ◽  
Case Scenario ◽  
Topological Map ◽  
Gis Environment ◽  
Control And Management ◽  
Parameter Values

The map matching problem arises when GPS measurements are incorrectly assigned to the roadway network in a GIS environment. This chapter presents a real-time topological decision rule-based methodology that detects and solves spatial mismatches as GPS measurements are collected. A real-time map matching methodology is required in several applications, such as fleet management, transit control and management, and travel behavior studies, in which decision-making must be performed simultaneously with the movement of vehicles, individuals, or objects. A computational implementation in a real case scenario in Chile indicates that the algorithm successfully resolves over 96% of the spatial mismatches encountered in real time. Various algorithmic parameter values were employed to test the performance of the algorithm for data collected every 5 and 10 seconds. Overall, the algorithm requires larger buffer sizes and speed ranges to obtain better results with lower spatial data qualities.

A Real Time Topological Map Matching Methodology for GPS/GIS-Based Travel Behavior Studies

2014 ◽  
pp. 152-170 ◽  
Author(s):  
Carola A. Blazquez ◽  
Pablo A. Miranda
Keyword(s):  
Real Time ◽  
Spatial Data ◽  
Travel Behavior ◽  
Map Matching ◽  
Gps Measurements ◽  
Case Scenario ◽  
Topological Map ◽  
Gis Environment ◽  
Control And Management ◽  
Parameter Values

The map matching problem arises when GPS measurements are incorrectly assigned to the roadway network in a GIS environment. This chapter presents a real-time topological decision rule-based methodology that detects and solves spatial mismatches as GPS measurements are collected. A real-time map matching methodology is required in several applications, such as fleet management, transit control and management, and travel behavior studies, in which decision-making must be performed simultaneously with the movement of vehicles, individuals, or objects. A computational implementation in a real case scenario in Chile indicates that the algorithm successfully resolves over 96% of the spatial mismatches encountered in real time. Various algorithmic parameter values were employed to test the performance of the algorithm for data collected every 5 and 10 seconds. Overall, the algorithm requires larger buffer sizes and speed ranges to obtain better results with lower spatial data qualities.

scholarly journals Performance of a New Enhanced Topological Decision-Rule Map-Matching Algorithm for Transportation Applications

2012 ◽  
Vol 10 (6) ◽  
Author(s):  
C. Blazquez ◽  
P. Miranda ◽  
A. Ponce
Keyword(s):  
Decision Rule ◽  
Spatial Data ◽  
Map Matching ◽  
Matching Algorithm ◽  
Matching Problems ◽  
Gps Technology ◽  
Special Cases ◽  
Data Points ◽  
Gis Environment ◽  
Transportation Applications

Map-matching problems arise in numerous transportation-related applications when spatial data is collected usinginaccurate GPS technology and integrated with a flawed digital roadway map in a GIS environment. This paperpresents a new enhanced post-processing topological decision-rule map-matching algorithm in order to addressrelevant special cases that occur in the spatial mismatch resolution. The proposed map-matching algorithm includessimple algorithmic improvements: dynamic buffer that varies its size to snap GPS data points to at least one roadwaycenterline; a comparison between vehicle heading measurements and associated roadway centerline direction; and anew design of the sequence of steps in the algorithm architecture. The original and new versions of the algorithmwere tested on different spatial data qualities collected in Canada and United States. Although both versionssatisfactorily resolve complex spatial ambiguities, the comparative and statistical analysis indicates that the newalgorithm with the simple algorithmic improvements outperformed the original version of the map-matching algorithm.

Algorithm on real-time map-matching of multi-weight probability

2013 ◽  
Vol 26 (2) ◽  
pp. 166-170
Author(s):  
Yang Li ◽  
Xiaodong Zhang ◽  
Yuanlv Bao
Keyword(s):  
Real Time ◽  
Map Matching ◽  
Time Map

scholarly journals Development of Multilayer-Based Map Matching to Enhance Performance in Large Truck Fleet Dispatching

2021 ◽  
Vol 10 (2) ◽  
pp. 79
Author(s):  
Ching-Yun Mu ◽  
Tien-Yin Chou ◽  
Thanh Van Hoang ◽  
Pin Kung ◽  
Yao-Min Fang ◽  
...  
Keyword(s):  
Data Structures ◽  
Spatial Data ◽  
Spatial Information ◽  
Data Retrieval ◽  
Spatial Data Mining ◽  
Map Matching ◽  
Matching Algorithm ◽  
Table Method ◽  
Look Up Table ◽  
The Look

Spatial information technology has been widely used for vehicles in general and for fleet management. Many studies have focused on improving vehicle positioning accuracy, although few studies have focused on efficiency improvements for managing large truck fleets in the context of the current complex network of roads. Therefore, this paper proposes a multilayer-based map matching algorithm with different spatial data structures to deal rapidly with large amounts of coordinate data. Using the dimension reduction technique, the geodesic coordinates can be transformed into plane coordinates. This study provides multiple layer grouping combinations to deal with complex road networks. We integrated these techniques and employed a puncture method to process the geometric computation with spatial data-mining approaches. We constructed a spatial division index and combined this with the puncture method, which improves the efficiency of the system and can enhance data retrieval efficiency for large truck fleet dispatching. This paper also used a multilayer-based map matching algorithm with raster data structures. Comparing the results revealed that the look-up table method offers the best outcome. The proposed multilayer-based map matching algorithm using the look-up table method is suited to obtaining competitive performance in identifying efficiency improvements for large truck fleet dispatching.

Estimating productivity of earthmoving operations using spatial technologies1This paper is one of a selection of papers in this Special Issue on Construction Engineering and Management.

2012 ◽  
Vol 39 (9) ◽  
pp. 1072-1082 ◽  
Author(s):  
Ali Montaser ◽  
Ibrahim Bakry ◽  
Adel Alshibani ◽  
Osama Moselhi
Keyword(s):  
Real Time ◽  
Spatial Data ◽  
Data Fitting ◽  
Google Earth ◽  
Simulation Software ◽  
Distribution Functions ◽  
Automated Classification ◽  
Cycle Times ◽  
Automated Method ◽  
Spreadsheet Application

This paper presents an automated method for estimating productivity of earthmoving operations in near-real-time. The developed method utilizes Global Positioning System (GPS) and Google Earth to extract the data needed to perform the estimation process. A GPS device is mounted on a hauling unit to capture the spatial data along designated hauling roads for the project. The variations in the captured cycle times were used to model the uncertainty associated with the operation involved. This was carried out by automated classification, data fitting, and computer simulation. The automated classification is applied through a spreadsheet application that classifies GPS data and identifies, accordingly, durations of different activities in each cycle using spatial coordinates and directions captured by GPS and recorded on its receiver. The data fitting was carried out using commercially available software to generate the probability distribution functions used in the simulation software “Extend V.6”. The simulation was utilized to balance the production of an excavator with that of the hauling units. A spreadsheet application was developed to perform the calculations. An example of an actual project was analyzed to demonstrate the use of the developed method and illustrates its essential features. The analyzed case study demonstrates how the proposed method can assist project managers in taking corrective actions based on the near-real-time actual data captured and processed to estimate productivity of the operations involved.

Research on parallelized real-time map matching algorithm for massive GPS data

2017 ◽  
Vol 20 (2) ◽  
pp. 1123-1134 ◽  
Author(s):  
Hongyu Wang ◽  
Jin Li ◽  
Zhenshan Hou ◽  
Ruochen Fang ◽  
Wenbo Mei ◽  
...  
Keyword(s):  
Real Time ◽  
Gps Data ◽  
Map Matching ◽  
Matching Algorithm ◽  
Time Map

scholarly journals HiBuffer: Buffer Analysis of 10-Million-Scale Spatial Data in Real Time

2018 ◽  
Vol 7 (12) ◽  
pp. 467 ◽  
Author(s):  
Mengyu Ma ◽  
Ye Wu ◽  
Wenze Luo ◽  
Luo Chen ◽  
Jun Li ◽  
...  
Keyword(s):  
Real Time ◽  
Spatial Data ◽  
High Performance ◽  
Large Scale ◽  
Computation Time ◽  
Buffer Analysis ◽  
Data Volume ◽  
Time Buffer ◽  
Real World Datasets ◽  
Spatial Indexes

Buffer analysis, a fundamental function in a geographic information system (GIS), identifies areas by the surrounding geographic features within a given distance. Real-time buffer analysis for large-scale spatial data remains a challenging problem since the computational scales of conventional data-oriented methods expand rapidly with increasing data volume. In this paper, we introduce HiBuffer, a visualization-oriented model for real-time buffer analysis. An efficient buffer generation method is proposed which introduces spatial indexes and a corresponding query strategy. Buffer results are organized into a tile-pyramid structure to enable stepless zooming. Moreover, a fully optimized hybrid parallel processing architecture is proposed for the real-time buffer analysis of large-scale spatial data. Experiments using real-world datasets show that our approach can reduce computation time by up to several orders of magnitude while preserving superior visualization effects. Additional experiments were conducted to analyze the influence of spatial data density, buffer radius, and request rate on HiBuffer performance, and the results demonstrate the adaptability and stability of HiBuffer. The parallel scalability of HiBuffer was also tested, showing that HiBuffer achieves high performance of parallel acceleration. Experimental results verify that HiBuffer is capable of handling 10-million-scale data.

Sign in / Sign up

Export Citation Format

Share Document