Minimizing the Number of Penetrations in a Boundary Defense Problem

Abstract

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1972
Accession Number
AD0743047

Entities

People

  • Gilbert T. Howard

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Air Platforms
  • Ground and Sea Platforms
  • Materials and Manufacturing Processes
  • Weapons Technologies

DTIC Thesaurus Topics

  • Boats
  • Boundaries
  • California
  • Classification
  • Computer Programming
  • Control Systems
  • Dynamic Programming
  • Fire Control Systems
  • Game Theory
  • Interception
  • Military Research
  • Operations Research
  • Radar Stations
  • Sequences
  • Sliding Contacts
  • South Vietnam
  • Weapon Systems

Fields of Study

  • Mathematics

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Mathematical Modeling and Probability Theory.
  • Military History / Militaries and War Studies