Optimal Discrete Search for a Randomly Moving COVID19
Unknown authors
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 © 2020 Natural Sciences Publishing All rights reserved
Topics & Concepts
Coronavirus disease 2019 (COVID-19)Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2)Set (abstract data type)2019-20 coronavirus outbreakComputer scienceDynamic programmingMathematical optimizationMathematicsAlgorithmMedicineVirologyDiseaseInfectious disease (medical specialty)OutbreakProgramming languagePathologyOptimization and Search ProblemsAdvanced Bandit Algorithms ResearchFacility Location and Emergency Management