Optimal Coordinated Search for a Discrete Random Walker

HTML  XML Download Download as PDF (Size: 580KB)  PP. 349-362  
DOI: 10.4236/am.2019.105025    682 Downloads   1,269 Views  

ABSTRACT

This paper presents the search technique for a lost target. A lost target is random walker on one of two intersected real lines, and the purpose is to detect the target as fast as possible. We have four searchers start from the point of intersection, they follow the so called Quasi-Coordinated search plan. The expected value of the first meeting time between one of the searchers and the target is investigated, also we show the existence of the optimal search strategy which minimizes this first meeting time.

Share and Cite:

Teamah, A. and Elbery, A. (2019) Optimal Coordinated Search for a Discrete Random Walker. Applied Mathematics, 10, 349-362. doi: 10.4236/am.2019.105025.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.