Fast map matching method based on small lattice road network organization and structure

Abstract

The fast map matching method based on small-mesh route network organization structure comprises: (1) creating and storing the route network organization structure; (2) given point P(x, y) on map (x for longitude and y for latitude), finding out all routes of this point, and defining the grid with P as Grid(P); (3) finding out all routes in grids near Grid(P); (4) combining the results in (2) and (3); (5) to every combined route, calculating the projection distance d of P to the route, and selecting the one with minimal d as the final result. This invention improves efficiency and speed greatly and reduces grid number to 9 for searching.

Description

technical field [0001] The invention relates to a fast map matching method based on small grid road network organization structure for complex road network organization and management. Background technique [0002] Map matching is given the longitude and latitude of a point on the map, find out where the point is located on the map. Today, with the rapid development of urban traffic, the urban road network is becoming more and more complex, so the car terminal navigation system has been paid more and more attention by people. However, to realize a practical navigation system, many technical difficulties need to be solved. One of them is how to organize and manage large-scale road network information on a vehicle-mounted terminal with small memory and limited processing power, and realize a fast map matching algorithm on this basis. [0003] Traditional organization models mainly include R-tree and K-D-B tree. The methods of these two models are: divide the road network acc...

AI Technical Summary

Problems solved by technology

The main advantage of these two models is that it is easy to insert and delete operations, but the query operation is relatively slow because the tree ne

Images