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

Mohamed Abd Allah El-Hadidy and Hamdy M. Abou-Gabal

International Journal of Mathematics in Operational Research, 2022, vol. 21, issue 2, 221-231

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. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=121112 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:21:y:2022:i:2:p:221-231

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().