Abstract
In this paper we describe the quasi-coordinated search problem for a lost located target on one of n-disjoint lines in which any information of the target position is not available to the searchers all the time. Every two searchers on each line cooperate together to find the location of the lost target as soon as possible where the motion of every two searchers on each line are independent for the motion of the other searchers on another lines. The purpose of this paper is to formulate a search problem and find the expected value of the first meeting time between one of the searchers and the target. Also, we show the existence of the optimal search plan which minimizes the expected value of the first meeting time and find it.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Applied & Computational Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
