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

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 …

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 …

In a recent paper (Stewart [19 79]), we have introduced the problem of search for a moving
target when there are practical constraints on the rate of movement of the searcher and have …

The search theory open literature has paid little, if any, attention to the multiple‐searcher,
moving‐target search problem. We develop an optimal branch‐and‐bound procedure and …

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 …