Optimal Coordinated Search Problem for a Randomly Located Target

Authors

A. A. M. Teamah, Department of Mathematics, Faculty of Science, Tanta University, Tanta, EgyptFollow
A. A. Elbanna, Department of Mathematics, Faculty of Science, Tanta University, Tanta, EgyptFollow
H. A. Ismail, Department of Mathematics, Faculty of Science, Tanta University, Tanta, EgyptFollow

Author Country (or Countries)

Egypt

Abstract

The purpose of this paper is to study the coordinated search problem in which velocity of the searcher is a random variable. We are interested in finding a hole which randomly located on one of two disjoint oil pipelines or a cut in one of two lines of the power cable under sea surface. There are two searchers on every line that start the searching process from the origin of their line. In addition to calculating the expected value of the detection time, we derived the conditions which can minimize this expected value.:

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/160605

Recommended Citation

A. M. Teamah, A.; A. Elbanna, A.; and A. Ismail, H. (2022) "Optimal Coordinated Search Problem for a Randomly Located Target," Applied Mathematics & Information Sciences: Vol. 16: Iss. 6, Article 5.
DOI: http://dx.doi.org/10.18576/amis/160605
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss6/5