presenter: mathias jahnke authors: m. zhang, m. mustafa, f. schimandl*, and l. meng
DESCRIPTION
ICC 2009. A Grid-Based Spatial Index for Matching between Moving Vehicles and Road Network in a Real-Time Environment. Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng Department of Cartography, TU M ü nchen - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/1.jpg)
Presenter: Mathias JahnkeAuthors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng
Department of Cartography, TU München*Chair of Traffic Engineering and Control, TU München
[email protected], www.carto-tum.de
ICC 2009
A Grid-Based Spatial Index for Matching between Moving Vehicles and Road Network
in a Real-Time Environment
Santiago, Chile, November 15~22, 2009
![Page 2: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/2.jpg)
- 2 -
• An efficient traffic management requires reliable knowledge that can be immediately derived from the current traffic state. The fact that better knowledge can be obtained from the larger data volume leads to challenges in data processing speeds. The more data being processed, the slower the current situation could be analyzed in high detail. A delay of analysis in turn may cause inaccurate and inconsistent results. Traffic state can be estimated with help of floating car data (FCD) solely or in addition to traditional techniques, e.g. by fusing FCD with local loop detector data orsection travel time data.
1. Background
• However, most of the literatures basically concern about the accuracy of the matching process. There is still a need to make sure the algorithm cando the map-matching efficiently, especially for real-time applications.
Part 1
![Page 3: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/3.jpg)
- 3 -
Real time application for traffic state estimation using FCD
Part 1
![Page 4: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/4.jpg)
- 4 -
• Find candidate links - Calculate the distance between a point and a line segment
Part 1
elsewherepPdpPd
pplPifPPdpplPd
jeie
jiejiPtoL ),(),,(min
),(')',()),(,(
00
0000
0P
'0P
),( 0 lPdPtoL
ip
jp
),( 0 lPdPtoL
0P
'0Pip
jp(a) (b)
![Page 5: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/5.jpg)
- 5 -
• Usually, the street network is represented by vectors of coordinate pairs corresponding to their start and endpoints, which are ordered by their connectivity. Given a random query point in space, it is very inefficient tofind its nearest line segment without using indexing structures.
2. Spatial Index
Part 2
• A spatial index is typically utilized in large spatial databases to optimize spatial queries, whereas the spatial index reported in this paper serves the purpose of accelerating the matching process between points and linesegments. Two special constraints should be satisfied:
- it should be easily established and implemented;
- it should lead to a maximum speed improvement of the matching process.
![Page 6: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/6.jpg)
- 6 -
• Grid-Based Spatial Index for point data
Part 2
dark grey square: base region; shallow grey squares: neighbouring blocks
{Affected blocks} = {base region} U {neighbouring blocks}
![Page 7: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/7.jpg)
- 7 -
• The index model for the organization of line segments
Part 2
dark grey square: base region; shallow grey squares: neighbouring blocks
Problem?
![Page 8: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/8.jpg)
- 8 -
• The index model for the organization of line segments
Part 2
dark grey square: base region; shallow grey squares: neighbouring blocks
Worst case: l (p1, p2)
![Page 9: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/9.jpg)
- 9 -
• The index model for the organization of line segments
Part 2
dark grey square: base region; shallow grey squares: neighbouring blocks
![Page 10: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/10.jpg)
- 10 -
• The index model for the organization of line segments
Part 2
dark grey square: base region; shallow grey squares: neighbouring blocks
Solution:
![Page 11: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/11.jpg)
- 11 -
• The index model for the organization of line segments
Part 2
Data structure of the proposed spatial index for linear data
![Page 12: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/12.jpg)
- 12 -
• The index model for the organization of line segments
Part 2
The established spatial index for the line segments l56, l78 and l9,10
![Page 13: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/13.jpg)
- 13 -
3. Experiments
Part 3
Road network
Spatial Index GPS-Points
Map Matching & Traffic state estimation in a real time enviorment
![Page 14: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/14.jpg)
- 14 -
Part 3
![Page 15: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/15.jpg)
- 15 -
Part 3
Worthwhile to mention is that with the proposed spatial index, an increase of the network size will not significantly slow down the matching speed.
X-axis: size of the road network (number of line segments); Y-axis: amount of moving vehicles;Z-axis: matching speed (Vehicles/ second)
![Page 16: Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng](https://reader034.vdocuments.mx/reader034/viewer/2022051018/56813521550346895d9c8783/html5/thumbnails/16.jpg)
- 16 -
• A tricky grid-based spatial index for linear data based on the decomposition principles.
• Reduced algorithmic complexity: O(n*n)O(n), which enables the real-time traffic state estimation.
• The spatial index proved to have considerably improved the computing speed for the point-to-line matching.
• Besides Graz, Austria, two large cities in Germany and one mega city in China which covers an urban area of about 3700 km2 and involves about 176000 road objects with more than one million line segments.
4. Conclusions
Part 4