MARC record from Internet Archive

LEADER: 01908nam 2200349 a 4500
001 ocn640493081
005 20100714094458.5
008 980227s1985 caua b f000|0 eng d
035 $a
035 $a
040 $aCMontNP$cCMontNP
086 0 $aD 208.14/2:NPS-55-85-015
100 1 $aEagle, James N.
245 13 $aAn approximate solution technique for the constrained search path moving target search problem /$cby James N. Eagle, James R. Yee.
260 $aMonterey, Calif. :$bNaval Postgraduate School ;$aSpringfield, Va. :$bAvailable from National Technical Information Service,$c[1985]
300 $a16 p. :$bill. ;$c28 cm.
500 $aTitle from cover.
500 $a"NPS-55-85-015."
500 $a"October 1985."
500 $aAD A161 045.
504 $aIncludes bibliographical references (p. 16)
520 $aA 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 from which he can choose is a function of the cell chosen in the previous time period. The problem is to find a searcher path, i.e., a sequence of search cells, that minimizes the probability of not detecting the target in a fixed number of time periods. The problem is formulated as a nonlinear program and solved for a local optimum by a simple implementation of the convex simplex method.
650 4 $aSEARCHING.
650 4 $aMOVING TARGETS.
650 4 $aNONLINEAR PROGRAMMING.
650 4 $aSIMPLEX METHOD.
700 1 $aYee, James R.
710 2 $aNaval Postgraduate School (U.S.).$bDept. of Operations Research.
740 0 $aNPS-55-85-015.
592 $aaq/aq cc:9116 02/27/98
926 $aNPS-LIB$bDIGIPROJ$cD 208.14/2:NPS-55-85-015$dBOOK$eNEVER$f1
926 $aNPS-LIB$bFEDDOCS$cD 208.14/2:NPS-55-85-015$dBOOK$f2