Abstract
In this paper, we present a complex cooperative search technique for finding the Random Walking microorganism cells on one of [Formula: see text]-intersect real lines at the origin. We have 2[Formula: see text] unit speed searchers starting together from the origin. Furthermore, proving the existence of a finite search plan, we are discussing the existence of optimality for this search plan which minimizes the expected value of the first meeting time between one of the searchers and the microorganism cells.
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.
