摘要
兵棋推演是一种描述战争行动的作战模拟工具,兵力机动是作战行动的基础,而路径规划则是作战行动的核心内容。路径规划简化为图论中的最短路径求解。然而,战术路径不等价于最短路径。考虑到战场推演的复杂性、信息多样性和动态性等特点,战术路径采用战场态势与路径规划分离的决策方法导致作战行动失败。提出了一种能将战场态势与地图信息有效融合的战术路径规划算法,该算法在传统A^(*)算法的基础上,结合影响力地图对战场态势因子进行数值化,并采用数值化态势因子结合地形因子作为改进A^(*)算法目标函数,从而在相同算法复杂度条件下使A^(*)算法向战术最优路径收敛。通过仿真实验表明,相较于传统A^(*)算法,该算法能够支持更复杂多样的战术路径规划,战场态势信息指导路径规划能够有效降低机动时一方所受战损并提高我方进攻能力,塑造整体有利态势。
Computer wargame is a simulation tool that describes war operations.Force maneuver is the foundation of operations,and path planning is the core content.Path planning is simplified as the solution of the shortest path in graph theory.However,the tactical path is not equivalent to the shortest path.Considering the complexity of battlefield maneuvering,information diversity,dynamics and other characteristics,the use of a decision-making method that separates battlefield situation and path planning can lead to operational failure.This article provides a tactical path planning method that effectively integrates battlefield situation and map information.This method,based on traditional A^(*)algorithm,combines influence map to digitize battlefield situation factors,and uses digitized situation factors combined with terrain factors as the objective function of the improved A^(*)algorithm.Thus,under the same algorithm complexity conditions,the A^(*)algorithm converges to the tactically optimal path.Simulation experiments effectively verify that this method can support more complex and diverse tactical path planning compared to traditional A^(*)algorithm.Battlefield situation information can guide path planning to effectively reduce the damage suffered by one party during maneuvering and improve our offensive capabilities,shaping a generally advantageous situation.
作者
吕倩茹
杨翔瑞
蔡志平
LÜQian-ru;YANG Xiang-rui;CAI Zhi-ping(College of Computer Science and Technology,National University of Defense Technology,Changsha 410073,China)
出处
《计算机工程与科学》
CSCD
北大核心
2024年第6期1041-1049,共9页
Computer Engineering & Science
