计算机兵棋系统空中航线搜索研究  

Research on Air Route Search of Computer Wargame System

作　　者：齐浩良 司光亚[2] 王艳正[2] 陈佳宁 QI Hao-liang;SI Guang-ya;WANG Yan-zheng;CHEN Jia-ning(Graduate School of National Defense University,Beijing 100091,China;Joint Operations College of National Defense University,Beijing 100091,China;Faculty of Electronic and Information Engineering,Xi'an Jiaotong University,Xi'an Shaanxi 710049,China)

机构地区：[1]国防大学研究生院,北京100091 [2]国防大学联合作战学院,北京100091 [3]西安交通大学电子与信息学部,陕西西安710049

出　　处：《计算机仿真》2024年第2期17-22,共6页Computer Simulation

摘　　要：空中航线搜索作为空中作战行动模拟的首要环节,搜索效率和精度直接影响实现效果。针对计算机兵棋系统使用Dijkstra算法进行空中航线搜索造成的运行效率低下和转弯点过多问题,引进D*Lite算法,通过改造航线启发距离提高搜索精度和效率,通过改造代价估计函数减少非用户设定航线转弯点数量,并通过仿真对比验证本文算法的有效性。实验结果表明,使用上述算法可在各类地图规模中稳定搜索到符合空中机动障碍约束且平滑度更高的最短航线,在全局静态环境下运算时间平均减少97.01%,在局部动态环境下运算时间平均减少99.15%。As the primary link of air combat action simulation,the efficiency and accuracy of air route search directly affect the simulation effect.Aiming at the problems of low efficiency and too many turning points caused by the Dijkstra algorithm used in the air route search of the computer wargame system,this paper introduces the D*Lite algorithm,improves the search accuracy and efficiency by modifying the route heuristic distance,reduces the number of turning points of non-user set airline by transforming the cost estimation function,and verifies the effectiveness of the algorithm through simulation experiments.The simulation results show that the proposed algorithm can stably search the shortest route with higher smoothness and compliance with the constraints of air mobility obstacles in various map scales,The average calculation time is reduced by 97.01%in the global static environment and 99.15%in the local dynamic environment.

关 键 词：空中航线搜索 全局静态环境 局部动态环境 

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