改进的A^*算法在游戏寻路功能中的应用与研究  

Application and Research of Improved A^* Algorithm in Game Path finding Function

作　　者：宛博文 陈洁[1] 朱瑞晨 朱大伟[1] 潘子宇 Wan Bowen;Chen Jie;Zhu Ruichen;Zhu Dawei;Pan Ziyu(School of Information and Communication Engineering,Nanjing Institute of Technology,Nanjing 210046,China)

机构地区：[1]南京工程学院信息与通信工程学院,南京211167

出　　处：《信息化研究》2019年第6期51-55,共5页INFORMATIZATION RESEARCH

基　　金：国家自然科学基金(No.61901211);南京工程学院大学生科技创新基金项目(TB201906058)。

摘　　要：在游戏开发中,A^*算法是主要解决地图搜索寻径的方法。为实现算法在不同游戏地图场景中的适用以及更好地节省系统资源的占用,文章提出了精简地图路径点的方法,在路径搜索时对地图路径点个数进行精确缩减,从而减少算法代价函数值的计算次数,进而节省资源消耗。在Unity引擎环境下进行算法模拟,模拟结果表明,该算法可以较好地节省系统资源和提高运行效率,在更大规模地图中,效果尤为明显。In game development,A^*algorithm is the main method to carry out map search and path finding.In order to realize the application of the algorithm in different game map scenes and better save the occupation of system resources,this paper puts forward a method to simplify the map path points,and precisely reduce the number of map path points in the path search,so as to reduce the calculation times of the algorithm cost function value and save the resource consumption.The algorithm is simulated in the Unity engine environment,and the simulation results show that the algorithm can better save system resources and improve operating efficiency,especially in larger maps.

关 键 词：A^*算法 人工智能 地图寻径 游戏开发 Unity引擎 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]