In this paper we study a novel model of determining the existence of the multi generalized linear search problem to detect a lost target in one of several real lines. Every line has one searcher or robot. We have n searchers starting from some points on n lines. The existence of the optimal search plan which minimizes the expected value of the first meeting time between one of the searchers and the lost target is proved. The effectiveness of this strategy is illustrated by introducing a real life application.
A. Afifi, W. and Al-Aziz Hosni El-Bagoury, Abd
"Optimal Multiplicative Generalized Linear Search Plan for a Discrete Randomly Located Target,"
Information Sciences Letters: Vol. 10
, Article 19.
Available at: https://digitalcommons.aaru.edu.jo/isl/vol10/iss1/19