Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
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.
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Subjects
MOVING TARGETS, NONLINEAR PROGRAMMING, SEARCHING, SIMPLEX METHODShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
An approximate solution technique for the constrained search path moving target search problem
1985, Naval Postgraduate School, Available from National Technical Information Service
in English
|
aaaa
|
Book Details
Edition 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
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 24, 2014 | Created by ImportBot | import new book |