编队对地动态联合火力分配建模与仿真研究  

Research of Modeling and Simulation on Formation Attack to Ground Dynamic Joint Fire Distribution

作　　者：黎子芬[1,2] 李相民[1,2] 代进进[1] 孔繁峨 

机构地区：[1]海军航空工程学院,烟台264001 [2]光电控制技术重点实验室,洛阳471009

出　　处：《系统仿真学报》2013年第12期2900-2905,共6页Journal of System Simulation

基　　金：光电控制技术重点实验室和航空科学基金联合资助(20105184001)

摘　　要：针对动态联合火力分配(Dynamic Joint Fire Distribution,DJFD)问题的特性,以多机编队协同攻击地面机动目标为背景,分析了编队对地攻击目标分配问题的约束空间,即资源约束、转火约束、时间约束和空间约束,建立了联合考虑武器、传感器和目标三者的动态武器目标分配(Dynamic Weapon-Target Assignment,DWTA)问题(称为DJFD问题)的数学模型。以分布式协同拍卖算法的思想为基础,设计了一种求解DJFD问题的anytime算法。仿真结果和统计分析数据证明,算法能求得具有很好优化效果的分配方案,是一种动态anytime算法,能在规定的时间、空间和资源的约束条件下,快速求得满足一定优化需求的分配方案。First, against a background of air formation attacking to surface mobile targets, the constraint space of the DJFD problem was analyzed which was composed of resource constraints, shifting firepower constraints, temporal constraints and spatial constraints. Second, a mathematic model for the DJFD problem was established, which considered over cooperation between weapons and sensors while assigning weapons to targets. Finally, an anytime algorithm based on decentralized cooperative auction for resolving the DJFDproblem was proposed. The simulation results and the statistical data demonstrate that the method can present distribution schemes with good optimal objective function. The algorithm is a kind of dynamic anytime algorithm, which can get schemes with expected optimal effect under certain constraints.

关 键 词：编队协同对地攻击 机动目标 动态武器-传感器-目标分配 分布式协同拍卖 约束空间 

分 类 号：TJ762.21[兵器科学与技术—武器系统与运用工程]