<div class="description">
<dl><dd>Title from cover</dd>
<dd>"NPS-55-87-015."</dd>
<dd>"December 1987."</dd>
<dd>Includes bibliographical references (p. 5)</dd>
<dd>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 available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells that maximizes the probability of detecting the target in a fixed number of time periods. Closely following earlier work by Theodor Stewart, a branch-and-bound procedure is developed which finds optimal search paths. This procedure is tested and appears to be more efficient than existing dynamic programming solution methods. Keywords: Moving targets; Target detection; Searching</dd>
<dd>aq/aq cc:9116 02/26/98</dd></dl><br>Subjects: MARKOV PROCESSES.MOVING TARGETS.SEARCHING.TARGET DETECTION.</div>
<div class="fn value">
Eagle, James N.</div>
Internet Archive identifier