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 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 …

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 surveillance search problem is a generalization of the detection search problem studied
by Brown and Stone, among others. In the surveillance version of the problem, the search …

It is desired to minimize the expected cost of finding an object which moves back and forth
between two locations according to an unobservable Markov process. When the object is in …

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 …

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 …

An object is hidden in one of two boxes and occasionally moves between the boxes in
accordance with some specified continuous-time Markov process. The objective is to find the …