A lost target is a random walker on one of n disjoint lines, and the purpose is to detect the target as fast as possible. On each line there are two searchers starting the search from the origin of their line, where they follow the so called coordinate search. One common measure of effectiveness for the search process is the expected time of search. This type of search has been addressed and solved in the literature for the case where the target is located. In this paper, we introduce a new model of search and prove that the expected value of the first meeting time between one of the searchers and the lost target is finite. Also, we show the existence of the optimal search plan which minimizes the expected value. An application is also given to illustrate our results.
Digital Object Identifier (DOI)
A. Afifi, W.; Al-Aziz Hosni El-Bagoury, Abd; and Naji Alaziz, Sundus
"A Novel Search Algorithm for a Multi Searchers Random Walk,"
Applied Mathematics & Information Sciences: Vol. 14:
1, Article 15.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol14/iss1/15