search query: @indexterm target search problem / total: 14
reference: 13 / 14
| Author: | Eagle, J. N. Yee, J. R. |
| Title: | An optimal branch-and-bound procedure for the constrained path, moving target search problem |
| Journal: | Operations Research
1990 : JAN-FEB, VOL. 38:1, p. 110-114 |
| Index terms: | TARGET SEARCH PROBLEM |
| Language: | eng |
| Abstract: | A searcher and target move along a finite set of cells in discrete time. At the beginning of each time period, one cell is searched. If the target is in the selected cell, it is detected with a certain probability. If the target is not in the cell searched, it cannot be detected during the current time period. After each search, a target in the selected cell moves to a new cell with a certain probability. The target transition matrix is known to the searcher. The searcher's path is constrained in that if the searcher is currently in the selected cell, the next search cell must be selected from a set of neighbouring cells. The object of the search is to minimize the probability of not detecting the target in a given number of searches. |
SCIMA