The Shortest Path Real-time Vehicle Monitoring And Navigation Systems Research

Route guidance is one of the most important functions in the vehicles monitoring and navigation system. With the wide application of global navigation and location technology,people have growing demands of solving the shortest path problem. Many experts domestic and overseas have studied on the shortest path problem and have proposed several kinds of methods of solving the shortest path problem. With which algorithm as well as how to optimize the algorithm to improve the efficiency are one of the focuses of this paper.In the vehicles monitoring and navigation system,realization of the shortest path can not be separated from real-time traffic information system. Road condition is changing constantly in traffic network,and it demands high time limit to find the shortest path from source to destination. So we must design real-time traffic information system in order to provide real-time,accurate and actual road condition for the shortest path. This is another focus of this paper and also is the ultimate goal of studying the shortest path in the vehicles monitoring and navigation system.The innovations of this paper are as follows:1 A method about optimal path searching based on Dijkstra algorithm is designed. A model of restricted searching area is proposed,and in this restricted area an optimal memory structure and searching strategy with heuristic information are realized.2 A weight determining model which is more in accord with road network is proposed.The paper first summarizes the composition and theory of the vehicles monitoring and navigation system. Several key technical topics are explained. Searching strategy and familiar shortest path algorithms are analyzed and discussed in detail. Aimed at the deficiency of traditional Dijkstra algorithm in the application,this paper designs a kind of method about optimal path searching based on Dijkstra algorithm. This optimal algorithm synthesizes three aspects: area restricted,memory structure and searching strategy with heuristic information. Limiting the area is the precondition,through which we can directly reduce unnecessary operations;on the base of restricted area,storage structure is optimized,and it also can reduce the memory space; the test shows that the number of nodes searched and the time spent on calculation have decreased obviously.In the real traffic network,all kinds of traffic information have greatly influenced path searching. Therefore,we must consider many factors synthetically which may influence running efficiency. On the basis of discussing the method of weight determining,a new method of weight determining is designed.Finally,the structure of Real-time traffic information system is analyzed as well as the collection,process and release project of real-time information.