An approximate solution technique for the constrained search path moving target search problem
By: by James N. Eagle, James R. Yee
Contributors: Yee, James R.; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1985
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 16
Subjects: MOVING TARGETS; NONLINEAR PROGRAMMING; SEARCHING; SIMPLEX  METHOD
Other titles: NPS-55-85-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 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.
Notes: Title from cover.

"NPS-55-85-015."

"October 1985."

AD A161 045.

Includes bibliographical references (p. 16)

aq/aq cc:9116 02/27/98