Research On Path Planning Algorithm Based On Stroke And Comfort

With the development of economy and science and technology,more and more people like to drive.However,urban roads are numerous and complicated,and congestion and traffic accidents occur frequently,CNS has solved the problem of people searching for roads and blocking traffic as a smart device for real-time monitoring and navigation,and has become an important tool for managing urban traffic.Path planning,as the core part of this system,can help drivers find an optimal path from the starting point to the destination,the optimal route includes the optimal distance,the least turning or the lowest cost,etc.Due to many considerations in path selection,the single optimal standard currently provided cannot satisfy the needs of drivers,according to the study of people’s habit of choosing a route,when the driving distance is increased by an acceptable length,it is more likely to choose a simple and comfortable route,the comfort path studied in this paper refers to a mediumlength and simple-to-drive path.In view of the above problems,this paper mainly focuses on the traffic network model and path planning algorithm.First,it analyzes the road network model based on node-arc,the model does not meet people’s perception of the integrity of the natural road,and has the disadvantage of fragmentation of road information,therefore,this paper proposes to express the realistic road network with a road chain structure(stroke)with good continuity,the work is as follows:(1)Analyzing the topological relationship of stroke network model,and using object-oriented thinking to establish data structure;(2)Puting forward the method for finding the deflection angle and the overall average value for each pair to improve the linearity of the stroke structure.(3)Extracting the undirected stroke network and the directed stroke network based on the one-way and two-way attributes of the road;(4)verifying by experimental simulations that the stroke can express the road more intuitively than the nodearc structure,and can effectively reduce road network elements and data storage space.Second,it discusses the path planning algorithms and analyzes the stroke-based comfort path planning,the work already done includes:(1)implementing the A* algorithm in an undirected stroke network and compared with the traditional A* algorithm;(2)using the reverse search and relaxation calculations to optimize the minimum turn algorithm,thereby improving the running time of the algorithm;(3)analyzing the special relationship in the directed stroke model and using the layer search and A* algorithm to design the layer A*search algorithm,by the simulation data verifying that the algorithm is a comfortable path planning algorithm.Last,the experimental simulation in this paper is implemented by applying Arc GIS Desktop software and Java programming language.Among them,Arc GIS Desktop software can preprocess the road network,extract topological data and display paths,Java programming language can connect the database,build stroke network,implement A* algorithm and Fewest-turns algorithm and Layer A* algorithm.