We introduce a new algorithm to cover an unknown space with a homogenous team of circular mobile robots. Our approach uses a previous single robot coverage algorithm that divides the target space into cells, each of which can be covered with simple back and forth motions. The advantage of our method is that we plan in a two dimensional configuration space for a team of n robots, bypassing the 2n dimensional configuration space. The approach used is semi-decentralized - robot teams cover the space independent of each other, but, robots within a team communicate state and share information. An implementation of the algorithm, in simulation, is also detailed.
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.