|
|
 |
| |
|
|
|
Optimal Discrete Search for a Randomly Moving COVID19 |
|
|
|
PP: 473-481 |
|
|
|
doi:10.18576/jsap/090304
|
|
|
|
Author(s) |
|
|
|
A. A. M. Teamah,
W. A. Afifi,
Javid Gani Dar,
Abd Al-Aziz Hosni El-Bagoury,
Sndus Naji Al-Aziz,
|
|
|
|
Abstract |
|
|
| In this paper, we subedit a search for a randomly moving Coronavirus (COVID-19) among a finite set of different states. We use a monitoring system to search for COVID-19 which is hidden in one of the n cells of the respiratory system in the human body in each fixed number of time intervals m. The expected rescue time of the patient and detecting COVID-19 has been obtained. Also, we extend the results and obtain the total optimal expected search time of COVID-19. The optimal search strategy is derived suing a dynamic programming algorithm. An illustrative real life example introduced to clear the applicability of this model.
|
|
|
|
|
|
|
|
