Stochastic search in a convex region (Q1822144)

A stochastic search strategy is proposed for locating a possibly mobile target in a bounded, convex region of the plane. The strategy is asymptotically minimax as \(\epsilon\) \(\to 0\) with respect to the time required to get within \(\epsilon\) of the target. The proof involves the study of first passages to time-dependent boundaries by a certain semi- Markov process.