Authors: Abd El-Moneim Anwar Teamah; Mohamed Abd El-Hady Kassem; Mohamed Abd Allah El-Hadidy
Addresses: Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt ' Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt ' Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt
Abstract: This paper considers the discrete search problem for a single lost target by using multiple sensors. The lost target either located in one of a finite set of different states (cells) or moved through them according to random process with discrete time and discrete state space. A search effort at each fixed number of time intervals is a random variable with a given distribution. The probability that the target in a certain state j at a certain time i and the detection function is supposed to be known to the searchers. We seek for the optimal distribution of the effort that minimises the probability of undetection the target over the set of possible different states. Our aim is to deduce an explicit formula for the random distribution of the random variable effort. An algorithm is constructed for obtaining this optimal solution. The effectiveness of this method is illustrated using some examples with numerical results.
Keywords: optimal search effort; undetection probability; nonlinear stochastic programming; discrete search problem; M-states search; lost targets; multiple sensors; optimal distribution of effort.
International Journal of Mathematics in Operational Research, 2017 Vol.10 No.1, pp.104 - 135
Available online: 07 Nov 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article