On the linear cooperative search technique for a lost target with multiple searchers
by Mohamed Abd Allah El-Hadidy; Hamdy M. Abou-Gabal
International Journal of Mathematics in Operational Research (IJMOR), Vol. 21, No. 2, 2022

Abstract: We discuss the linear cooperative search model to detect a hidden and randomly located target on one of the n-intersected roads (real lines). The searching process starts from the origin with n searchers. Each one of these roads has one unit speed searcher. We get the expected value of the searching time until the (n - 1) searchers return to the origin after the target has been detected by the other searcher. We obtain the optimal distances for these n searchers to get the optimal search strategy which minimises the expected time of return. An interesting case with numerical results is studied when the target's position has a truncated normal distribution.

Online publication date: Fri, 25-Feb-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com