The optimal search for a moving target when the search path is constrained
By: James N. Eagle
Contributors: Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1982
Place of publication: Monterey, California
Language: eng
Number of pages: 15
Subjects: Mathematical optimization; Search theory; Operations research; Markov processes
Description: A search is conducted for a target moving in discrete time between a finite number of cells according to a known Markov process. The set of cells available for search in a given time period is a function of the cell searched in the previous time period. The problem is formulated and solved as a partially observable Markov decision process (POMDP). A finite time horizon POMDP solution technique is presented which is simpler than the standard linear programming methods. (Author)
Notes: "NPS-55-82-020"--Cover

"August 1982"--Cover.

Title from cover.

"Prepared for: Naval Postgraduate School, Monterey, California 93940."

Includes bibliographical references (p. 14).

"Approved for public release; distribution is unlimited"--Cover.

Technical report; 1982.

ck/ 4/9/09.