A Path Planning Algorithm Based On Mutual Assistance Trip In Traffic Congested Network

The improvement of economic level makes residents have a higher pursuit of traffic travel quality.However,the sluggish infrastructure construction speed can not meet the rapid growth of traffic travel demand.Inefficient traffic control will also lead to time and fuel waste,road traffic accidents and other economic problems.The travel problem of residents in congested environment has become a bottleneck restricting the development of a city.With the development of Internet and communication technology,intelligent transportation system is becoming more and more mature.Travelers can establish self-organizing travel network to complete the mutual assistance of real-time road condition information in the travel process,and realize the real-time optimal selection of travel path with the help of Mutual Information.Based on the above background,this dissertation introduces the concept of Mutual Assistance Trip to design a new traffic information system,focuses on the information transmission mechanism in the system,and develops Mutual Assistance Trip system platform based on driving simulator.A new congestion charge method is proposed.The main idea is to reflect the congestion charge on the section impedance.A method for judging the congestion degree of road section in urban environment is proposed.By dividing the congested road section into several sub section units at equal distance,the traffic congestion bottleneck point and congestion penalty function value of the road section are calculated.The concept of Mutual Information life cycle is defined,and Mutual Information obedience coefficient μ and intensity coefficient θ are integrated in the impedance function.A traffic congestion punitive impedance function model considering the timeliness of information is designed based on BPR function.From the perspective of system optimization,this dissertation designs a Multi-Vehicle Algorithm Based on Mutual Assistance Trip(MVA-MAP)by introducing the idea of multi-optimization feasible solution and Boltzmann path decision mechanism.In the algorithm,Dijkstra algorithm is dynamically optimized to adapt to the characteristics of real-time update of Mutual Information,and the road network around Beijing National Stadium is analyzed as a numerical simulation area.The results show that compared with the greedy algorithm,the proposed path planning algorithm has better optimization performance,and the overall travel efficiency is improved by16.99%.Sensitivity analysis of Mutual Assistance Trip characteristic parameters shows that when the value of θ is fixed,with the increase of μ,the algorithm has better induction performance.This dissertation further studies the mixed Mutual Assistance traffic flow and selects three typical vehicles for analysis,namely Conventional Mutual Assistance Vehicles,Logistics Mutual Assistance Vehicles and Rescue Mutual Assistance Vehicles.The research shows that the algorithm in this dissertation is also applicable to mixed Mutual Assistance traffic flow,and it is found that Mutual Assistance Trip plays a positive role in promoting cooperative travel between different types of vehicles.In this dissertation,Mutual Assistance Trip safety evaluation experiment is designed based on the driving simulator.Firstly,the safety of Mutual Assistance Trip level evaluation system is constructed,10 indexes such as azimuth standard deviation and TTC are determined as the evaluation index layer.Secondly,based on the idea of analytic hierarchy process,the index weight is calculated and the safety of Mutual Assistance Trip evaluation model is established.The driving simulation experimental data are used to evaluate the safety of Mutual Assistance Trip,Mutual Information delivery time and Mutual Information delivery load.Finally,according to this experiment,the safety degree of Mutual Assistance Trip is grade IV,which verifies the safety of Mutual Assistance Trip.Further analysis shows that Mutual Information should be delivered in the upstream of the road section as far as possible,and the amount of Mutual Information should not be too much.1-2 items are relatively safe.