This paper describes an algorithm, which has been specifically designed to solve the problem of multirobot-controlled frequency coverage (MRCFC), in which a team of robots are requested to repeatedly visit a set of predefined locations of the environment according to a specified frequency distribution. The algorithm has low requirements in terms of computational power, does not require inter-robot communication, and can even be implemented on memoryless robots. Moreover, it has proven to be statistically complete as well as easily implementable on real, marketable robot swarms for real-world applications.
A minimalist algorithm for multirobot continuous coverage
CANNATA, GIORGIO;SGORBISSA, ANTONIO
2011-01-01
Abstract
This paper describes an algorithm, which has been specifically designed to solve the problem of multirobot-controlled frequency coverage (MRCFC), in which a team of robots are requested to repeatedly visit a set of predefined locations of the environment according to a specified frequency distribution. The algorithm has low requirements in terms of computational power, does not require inter-robot communication, and can even be implemented on memoryless robots. Moreover, it has proven to be statistically complete as well as easily implementable on real, marketable robot swarms for real-world applications.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
