A new branch-and-bound procedure for computing optimal search paths
Approved for public release; distribution is unlimited. === We consider the problem of a searcher trying to detect a target that moves among a finite set of cells, C= 1,...,N, in discrete time, according to a specified Markov process. In each time period the searcher chooses one cell to search. Supp...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2014
|
| Online Access: | http://hdl.handle.net/10945/39870 |