Title: On the linear cooperative search technique for a lost target with multiple searchers

Authors: Mohamed Abd Allah El-Hadidy; Hamdy M. Abou-Gabal

Addresses: Mathematics Department, Faculty of Science, Tanta University, Tanta, Egypt; Mathematics and Statistics Department, College of Science, Taibah University, Yanbu, Saudi Arabia ' Mathematics Department, Faculty of Science, Tanta University, Tanta, Egypt

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.

Keywords: cooperative search model; probability of detection; truncated normal distribution; optimal search plan.

DOI: 10.1504/IJMOR.2022.121112

International Journal of Mathematics in Operational Research, 2022 Vol.21 No.2, pp.221 - 231

Received: 29 Sep 2020
Accepted: 04 Jan 2021
Published online: 25 Feb 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article