Research On Reasonable Path Based On Kalman Filter And Dijkstra Algorithm

According to the statistics released by the Ministry of Public Security,as of the end of 2016,the number of motor vehicles in the country reached 290 million and the number of automobiles in 49 cities across the country exceeded one million,putting tremendous pressure on urban transport and increasing traffic congestion.Resulting in the reduction of people's travel efficiency,affecting people's lives,urban transport and economic development.Traffic optimal path planning to some extent can improve people's travel efficiency and improve traffic congestion in urban areas,there is a very important research significance.The optimal path problem is a very traditional mathematical problem.It is the basis of optimization problems such as resource allocation,route analysis and design.The algorithm is one of the important algorithms in traffic network analysis.From the very beginning,the problem of the optimal path was derived from life.For example,the original path of the optimal path was Bridge 7 in Goldbach.With the development of society,this theory plays an increasingly important role in people's life and production.Up till now,the research and application of the optimal path problem is no longer the content of a single subject,it crosses computer science,mathematics and algorithm.Therefore,its optimization algorithm is its important research direction.However,the actual road conditions,in addition to the optimal route,should also take into account the road traffic,traffic light density,real-time traffic information and other actual road conditions.Moreover,if we can combine the actual traffic information with the shortest distance from Dijkstra algorithm,it will be of great practical significance to generate a short distance and reasonable travel time.In this paper,the Kalman filter model and the Dijkstra algorithm are combined to compare and analyze the advantages and disadvantages of each optimal path planning.Finally,the Dijkstra algorithm is selected as the optimal path selection algorithm,and the Kalman filter model is used as the short-term traffic flow Predictive model.Theshort-time traffic flow predicted by Kalman filter model is used to change the weight of Dijkstra algorithm.The experimental results show that the new improved algorithm is more practical.At the same time,the idea of Dijkstra algorithm is combined with the idea of Kalman algorithm,and a reasonable path planning method based on Kalman filtering model and Dijkstra algorithm is proposed.In simulation and practical applications,it is found that the new reasonable path planning method is far superior to the Dijkst ra and Kalman algorithms.