M-states search problem for a lost target with multiple sensors Online publication date: Mon, 07-Nov-2016
by Abd El-Moneim Anwar Teamah; Mohamed Abd El-Hady Kassem; Mohamed Abd Allah El-Hadidy
International Journal of Mathematics in Operational Research (IJMOR), Vol. 10, No. 1, 2017
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.
Online publication date: Mon, 07-Nov-2016
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com