An approximate solution technique for the constrained search path moving target search problem
Eagle, James N.
Yee, James R.
MetadataShow full item record
A 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 from which he can choose is a function of the cell chosen in the previous time period. The problem is to find a searcher path, i.e., a sequence of search cells, that minimizes the probability of not detecting the target in a fixed number of time periods. The problem is formulated as a nonlinear program and solved for a local optimum by a simple implementation of the convex simplex method
NPS Report NumberNPS-55-85-015
Showing items related by title, author, creator and subject.
Eagle, James N.; Yee, James R. (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 ...
Smith, Charles James (Monterey, California. U.S. Naval Postgraduate School, 1966-10);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 ...
Colak, Umit (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 ...