分布式协同拍卖算法的动态联合火力分配方法

Dynamic Joint Fire Distribution Method Based on Decentralized Cooperative Auction Algorithm

动态联合火力分配问题是一类实时性很强的优化问题。以多机编队协同攻击地面机动目标为背景,建立了联合考虑武器、传感器和目标的火力分配问题的数学模型。根据分布式协同拍卖算法的基本原理,考虑不同目标的火力分配截止时间不同,设计了基于分布协同拍卖的动态目标分配算法。所提出的算法主要有以下两个优点:根据不同目标的火力分配截止时间不同,在算法运行的不同阶段给出相应目标的分配方案能有效地提高算法解的质量;根据分配原则,能将具有不同火力分配截止期的目标分配给同一组攻击机——传感器组,能更充分地发挥编队中作战能力较强的攻击机与传感器的优势,从而发挥编队的最大攻击能力。最后,通过仿真,对算法在以上两方面的优点进行了验证。

Joint fire distribution is a real-time optimization problem which is researching into assignment among weapons, sensors and targets. A mathematical model is established on joint fire distribution problem against a background of air formation attacking to surface mobile targets. Based on decentralized cooperative auction algorithm, an algorithm on dynamic joint fire distribution is proposed. The algorithm dynamically sets temporal restrictions based on different fire distribution deadlines of different targets when a suboptimal partial assignment schemes must be reached. The algorithm has two main merits. One is that the algorithm can remarkably improve the quality of assignment schemes. The other is that a weapon-sensor pair can be assigned to more than one target in different temporal restrictions without missing any deadline, which can take full advantage of the formation＇s full-scale attack ability. The two merits of the algorithm are verified in simulation in the end.