Abstract
The coordinated search problem faced by two searchers who start together from some point onthe line in order to search for a lost target which randomly located on the line. In this paper the distribution ofthe lost target is symmetric around the point of the intersection of two lines, where the intersected point is astarting point of the motion of the searchers. There are four searchers start together the search for the losttarget at the intersection point under this condition we defined the search plan and computed the expectedvalue of the first meeting time between one of the searchers and the target. The search plan which minimizedthis first meeting time is studied. Finally we obtained some special cases for a search problems. An illustrativeexamples is given to demonstrate the applicability of this model.
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 callDisclaimer: 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.
