Existence of cooperative search technique to find a Brownian target

Abstract

AbstractThis article aims to study the existence of the cooperative search technique to find a Brownian target. We have 2n cooperative searchers coordinate their search to find a Brownian target that moves on one of n disjoint real lines. Each line has two searchers. All of these searchers start the searching process from the origin. Rather than finding the conditions that make the expected value of the first interviewing time between one of the searchers and the target is finite, we compute the approximate value of this expected value.