Optimal Attack against an Area Defense Protecting Many Targets

Abstract

Many separated targets, of only a few differing values, are subject to a simultaneous attack. The area defenses considered have (a) impact point prediction (IPP) and full coordination, or (b) no IPP and full coordination, or (c) no IPP and partial coordination. For a given attack, the defense wish s to allocate its interceptors to maximize the expected total survival value of the targets. For a given attack size, and with knowledge of the defense's capabilities, the offense seeks a strategy to minimize expected total survival value against best defense. We present algorithms to determine optimal attack and defense strategies and the optimal value of the min-max problem, and we show how to take computational advantage of the relatively few unique target values. Illustrative computational results are provided. (edc)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1989
Accession Number
ADA228121

Entities

People

  • Norman T. O'meara
  • Richard M. Soland

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Area Defense
  • Computer Programming
  • Corporations
  • Dynamic Programming
  • Engineering
  • Impact Point
  • Integer Programming
  • Mathematics
  • Military Research
  • Notation
  • Operations Research
  • Optimization
  • Probability
  • Reliability
  • Survival
  • Terminal Defense

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Auditory Neuroscience/Auditory Physiology.
  • Missile Defense Systems.