The Design And Implementation Of A Map-Matching Algorithm Based On Dead Reckoning

As the productivity is improving and the society of economics is advancing, vehicles have increasingly become the tool of transportation. The following phenomena of this are the obvious traffic jams and the increasing traffic accidents. One of the serious problems we have to encounter with is how to smooth the traffic jams and to decrease the probability of the traffic accident through the more effective and reasonable utility of road-resource. VNS (Vehicle Navigation System), as an subsystem of ITS(Intelligent Transportation System), which involves the GPS(Global Positioning System), GIS(Geographic Information System) and computer-science-application technology. While it is providing the convienent service for human-beings, VNS is also contributing itself to the task of smoothing the traffic jams and decreasing the probability of the traffic accident. Therefore, the performance of VNS is increasingly focused on.One of the main functions of VNS is to demonstrate the correct position of the vehicle timely for the user, and to provide some other navigation services (such as route-guidance, etc.), which are only possible after the navigation system calculates and outputs the reliable vehicle position through Map-Matching algorithm. Hence, a good Map-Matching algorithm is the basis to guarantee the nice performance of VNS.This thesis makes a study of a Map-Matching algorithm based on dead reckoning, specially on a global area Map-Matching algorithm and a local area Map-Matching algorithm.Then it describes a detailed design for the algorithm and carry out it through VC++6.0.Finally, on the current testing condition, through the analysis of the test on different kind of road situation, it concludes that the matching accuracy, the timeliness and the reliability of the Map-Matching algorithm based on dead reckoning is satisfactory relatively.