<div class="description">
<dl><dd>"NPS-55-82-020"--Cover</dd>
<dd>"August 1982"--Cover</dd>
<dd>Title from cover</dd>
<dd>"Prepared for: Naval Postgraduate School, Monterey, California 93940."</dd>
<dd>Includes bibliographical references (p. 14)</dd>
<dd>Technical report; 1982</dd>
<dd>A search is conducted for a target moving in discrete time between a finite number of cells according to a known Markov process. The set of cells available for search in a given time period is a function of the cell searched in the previous time period. The problem is formulated and solved as a partially observable Markov decision process (POMDP). A finite time horizon POMDP solution technique is presented which is simpler than the standard linear programming methods. (Author)</dd>
<dd>ck/ 4/9/09</dd></dl><br>Subjects: LORAN.HYPERBOLIC NAVIGATION--COMPUTER PROGRAMS.GEOGRAPHICAL POSITIONS.PROGRAMMABLE CALCULATORS PROBLEMS, EXERCISES, ETC.</div>
<div class="fn value">
Eagle, James N.</div>
Internet Archive identifier