This paper shows that solving the optimal whereabouts search problem for a moving target
is equivalent to solving a finite number of optimal detection problems for moving targets. This …

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 …

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 …

This book begins with a review of basic results in optimal search for a stationary target. It
then develops the theory of optimal search for a moving target, providing algorithms for …

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 …

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 …

In this note we show that the problem of finding an optimal searcher path that maximizes the
probability of detecting a stationary target by the end of a fixed time is NP-complete. We also …

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 simple moving target problem is approximately solved for that search path minimizing the
probability of non-detection subject to specified constraints on the search path. The solution …

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 …