Asymptotically minimax stochastic search strategies in the plane

Abstract
Stochastic search strategies are proposed for finding a possibly mobile target within a convex region of the plane. The strategies are asymptotically minimax as epsilon --> 0 with respect to the time required to get within epsilon of the target.

This publication has 0 references indexed in Scilit: