Accession Number : ADA119346

Title :   The Optimal Search for a Moving Target When the Search Path Is Constrained.

Descriptive Note : Technical rept.,

Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CA

Personal Author(s) : Eagle,James N

PDF Url : ADA119346

Report Date : Aug 1982

Pagination or Media Count : 20

Abstract : 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)

Descriptors :   *Searching, *Moving targets, *Markov processes, *Decision theory, Cells, Time intervals, Tracking, Paths, Target detection, Probability, Problem solving, Space perception

Subject Categories : Statistics and Probability
      Optical Detection and Detectors

Distribution Statement : APPROVED FOR PUBLIC RELEASE