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 …

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 …

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 …

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 …

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 …

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 …

There are n boxes. A target is initially in box i with a given probability p ı, where p ı≧ 0,∑ p
ı= 1. Then at discrete time t= 1, 2,…, it moves from box to box. If at time t the target is in box i …

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 …

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 …