Real-Time Heuristics and Metaheuristics for Static and Dynamic Weapon Target Assignments
Abstract
The problem of targeting and engaging individual missiles (targets) with an arsenal of interceptors (weapons) is known as the weapon target assignment (WTA) problem. This problem has been well-researched since the seminal work in 1958. There are two distinct categories of the WTA: static (SWTA) and dynamic (DWTA). The SWTA considers a single instance in which a known number of incoming missiles is to be engaged with a finite number of interceptors. By contrast, the DWTA considers either follow on engagement(s) should the first engagement(s) fail, a subsequent salvo of incoming missiles, or both. This research seeks to define and solve a realistic dynamic model. First, we develop assignment heuristics and metaheuristics which provide rapid near-optimal solutions to the SWTA. Next, we develop a technique capable of solving the heterogeneous DWTA. Lastly, we develop a model which realistically considers erratic flight paths of incoming missiles and solves the model within a simulation. Collectively, this work extends the research of missile defense into practical application more so than currently can be found within the literature.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 2018
- Accession Number
- AD1067720
Entities
People
- Alexander G Kline
Organizations
- Air Force Institute of Technology