This paper presents the searching algorithm to detect a Markovian target which moves randomly in M-cells. Our algorithm is based on maximizing the discounted effort reward search. At each fixed number of time intervals, the search effort is a random variable with a normal distribution. More than minimizing the non-detection probability of the targets at time interval i, we seek for the optimal distribution of the search effort by maximizing the discounted effort reward search. We present some special cases of one Markovian and hidden target. Experimental results for a Markovian, hidden target are obtained and compared with the cases of applying and without applying the discounted effort reward search.
El-Hadidy, M. (2020). The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search. Journal of the Egyptian Mathematical Society, 28(1), 1-18. doi: 10.1186/s42787–020-00097–1
MLA
Mohamed Abd Allah El-Hadidy. "The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search", Journal of the Egyptian Mathematical Society, 28, 1, 2020, 1-18. doi: 10.1186/s42787–020-00097–1
HARVARD
El-Hadidy, M. (2020). 'The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search', Journal of the Egyptian Mathematical Society, 28(1), pp. 1-18. doi: 10.1186/s42787–020-00097–1
VANCOUVER
El-Hadidy, M. The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search. Journal of the Egyptian Mathematical Society, 2020; 28(1): 1-18. doi: 10.1186/s42787–020-00097–1
)
