Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker. (30th July 2013) - Mohamed, Abd-Elmoneim Anwar
Abstract : This paper formulates a search model that gives the optimal search plan for the problem of finding a discrete random walk target in minimum time. The target moves through one of n -disjoint real lines inℝ n : we have n -searchers starting the searching process for the target from any point rather than the origin. We … find the conditions that make the expected value of the fi … rst meeting time between one of the searchers and the target fi … nite. Furthermore, we show the existence of the optimal search plan that minimizes the expected value of the fi … rst meeting time and fi … nd it. The effectiveness of this model is illustrated using numerical example.