Optimal search for the wake of a moving target when searcher motion is constrained
Guthe, Douglas Burden, Jr.
Eagle, James N.
Bradley, Gordon H.
MetadataShow full item record
A method for determining the optimal or near-optimal search path for the wake of a moving target when the searcher's motion is constrained is presented. The problem uses a Markov action model in discrete time and space for the target and assumes that the searcher is constrained to move only from the currently occupied cell to a specified set of "neighbor cells", I(j). First, a discussion of the complexity of the problem is presented. Next, an extension of T.J. Stewart's constrained searcher algorithm is given. Stewart's algorithm uses S.S. Brown's unconstrained searcher algorithm to calculate bounds on the probability of non-detection. An extension of Brown's algorithm to allow the use of a wake detector is also given. Several alternatives to both algorithms are offered and compared. Finally, some further extensions to the algorithms are suggested.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Sato, Hiroyuki (Monterey, California. Naval Postgraduate School, 2008-09);We develop models and solution methodologies to solve the discrete-time path-optimization problem where a single or multiple searchers look for a moving target in a finite set of cells. The single searcher is constrained ...
Caldwell, James F., Jr. (1987-09);A moving target is detected at long range with an initial position given by a probability distribution on a grid of N cells. Also located on the grid is a searcher, constrained by speed, who must find an optimal search ...
Sato, H.; Royset, J.O. (2010);We formulate and solve a discrete-time path-optimization problem where a single searcher, operating in a discretized 3-dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained ...