This paper addresses assignment of defensive weapons against a number of incoming targets, particularly when the targets are aiming to a relatively small local area in a high-density manner. The major issue this work tries to deal with is potential interference between the defensive weapons due to short distance between them and/or inclusion within seeker sensing range. The problem is formulated in a time-dependent static weapon–target assignment with operational and interference constraints; a greedy algorithm that features approximate prediction of potential interference. A numerical case study on assignment of defensive interceptor against incoming ballistic objects is presented to demonstrate the efficacy of the proposed method.
Greedy Target Assignment with Interference Constraints Between Defensive Weapons
Journal of Aerospace Information Systems ; 19 , 4 ; 271-282
2022-01-21
12 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
AIAA | 1991
|WEAPON TARGET ASSIGNMENT PROBLEM WITH INTERFERENCE CONSTRAINTS
TIBKAT | 2020
|Defensive weapons for armoured vehicles
Kraftfahrwesen | 1987
|