Dynamic Weapon-Target Assignment Problems with Vulnerable C2 Nodes
Abstract
This paper presents a progress report on our work on the dynamic version of the Weapon to Target Assignment (WTA) problem and on the static version of the WTA problem in which vulnerable C3 nodes are included in the formulation. In the static WTA problem, weapons must be assigned to targets with the objective of minimizing the total expected number (or value) of the surviving targets. In the dynamic version this allocation is done in time stages so that the outcomes of previous engagements can be used in making future assignments. We show that, for the simple cases studied, there is a significant cost advantage in using the dynamic strategy. We believe that similar results will hold for the more general problem. In the static defense-asset problem with vulnerable C3 nodes the offense is allowed to either attack the assets themselves or to first attack the command and control system, and then the assets; if the c3 nodes are destroyed then the defensive interceptors are assumed unusable. We first consider simple cases where assumptions are made as to offensive and defensive states of knowledge and kill probabilities. Strategies are then developed and optimal weapon allocations identified. These assumptions are then relaxed, and further examples demonstrate the ensuing complexity.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1988
- Accession Number
- ADA196449
Entities
People
- James T. Walton
- Michael Athans
- Patrick A. Hosein
Organizations
- Massachusetts Institute of Technology