The article shows that the Random Walk and Edge Counting algorithms allow to solve - under some constraints - the Multi-Robot Uniform Frequency Coverage problem, i.e., the problem of repeatedly visiting a set of locations in the environment with uniform frequency. Both algorithms have extremely low requirements in terms of computational power and memory storage, and do not require inter-robot communication. Their properties are described in details and formally demonstrated.

Multi-Robot Uniform Frequency Coverage of Significant Locations in the Environment

BAGLIETTO, MARCO;CANNATA, GIORGIO;CAPEZIO, FRANCESCO;SGORBISSA, ANTONIO
2009

Abstract

The article shows that the Random Walk and Edge Counting algorithms allow to solve - under some constraints - the Multi-Robot Uniform Frequency Coverage problem, i.e., the problem of repeatedly visiting a set of locations in the environment with uniform frequency. Both algorithms have extremely low requirements in terms of computational power and memory storage, and do not require inter-robot communication. Their properties are described in details and formally demonstrated.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11567/256410
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 9
social impact