基于差分进化和稀疏A^(*)算法的游戏地图智能寻径方法  

A Game Map Path-Finding Method based on Differential Evolution and Sparse A^(*)Algorithm

作　　者：齐燕[1] 常晋义[2] QI Yan;CHANG Jin-yi(Suzhou Top Institute of Information Technology Institute of Information Technology,Kunshan Jiangsu 215311,China;School of Computer Science and Engineering,Changshu Institute of Technology,Changshu Jiangsu 215500,China)

机构地区：[1]苏州托普信息职业技术学院信息技术学院,江苏昆山215311 [2]常熟理工学院计算机科学与工程学院,江苏常熟215500

出　　处：《淮阴师范学院学报（自然科学版）》2021年第2期132-138,共7页Journal of Huaiyin Teachers College;Natural Science Edition

基　　金：江苏省高校自然科学基金项目(15KJB520001)。

摘　　要：提出了一种基于差分进化和稀疏A^(*)算法的游戏地图智能寻径方法,通过精准过滤非正常状态从而达到较高的收敛速度进而实现快速路径搜寻.仿真结果表明,该方法相较于现有方法有着更快的搜寻速度和更优的路径选择,对游戏地图智能寻径是可行有效的.In this paper,A game map path finding method based on differential evolution and sparse A^(*) algorithm was propose,which achieves fast path finding by accurately filtering non-normal states to achieve high convergence speed.The experimental results show that the proposed method has faster search speed and better path selection than the existing methods,and that the AI intelligent path finding method based on differential evolution and sparse A^(*) algorithm was feasible and effective.

关 键 词：游戏地图 A^(*)算法 差分进化 智能寻径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]