Modeling a random search

Abstract : A model for random search is considered which differs from the classical random search by modeling the random paths of the searcher and/or target as those of a Wiener process. The quantity of interest is the distribution of detection time for a cookie cutter mode of detection. Only one- dimensional search is considered here.