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 …

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 …

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 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 target moves in Euclidean n-space R^n according to some probabilistic law. A search
density, which accumulates on the target during its route, determines the probability of …

Optimal search for targets with conditionally deterministic motion is investigated. The target
motion takes place in Y, a copy of Euclidean n-space, and depends on a stochastic …

Note on sequential search<link href='#fn1'></link> Page 1 NOTE ON SEQUENTIAL SEARCH':'
Morton Klein Columbia University ABSTRACT Optimal distribution ofsearch effort problems for …

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 …

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 …