An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
-
- James N. Eagle
- Naval Postgraduate School, Monterey, California
-
- James R. Yee
- University of Southern California, Los Angeles, California
説明
<jats:p> A searcher and target move among a finite set of cells C = 1, 2, …,N in discrete time. At the beginning of each time period, one cell is searched. If the target is in the selected cell j, it is detected with probability q<jats:sub>j</jats:sub>. If the target is not in the cell searched, it cannot be detected during the current time period. After each search, a target in cell j moves to cell k with probability p<jats:sub>jk</jats:sub>. The target transition matrix, P = [p<jats:sub>jk</jats:sub>] is known to the searcher. The searcher's path is constrained in that if the searcher is currently in cell j, the next search cell must be selected from a set of neighboring cells C<jats:sub>j</jats:sub>. The object of the search is to minimize the probability of not detecting the target in T searches. </jats:p>
収録刊行物
-
- Operations Research
-
Operations Research 38 (1), 110-114, 1990-02
Institute for Operations Research and the Management Sciences (INFORMS)