Real time navigation algorithm based on every vehicles being online

This paper aims to solve the problem that the real-time information is not accurate enough to reflect real-time traffic in road network in the existing real-time navigation algorithm. This paper considers to put all or the majority of motor vehicles of an urban area into network through unified navigation equipments, the server can get real-time speed of all networked vehicles on each road, then the server obtain the travel time of each section from the average speed combined to the journey of section. The city map can be abstracted into a directed graph and the shortest path from a node to any other node can be calculated by using Dijkstra algorithm. After filling the next hop addresses of these paths from one node to another node with the way of routing table, vehicle can obtain the shortest path list from a source node to a destination node in accordance with this when it request navigation. Systems real-timely monitor and count the vehicle speed on each section. The travel cost of a section can be determined to have changed when the change of speed is over a range, then the system recalculates the routing table related to the section to keep it in the optimal state of travel costs.