An Approximate Algorithm For A Weapon Target Assignment Stochastic Program
The Weapon Target Assignment (WTA) problem considers optimally assigning M weapons to N targets so that the total expected damage to the targets is maximized. If at some time t the numbers and locations of weapons and targets are known with certainty, then a single assignment may be made at time t such that all of the weapons are committed. This formulation is denoted static WTA. In its most general form, static WTA is known to be NP-complete. A more difficult problem results when the numbers and locations of targets are not known a priori. Typically, constraints on the weapons maneuverability and range will require a sequence of partial assignments at times t 1, t 2,..., t k , where at each t i , a subset of the n targets are known with certainty and the remainder are either not known or known only stochastically. This dynamic WTA formulation may be modeled as a stochastic program (SP). In general, stochastic programs may be solved by decomposing the SP into a sequence of deterministic problems. However, for dynamic WTA, the integrality and non-linearity of the problem makes it difficult to obtain a solution by decomposition. This paper studies an algorithm that finds an optimal solution for a similar problem which is close to optimal for the original problem but is amenable to on-line execution.
KeywordsWeapon target assignment Stochastic programming.
Unable to display preview. Download preview PDF.
- M. Athans, P. Hosein and J. Walton (1988), Dynamic weapon target assignment problems with vulnerable C3 nodes, Proceedings of the Command and Control Symposium, Monterey, CA.Google Scholar
- J.R. Birge (1999), “Parallel decomposition of large-scale stochastic nonlinear programs”, working paper.Google Scholar
- C.C. Carve, and J. Tind (1998), “L-shaped decomposition of two-stage stochastic programs with integer recourse”, Mathematical Programming, vol. 83, pages 451–464.Google Scholar
- M. Flood (1957), Verbal communication at The Princeton University Conference on Linear Programming.Google Scholar
- J.B. Hofman, W.A. Metler and F.L. Preston (1990), “A suite of weapon assignment algorithms for an SDI midcourse battle manager,” Naval Research Laboratory Report 6713.Google Scholar
- S.P. Lloyd and H.S. Witsenhausen (1986), “Weapons allocation is NP-complete”, IEEE Summer Simulation Conference.Google Scholar