Abstract

In this paper, three random search strategies are implemented and compared in odour finding using multiple robots. The first strategy is Brownian walk (BW). As a typical uncorrelated random search strategy, BW combines a Gaussian distribution of move length with a uniform distribution of turning angles. Another two strategies are correlated random search strategies, namely correlated random walk (CRW) and Levy walk (LW). CRW and LW are obtained by replacing the distribution of move lengths and turning angles in BW with wrapped Cauchy distribution and Levy distribution, respectively. Experiments with the three random search strategies were conducted using four MrCollie robots in our laboratory. Results show that the two correlated random search strategies (i.e., CRW and LW) are more time-efficient than BW, and that LW obtains higher time-efficiency than CRW with respect to our experimental setup.

Full Text
Paper version not known

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 call

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.