An optimal branch-and-bound procedure for the constrained path, moving target search problem
By: James N. Eagle, James R. Yee
Contributors: Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1987
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Subjects: TARGET  DETECTION; SEARCHING; MOVING TARGETS; MARKOV PROCESSES
Other titles: NPS-55-87-015.
Description: 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.
Notes: Title from cover.

"NPS-55-87-015."

"December 1987."

Includes bibliographical references (p. 5).

aq/aq cc:9116 02/26/98