There are n boxes. A target is initially in box i with a given probability p ı, where p ı≧ 0,∑ p
ı= 1. Then at discrete time t= 1, 2,…, it moves from box to box. If at time t the target is in box i …

We consider optimal search for a moving target in discrete space. A limited amount of search
effort is available at each of a fixed number of time intervals and we assume an exponential …

A target moves between two regions in a Markovian fashion, the parameters of which are
known to the searcher. Discrete amounts of search effort (“looks”) may be allocated to one …

We are told that an object is hidden in one of m (m<∞) boxes and we are given prior
probabilities pi 0 that the object is in the i th box. A search of box i costs ci and finds the …

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 …

Let {X t, t≥ 0} be a stochastic process representing the motion of a target in Euclidean n-
space. Search effort is applied at the rate m (t)> 0 for 0≤ t≤ T, and it is assumed that this …

Pollock has examined a model of search for a target whose transitions between two regions
are described by a two-state stationary Markov chain. The minimum-search policy is …

This paper formulates a two-cell model of search for a moving target as a continuous-time
Markov process with known constant transition rates and detection rates, and finds the …

THE OPTIMAL SEARCH PLAN FOR A MOVING [a]ARGET MINIMIZING RISK [to,T].The total Page 1
The Operations Research Society of Japan NII-Electronic Library Service TheOpelationsReseaich …

A discrete search model for one of many objects hidden in two boxes is studied. The number
of objects is assumed to be a random variable with a known prior distribution. When box i is …