关键词: 协同空战, 火力分配, 毁伤概率门限, 模拟退火, 离散粒子群优化算法

Abstract: In beyondvisualrange (BVR) cooperative airtoair combat, weapon resources could be wasted if all weapon units are fully assigned at a time. To cope with the disadvantage, a new weapontarget assignment mathematical model based on the threshold of damage probability is proposed. The new model guarantees the threshold of damage probability by employing fewer weapon units to save and make full use of weapon resources. The proper fire units are assigned to the targets according to the priority of the menance. Meanwhile, the maximum of the target damage probability average value can also be achieved. Based on the new model, a mixed simulated annealing (SA) and discrete particle swarm optimization (DPSO) algorithm is proposed to solve the weapontarget assignment problem. The proposed algorithm improves the seeking ability for the global optimal result so that the local minimum is avoided and the convergence rate is improved. Simulation results show the advantage of the proposed new model and the effectiveness of SA-DPSO algorithm.

Key words: cooperative air combat, weapontarget assignment, threshold of damage probability, simulated annealing, discrete particle swarm optimization algorithm