An optimal branch-and-bound procedure for the constrained 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 available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells that maximizes the probability of detecting the target in a fixed number of time periods. Closely following earlier work by Theodor Stewart, a branch-and-bound procedure is developed which finds optimal search paths. This procedure is tested and appears to be more efficient than existing dynamic programming solution methods. Keywords: Moving targets; Target detection; Searching
NPS Report NumberNPS55-87-015
Showing items related by title, author, creator and subject.
Martins, Gustavo H. A. (Monterey, California. Naval Postgraduate School, 1993-03);We consider the problem of a searcher trying to detect a target that moves among a finite set of cells, C= 1,...,N, in discrete time, according to a specified Markov process. In each time period the searcher chooses one ...
Elfers, Glen Edward. (Monterey, California. Naval Postgraduate School, 1973-09);The ability of an airborne direction finding (DF) system to accurately fix target emitters depends heavily on the aircraft/target geometry and the duration of target emissions. Based on this, a computer model was developed ...
Andrus, Alvin F. (Monterey, California. Naval Postgraduate School, 1985-05); NPS55-85-011The Stop and Look Detection Algorithm is a procedure for computing the cumulative probability of detection as a function of time for a searcher looking discretely for an evading target. The assumptions required for computation ...