Weapon-Target Assignment and Firing Scheduling for Rapid Engagement with Heterogeneous Interceptors

This paper addresses engagement control of naval fleet with heterogeneous defensive weapons against approaching anti-ship missiles. A combined decision making problem that include weapon-target assignment and firing schedule is considered to decide on which defensive weapons to fire on which targets...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of aeronautical and space sciences Jg. 24; H. 3; S. 890 - 904
Hauptverfasser: Park, Hyeon-Woo, Choi, Han-Lim
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Seoul The Korean Society for Aeronautical & Space Sciences (KSAS) 01.07.2023
Springer Nature B.V
한국항공우주학회
Schlagworte:
Aerospace Technology and Astronautics
Algorithms
Antiship missiles
Approximation
Engineering
Flight time
Fluid- and Aerodynamics
Greedy algorithms
Interceptors
Linear programming
Missiles
Mixed integer
Nonlinear programming
Original Paper
Scheduling
Self defense
Velocity
Warships
Weapons
항공우주공학
Greedy algorithm
Rapid engagement
Heterogeneous guided weapons
Firing scheduling
Weapon target assignment
ISSN:2093-274X, 2093-2480
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper addresses engagement control of naval fleet with heterogeneous defensive weapons against approaching anti-ship missiles. A combined decision making problem that include weapon-target assignment and firing schedule is considered to decide on which defensive weapons to fire on which targets in what order, taking into account the flight time of heterogeneous defensive weapons, limitations in the launch interval, and the geometric aspects of the incoming targets. A new mixed-integer nonlinear program formulation is presented; then, a mixed-inter linear program approximation on the basis of piecewise linear approximation and McCormick relaxation is proposed for computational tractability. For further efficiency, a greedy algorithm is also presented to deal with a realistic problem. Numerical examples on several representative engagement scenarios demonstrate the validity of the proposed methodology.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2093-274X
2093-2480
DOI:10.1007/s42405-023-00572-w