This paper describes PatrolGRAPH, a novel real-time search algorithm which has been specifically designed to solve the "patrolling problem", i.e., the problem of repeatedly visiting a set of specific locations in the environment. The algorithm has extremely low requirements in terms of computational power, does not require inter-robot communication, and can even be implemented on memoryless robots. Moreover, the algorithm is proven to be statistically complete as well as easily implementable on real, marketable robot swarms for real-world applications.
PatrolGRAPH: a Distributed Algorithm for Multi-Robot Patrolling
BAGLIETTO, MARCO;CANNATA, GIORGIO;CAPEZIO, FRANCESCO;GROSSO, ALBERTO;SGORBISSA, ANTONIO;ZACCARIA, RENATO UGO RAFFAELE
2008-01-01
Abstract
This paper describes PatrolGRAPH, a novel real-time search algorithm which has been specifically designed to solve the "patrolling problem", i.e., the problem of repeatedly visiting a set of specific locations in the environment. The algorithm has extremely low requirements in terms of computational power, does not require inter-robot communication, and can even be implemented on memoryless robots. Moreover, the algorithm is 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.
