| Summary: | 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.
|
|---|
