Multi-sensors search for lost moving targets using unrestricted effort
Abstract
This paper addresses the problem of searching for multiple targets using multiple sensors, where targets move randomly between a limited number of states at each time interval. Due to the potential value or danger of the targets, multiple sensors are employed to detect them as quickly as possible within a fixed number of search intervals. Each search interval has an available search effort and an exponential detection function is assumed. The goal is to develop an optimal search strategy that distributes the search effort across cells in each time interval and calculates the probability of not detecting the targets throughout the entire search period. The optimal search strategy that minimizes this probability is determined, the stability of the search is analyzed, and some special cases are considered. Additionally, we introduce the $M$-cells algorithm.References
Abd-Elmoneim A. M. Teamah, Search for lost targets with unrestricted effort, Pioneer Journal of Theortical and Applied Statistics, 1(2), 145-154, 2011.
Abd-Elmoneim A. M. Teamah and Hamdy M. Abou-Gabal, Double linear search problem for a Brownian target motion. J. Egypt Math, Soc. 16(1), 99-107, 2008.
Abd-Elmoneim A. Mohamed. The generalized search for one dimensional random walker, International J. Pure and Applied Mathematics19 (3), 375-387, 2005.
D. Peter, Scheduling search procedures. J. Scheduling 7, 349-364, 2004.
A. B. El-Rayes. M. A. Abd El-Moneim and Hamdy M. Abu Gabal, Linear search for a Brownian target motion, Acta Mathematica Scientia J. 23B (3), 321-327, 2003.
Abd EL-Moneim A. Mohamed and Hamdy Abu Gabal, Generalized optimal search paths for a randomly located target, Annual Conference (Cairo) ISSR 35, Part 1, pp. 17-29, 2000.
A. B. El-Rayes. M. A. Abd El-Moneim, Oscillating search for a randomly located target, AMSE J. 40(1), 29-39, 1998.
A. Oshumi, Optimal search for markovian target, Naval Research Logistics 38, 1991.
R. W. Alan, Search for moving target, The Fab Algorithm. Operation Res., 31, 739-751, 1983.
L. D. Stone, Theory of optimal search, Academic Press, New York, 1975.
Abd-Elmoneim A. M. Teamah, The generalized search for a randomly moving target, Applied Mathematics, 5, 642-652, 2014.
Abd-Elmoneim A. M. Teamah, Asmaa. B. Elbery, Optimal coordinated search for a discrete random walker, Applied Mathematics, 10, 2019.
W. Afifi, A. EL-Bagoury, S. Alaziz, A coordinated search algorithm for a lost target on the plane, J. Computer Syst. Sci. Eng. 34, 2021.
A. A. M. Teamah, W. A. Afifi, Quasi-coordinate search for a randomly moving target J. Applied Mathematics and Physics, 7, 1814-1825, 2019.
A. A. M. Teamah, W. A. Afifi, Javid Gani Dar, Abd Al-Aziz Hosni El-Bagoury and Sndus Naji Al-Aziz, Optimal discrete search for a randomly moving covid19, J. Stat. Appl. Pro. 9, No. 3, 473-481, 2020.
W. A. Afifi, A. A.M. Teamah and M.A. kassem, Detecting a randomly moving covid-19 using weight tcheby cheff optimization technique, J. Math. Comput. Sci. No. 5, 5652-5669, 2021.
O. Mangasarian, Nonlinear programming, Mc Graw Hill, New York, London, 1969.
V. Chankong and V. Y. Haimes, Multiobjective decision making theory and methodology, John Wiley & Sons Inc., North Holland, New York, 1983.
N. S. Bahgat, Analytical study on mathematical models for search plans of located and randomly moving targets, Ms. C. Thesis, Tanta University, 2004.
U. N. Bhat, Elements of appSons, New York, 1971.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
