Publication:
The optimal search for a moving target when the search path is constrained

Loading...
Thumbnail Image
Authors
Eagle, James N.
Subjects
search
moving target
partially observable Markov decision process (POMDP)
Advisors
Date of Issue
1982-08
Date
1982-08
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
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)
Type
Technical Report
Description
Series/Report No
Department
Identifiers
NPS Report Number
NPS55-82-020
Sponsors
Naval Postgraduate School, Monterey, CA.
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections