Generalized Coordinated Search Problem for a Randomly Located Target

Document Type : Research and Reference

Authors

1 Department of Mathematics, Faculty of science, Tanta university, Tanta, Egypt

2 Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt

3 Departmenr of Mathematics, Faculty of science, Tanta university, Tanta, Egypt

Abstract

In this paper, we aim to obtain the investigation of the coordinated search problem, in which the velocities of each searcher is a random variable. Our main goal is to find a randomly located target on the real line; this target may be a hole in an oil pipeline or a cut in a power cable below the sea surface. Currently, there are two searchers on the line, and instead of starting at the origin, they search from any point on the line. The first searcher searches the right part, and the second searcher searches the left part. We provide the most efficient coordinated search method, and we calculate the expected value of the time to detect the target. In addition, the conditions under which this expected value can be minimized were derived. The most important aspect of this method is that we have possession of the most effective method for search optimization.

Keywords

Main Subjects

Delta Journal of Science
Volume 49, Issue 1
September 2024
Pages 172-185

Files

Share

How to cite

Statistics