COORDINATED SEARCH FOR A RANDOMLY LOCATED TARGET
Abd El-Moneim A. M. Teamah, Hamdy Mohamed Abou Gabal, W. A. Afifi · Delta Journal of Science · 2017
The coordinated search problem faced by two searchers who start together from some point onthe line in order to search for a lost target which randomly located on the line. In this paper the distribution ofthe lost target is symmetric around the point of the intersection of two lines, where the intersected point is astarting point of the motion of the searchers. There are four searchers start together the search for the losttarget at the intersection point under this condition we defined the search plan and computed the expectedvalue of the first meeting time between one of the searchers and the target. The search plan which minimizedthis first meeting time is studied. Finally we obtained some special cases for a search problems. An illustrativeexamples is given to demonstrate the applicability of this model.