Air Defense Firepower Assignment Model And Algorithm Under The Principle Of Earlier Damage

The main characteristics of modern air defense war are summarized. The military and technology demands, and the development of missile-gun integrated air defense weapon system are analyzed. A brief overview of research on weapon-target assignment (WTA) problem is given.It is the basic problem for firepower assignment to analyze the fire capability of the air defense weapon system. The fire-forbidden areas of the archibald are classified comprehensively according to the forming reasons. To keep the archibald canals from turning into the fire-forbidden areas, the soft brake is presented. And, the corresponding means are proposed to improve some fire-forbidden areas. The shooting time complementarity of archibald and antiaircraft missile is demonstrated quantificationally with the flight time curves.Earlier damage is an important guide ruler for the firepower assignment, but it's not considered quantificationally in the present research. The "shooting ahead coefficient" is put forward for the first time, and a new firepower assignment method considering shooting time is proposed. The firepower assignment problem is divided into weapon allocation and shooting time scheduling. The principle of the weapon allocation is that the target with greater threat value has higher priority. And the principle of the shooting time scheduling is the target could be damaged with expected probability before specific time. The firepower assignment scheme and computing program for missile-gun integrated air defense weapon system under the principle of earlier damage are presented.A weapon target assignment model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted. And the weapon units with the greater relative weights for a target are apt to be selected to this target. A graph-based ant algorithm is proposed to solve this WTA problem (subset problem). A pheromone updating policy based on strengthening the pheromone on equivalent routes is presented. The stability and convergence of the algorithm are improved. Based on the principle of earlier damage, a shooting time assignment model is proposed. In the presupposition of that the target can be damaged with expected probability before specific time, the weapon units' shooting times are scheduled to damage the target earlier. According to monotonicity of restriction function, an improved continuous ant colony algorithm is presented. The solution is searched from "good area" of each variable, in which the restriction can be satisfied easily, so the optimal solution can be found more rapidly.