Open Access

ARTICLE

A Coordinated Search Algorithm for a Lost Target on the Plane

Sundus Naji Al-Aziz^1,*, Abd Al-Aziz Hosni El-Bagoury², W. Afifi^2,3

1 Department of Mathematics, College of Science, Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia
2 Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
3 Department of Mathematics and Statistics, College of Science, Taibah University, Yanbu, Saudi Arabia

* Corresponding Author: Sundus Naji Al-Aziz. Email:

Computer Systems Science and Engineering 2022, 40(1), 127-137. https://doi.org/10.32604/csse.2022.016007

Received 18 December 2020; Accepted 20 April 2021; Issue published 26 August 2021

Abstract

Concepts in search theory have developed since World War II. The study of search plans has found considerable interest among searchers due to its wide applications in our life. Searching for lost targets either located or moved is often a time-critical issue, especially when the target is very important . In many commercial and scientific missions at sea, it is of crucial importance to find lost targets underwater. We illustrate a technique known as coordinated search, that completely characterizes the search for a randomly located target on a plane. The idea is to avoid wasting time looking for a missing target. Two searchers or robots start from the center of a circle to search out a lost target, the first searcher looks for the target on the right side of the circular area, and the second one looks for it on the left side. The time taken to detect the target is obtained by assuming the target’s position has a symmetric distribution. The procedures to facilitate the detection of the target are presented as an algorithm and as a flowchart. An application demonstrates the applicability of this search technique and the associated decrease in search cost. Its effectiveness is illustrated by numerical results, which indicates considerable promise.

---

Keywords

---