面向游戏地图的寻径算法的研究与实现-软件工程专业论文.docxVIP

AbslractAbstract Abslract Abstract The high speed development of the grime industry has promoted the new changes of the game artificial intelligence technology．The search path algorithm for the game map has been of the hot spots and the basic problems ofthe game artificial intelligence，and the A4 algorithm is the most widely used algorithm in game map path searching，which is the most effective heuristic search algorithm to solve the problem of path searching．Under different data structures，A+algorithm has obviously different search efficiency,and the design ofheuristic function has different effects the running speed．At present，the research A+ algorithm is mostly theoretical stage，while the application ofA+algorithm used in the actual game project is far less，which is worthy study the game map search algorithm． The paper First proposes data structure of the search node with the flag bit based the property of A+algorithm，using the smallest binary heap to implement the OPEN table，then by comparing the simulate program and the data graph to finish this study．By A+algorithm to evaluate the function property,and then propose the weighted function which improve the searching efficiency of the search algorithm． Secondl y，combined with the practical application of the search algorithm，the navigation mesh is used to simplify the complex and large game map，and to reduce the search space of the A+algorithm．Put forward time—sharing path search，using path splicing to process the dynamic obstacles，and introduce the evaluation function into the calculation of cost of the terrain，to improve the authenticity of game map path search． Finally,this paper the Cocos2d-X game engine to design and develop demo program of game map path search． The experimental results shows that the A+algorithm 3-22 times faster than the search data structure with the flag bit structure than that without the flag bit．The using of the minimum binary heap achieves OPEN table reduce the searching time of40％～6