1 / 16

Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng

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

maite-york
Download Presentation

Presenter: Mathias Jahnke Authors: M. Zhang, M. Mustafa, F. Schimandl*, and L. Meng

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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 *Chair of Traffic Engineering and Control,TU München meng.zhang@bv.tum.de, www.carto-tum.de Santiago, Chile, November 15~22, 2009

  2. Part 1 1. Background • 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 or • section travel time data. • However, most of the literatures basically concern about the accuracy of the matching process. There is still a need to make sure the algorithm can • do the map-matching efficiently, especially for real-time applications. - 2 -

  3. Part 1 Real time application for traffic state estimation using FCD - 3 -

  4. Part 1 • Findcandidate links - • Calculate the distance between a point and a line segment (a) (b) - 4 -

  5. Part 2 2. Spatial Index • 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 to • find its nearest line segment without using indexing structures. • 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 line • segments. 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. - 5 -

  6. Part 2 Grid-Based Spatial Index for point data dark grey square: base region; shallow grey squares: neighbouring blocks {Affected blocks} = {base region} U {neighbouring blocks} - 6 -

  7. Part 2 The index model for the organization of line segments Problem? dark grey square: base region; shallow grey squares: neighbouring blocks - 7 -

  8. Part 2 The index model for the organization of line segments Worst case: l (p1, p2) dark grey square: base region; shallow grey squares: neighbouring blocks - 8 -

  9. Part 2 The index model for the organization of line segments dark grey square: base region; shallow grey squares: neighbouring blocks - 9 -

  10. Part 2 The index model for the organization of line segments Solution: dark grey square: base region; shallow grey squares: neighbouring blocks - 10 -

  11. Part 2 The index model for the organization of line segments Data structure of the proposed spatial index for linear data - 11 -

  12. Part 2 The index model for the organization of line segments The established spatial index for the line segments l56, l78 and l9,10 - 12 -

  13. Road network Spatial Index GPS-Points Map Matching&Traffic state estimation in a real time enviorment Part 3 3. Experiments - 13 -

  14. Part 3 - 14 -

  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) - 15 -

  16. Part 4 4. Conclusions • 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. - 16 -

More Related