On Minimum Expected Search Time Algorithm for 3-Dimensional Randomly Located Target

Authors

Mohamed A. Kassem, Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
Abd Al-Aziz Hosni El-Bagoury
Sundus Naji AL-Aziz
W. A. Afifi

Author Country (or Countries)

Egypt

Abstract

This article involves a new search model for a randomly located target; it looks into greater depth at search theory, the proposed model constructs the search for a three-dimensional randomly located target in a known region, using two searchers. The search region is divided into two subzones. The central issue is to calculate the expected time of detecting the target in case of SST (symmetric Search Technique) and AST (Asymmetric Search Technique), by using trivariate known distribution. This work introduces a statistical technique as an optimization problem. The crux of the matter is to obtain the optimal search path that minimizes the expected time of detecting the lost target. As a result, the optimal values will demonstrate the applicability of this technique.

Suggested Reviewers

N/A

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/jsap/100115

Recommended Citation

A. Kassem, Mohamed; Al-Aziz Hosni El-Bagoury, Abd; Naji AL-Aziz, Sundus; and A. Afifi, W. (2021) "On Minimum Expected Search Time Algorithm for 3-Dimensional Randomly Located Target," Journal of Statistics Applications & Probability: Vol. 10: Iss. 1, Article 15.
DOI: http://dx.doi.org/10.18576/jsap/100115
Available at: https://digitalcommons.aaru.edu.jo/jsap/vol10/iss1/15