Abstract
In this paper, we present a mathematical search model that studies the generalised linear search plan for detecting a d-dimensional random walk target. The target will meet one of the searchers where each searcher starts its motion from any point rather than the origin on n-disjoint real lines in ℝn. Rather than, finding the conditions that show the finiteness of this search plan, we study the existence of the optimal search plan that minimises the expected value of the first meeting time between one of the searchers and the target.
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: International Journal of Mathematics in Operational Research
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.
