Cooperative search model for finding a brownian target on the real line

Abstract

In this paper, we study the cooperation between two searchers start the searching process from the origin to meet a Brownian moving target on a real line. We find the conditions that make the expected value of the first meeting time between one of the searchers and the target is finite. This is the first model which calculates the approximate value for the expected value of the first meeting time. An illustrative example has been given to demonstrate the applicability of this model.

Keywords

• linear search
• coordinated search
• brownian motion