Research On The Application Of A* Algorithm In Game Artificial Intelligence

In recent years,with the development of electronic game hardware is getting better and better,the game graphics image processing accounted for a lot lower,the traditional scenes,images and other effects have been greatly developed at the same time,players began to focus on electronic game’s content,they want the role behavior of the game can be closer to the reality of the people,which makes game developers in the game of artificial intelligence has increased investment.In the game of artificial intelligence,the role of the intelligent pathfinder system has been the focus of the study.Intelligent routing algorithm plays a leading role in the intelligent routing system.At present,the most classical algorithm of intelligent search algorithm used in electronic games is A* algorithm,and many other excellent algorithms are developed from the algorithm.Standard A* algorithm is to use the valuation function F(n)=G(n)+H(n)to guide the search,so as to quickly find a shortest path in the map.However,the standard A * algorithm also has many shortcomings.In this paper,several optimization methods are proposed to improve the standard A * algorithm.First,Adding heuristic coefficients to the heuristic function of A * algorithm to optimize the search of "redundant" path in path searching,a binary heap is used to maintain the open list in the A * algorithm;And then optimize the path weights in the map,the generated path is smoothed by the median interpolation method,the A * algorithm is further optimized by using the sub-region search method,which makes its application wider.Finally,a simulation experiment program produced by a Unity3 D engine was used to verify the improved A * algorithm with the above-mentioned several methods to improve the efficiency of routing,wider use range and practical application in the game.