The searching algorithm for detecting a Markovian target based on maximizing the discounted effort reward search | ||||
| Journal of the Egyptian Mathematical Society | ||||
| Volume 28, Issue 1, June 2020, Page 1-18 PDF (967.98 K) | ||||
| DOI: 10.1186/s42787–020-00097–1 | ||||
 View on SCiNiTO | ||||
| Author | ||||
| Mohamed Abd Allah El-Hadidy1, 2 | ||||
| 1Department of Mathematics, Faculty of Science, Tanta University, Tanta, Egypt | ||||
| 2Mathematics and Statistics Department, College of Science, Taibah University, Yanbu, Saudi Arab | ||||
| Abstract | ||||
| 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. | ||||
| Keywords | ||||
| Search theory; Probability theory; Discounted effort reward search; Markovian targets | ||||
|
Statistics Article View: 40 PDF Download: 23 |
||||
