Minimizing the number of penetrations in a boundary defense problem (U)
Howard, Gilbert T.
MetadataShow full item record
We consider 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. Examples are included.
Approved for public release; distribution is unlimited.
NPS Report NumberNPS 55HK72041A
Showing items related by title, author, creator and subject.
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
Salmerón, Javier (Wiley, 2011-09-19);This article develops defender-attacker network interdiction models with deception. Here, deception refers to a preemptive and intelligent use of concealed interdiction assets and decoys by the defender, in addition to ...
Garcia Olalla, Oscar R. (Monterey, California. Naval Postgraduate School, 2012-06);This research develops an attacker-defender model of maritime trading. The defender's problem is represented as a minimum cost, multi-commodity network flow model. System cost is measured in terms of total ton-n.m. in the ...