Research And Implementation Of Traffic Guidance

Traffic guidance system is a system that applies multiple technologies including computer engineering,data acquisition technology,communication technology,data processing technology and modern control technologies to intelligent transportation.Traffic guidance is a part of intelligent transportation managing,which is focused on how to provide a best path from origin and destination.The key to this is how to find out the shortest path.In this thesis,on basis of A*algorithm and Dijsktra algorithm,we study major technology of the shortest path of a city network with database of Shenyang streets.Firstly,the best path search algorithm is introduced,and Dijsktra is one of them.Because it is a traversal among origins and all other nodes,its calculation time is not ideal.A*algorithm is a heuristic algorithm.It is a search with direction approaching destination.Therefore,the calculation time is much shorter.A*algorithm is a kind of heuristic algorithm,searching from the start point to end point with direction.The traditional A*algorithm in the limited area and increase the angle estimation function two aspects to improve the construction.The double derection A*algorithm’s computation time is shorter than A*algorithm.In the end,we use winform to demonstrate the best path.Combined with Shenyang city network,the thesis also verifies the algorithm in urban and suburb.With part of the chosen node data,Dijkstra is used to evaluate the result of A*,and to estimate its optimization situation.