An approximate solution technique for the constrained search path moving target search problem
Loading...
Authors
Eagle, James N.
Yee, James R.
Subjects
search, moving target, constrained search path, nonlinear programming,
convex simplex method
Advisors
Date of Issue
1985-10
Date
1985-10
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
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
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
NPS-55-85-015
Sponsors
Naval Postgraduate School, Monterey, CA.
Funder
Naval Postgraduate School, Monterey, CA.
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.