Research On The Role And Group Path Finding Method Based On A* Algorithm

In today’s society,with the progress and development of science,the transportation network is more and more developed,people travel,travel or other travel,not only will be concerned about the cost,but also the mileage and the time required and other issues are particularly interested,for example,the current city to the destination city the shortest distance,and how to travel according to the shortest distance.In order to make travel more convenient,it is urgent to establish a traffic consultation system that can achieve the shortest route planning,such as Google Maps,Baidu Maps,etc.have similar functions.Such systems can easily solve the traffic problems people face.Such problems are the shortest path problems,which can be solved in transportation systems,electronic navigation systems and artificial intelligence and other fields have important applications,so it has important practical application value.The a-algorithm is the theoretical basis of the shortest path problem at present,so it is a very classic short-path algorithm.Common road finding and path planning problems can be solved by the A-algorithm.This paper presents the smoothing strategy of the jagged path sought by using the A-algorithm,and establishes the group model of the A-algorithm,tests the actual performance effect of the a-algorithm by comparing the environment map of the a-turn algorithm,and analyzes their application and the application range in the path search.The main work of this article is as follows:First of all,this paper makes a simple summary and explanation of the application and development prospects of the path algorithm at home and abroad,and introduces the definition of the shortest path and the existing shortest path algorithm.Secondly,through the analysis and comparison of the four important path-finding algorithms which are currently more mainstream,this paper fully shows the concrete implementation process and advantages and disadvantages of each path-finding algorithm.Thirdly,this paper also focuses on the principle of the A-algorithm and the improvement of optimization,based on the experiment,to verify that the A-algorithm is superior to other algorithms.Through the improvement and optimization of the A-algorithm,the check of the distance of each node on the shortest path is increased,thus ensuring the realization of the shortest path and avoiding the non-optimal path in some cases.Finally,the program was created through the visual development of Java’s JFrame,resulting in a more intuitive optimization of the A-algorithm.