Optimal Search for a lost moving target whose truncated Markov Chain with continuous time
Keywords:
Optimal search plan, Truncated Markov chain with continuous time, probability of undetection
Abstract
The main contribution of this paper center a round searching for a lost target which moves among finite number of cells according to truncated Markov chain with continuous time , the searcher distributes the effort among the states and the purpose is to minimize the search effort and the probability of undetection at the same time.
Published
2025-06-10
How to Cite
M. M. El-Ghoul, & Abd-Elmoneim A. M. Teamah. (2025). Optimal Search for a lost moving target whose truncated Markov Chain with continuous time. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-2177
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
