, Volume 77, Issue 1, pp 99-116

Stochastic search in a convex region

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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

Supported by NSF grant DMS 82-01723