Minimizing the Number of Penetrations in a Boundary Defense Problem
NAVAL POSTGRADUATE SCHOOL MONTEREY CA
Pagination or Media Count:
The author considers the problem of a defender guarding a boundary from attack by a fixed number of invaders who are approaching the boundary. His objective is to intercept the maximum number of invaders before they cross the boundary. The defender is not required to remain on the boundary but he must investigate the contacts in first-come first-served order. Weights may also be assigned to each invader to reflect the value to the defender of intercepting that invader. A dynamic programming formulation is given. The multiple defender problem is also considered, and several other generalizations are discussed.
- Operations Research
- Military Operations, Strategy and Tactics