Multi-robot coordination demonstrates outstanding performance in exploring and tracking targets in unknown environments, especially in complex terrain or disaster environments. In these cases, the distribution of the search area is changeable and irregular, and the exploration target may also move in an unknown environment. To quickly determine the location of these exploration targets, we propose a distributed control strategy in the article, which applies Bernoulli Thompson sampling to solve the multi-armed bandit problem to allow multiple robots to share information and efficiently search targets. This algorithm significantly speeds up the robot's search for targets, especially when most targets are concentrated in certain fixed areas of the environment.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.