A game theory analysis of proposed strategies of an aerial search for a mobile surface target.
gametheoryanalys00smit.pdf (1.835Mb)Abstract
This thesis investigates the problem of aerial search for a mobile
surface target. The initial position of the target is known, and a
certain amount of time elapses before the search begins. The target
has a variety of choices as to speed and direction, and the search aircraft
has a choice of search patterns to be flown. The method proposed
to solve the problem of maximizing or minimizing the probability of
detection is the game theoretic analysis of various strategies available
to the searcher and the evader. Four strategies for each are
compared and evaluated, with optimal strategies, within the set of
strategies investigated, being derived.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Optimized graph topologies for probabilistic search
(IEEE, 2011-12);This paper investigates the effect on the performance of a mobile sensor search caused by the search environment. We model the search environment as a simple connected undirected graph. By adding non-existing edges to ... -
An optimal branch-and-bound procedure for the constrained path, moving target search problem
(Monterey, California. Naval Postgraduate School, 1987-12); NPS55-87-015A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells ... -
A model for evaluating the effectiveness of a systematic search for a moving target
(1987-03);The primary objective of this project is to estimate the effectiveness of a systematic search conducted against a randomly moving target and to generate target density curves in the search area after the search. In this ...
