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 …

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 …

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 …

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 …

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

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 …

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 …

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 propose and study an iterative Forward And Backward (FAB) algorithm applicable to the
problem of computing optimal search plans when the target's motion is modeled by a …