改进烟花算法在虚拟士兵路径规划中的应用  

Application of Improved Fireworks Algorithm in Path Planning of Virtual Soldier

作　　者：樊永生[1] 连云霞 杨臻[2] FAN Yongsheng;LIAN Yunxia;YANG Zhen(School of Data Science and Technology,North University of China,Taiyuan 030051,China;College of Electromechanical Engineering,North University of China,Taiyuan 030051,China)

机构地区：[1]中北大学大数据学院,太原030051 [2]中北大学机电工程学院,太原030051

出　　处：《计算机工程》2018年第12期228-232,共5页Computer Engineering

摘　　要：针对虚拟士兵作战仿真路径规划中存在不连续路径的问题,提出一种改进的烟花算法。采用可视图法进行地图建模,把路径规划转变为寻求最佳路径点的组合。通过结合士兵视觉模型实现对环境威胁的判断,加入对路径节点的插入和删除操作以消除不连续路径,从而得到最优路径。仿真结果表明,与A*算法相比,该算法能减少路径长度和节省规划时间,具有较强的搜索能力。Virtual soldier combat simulation requires high path planning,but the fireworks algorithm in path planning has a discontinuous path problem.Therefore,an improved fireworks algorithm is proposed.The view method can be used to model the map and transform the path plan into a combination of finding the best path points.By combining the soldier visual model to achieve the judgment of the environmental threat,the insertion and deletion operations of the path node are added to eliminate the discontinuous path,thereby obtaining the path related data.Simulation results show that compared with A*algorithm,the algorithm can reduce the path length and save planning time,and has strong search capability.

关 键 词：虚拟士兵 路径规划 改进烟花算法 可视图法 视觉模型 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]