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 …

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 …

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 …

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 …

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 …

We consider the problem of searching for a target that moves in discrete time and space
according to some Markovian process. At each time, a searcher attempts to detect the target …

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 …

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 …

A feasible solution always establishes a lower bound on the maximum value of an objective
function. In the class of problems considered here, the objective function is detection …

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 …