This 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.

中文翻译：

---

寻找布朗目标的合作搜索技术的存在

本文旨在研究寻找布朗目标的协同搜索技术的存在。我们有 2n 个合作搜索者协调他们的搜索以找到一个在 n 个不相交的实线之一上移动的布朗目标。每行有两个搜索者。所有这些搜索者都从源头开始搜索过程。我们不是找到使搜索者和目标之间的第一次采访时间的期望值有限的条件，而是计算该期望值的近似值。