Multirobot systems are essential for environmental monitoring, particularly for tracking spatial phenomena like pollution, soil minerals, and water salinity, and more. This study addresses the challenge of deploying a multirobot team for optimal coverage in environments where the density distribution, describing areas of interest, is unknown and changes over time. We propose a fully distributed control strategy that uses Gaussian processes (GPs) to model the spatial field and balance the tradeoff between learning the field and optimally covering it. Unlike existing approaches, we address a more realistic scenario by handling time-varying spatial fields, where the exploration-exploitation tradeoff is dynamically adjusted over time. Each robot operates locally, using only its own collected data and the information shared by the neighboring robots. To address the computational limits of GPs, the algorithm efficiently manages the volume of data by selecting only the most relevant samples for the process estimation. The performance of the proposed algorithm is evaluated through several simulations and experiments, incorporating real-world data phenomena to validate its effectiveness.
Distributed Coverage Control for Time-Varying Spatial Processes / Pratissoli, F.; Mantovani, M.; Prorok, A.; Sabattini, L.. - In: IEEE TRANSACTIONS ON ROBOTICS. - ISSN 1552-3098. - 41:(2025), pp. 1602-1617. [10.1109/TRO.2025.3539168]
Distributed Coverage Control for Time-Varying Spatial Processes
Pratissoli F.
;Mantovani M.;Sabattini L.
2025
Abstract
Multirobot systems are essential for environmental monitoring, particularly for tracking spatial phenomena like pollution, soil minerals, and water salinity, and more. This study addresses the challenge of deploying a multirobot team for optimal coverage in environments where the density distribution, describing areas of interest, is unknown and changes over time. We propose a fully distributed control strategy that uses Gaussian processes (GPs) to model the spatial field and balance the tradeoff between learning the field and optimally covering it. Unlike existing approaches, we address a more realistic scenario by handling time-varying spatial fields, where the exploration-exploitation tradeoff is dynamically adjusted over time. Each robot operates locally, using only its own collected data and the information shared by the neighboring robots. To address the computational limits of GPs, the algorithm efficiently manages the volume of data by selecting only the most relevant samples for the process estimation. The performance of the proposed algorithm is evaluated through several simulations and experiments, incorporating real-world data phenomena to validate its effectiveness.File | Dimensione | Formato | |
---|---|---|---|
2502.07595v1.pdf
Open access
Tipologia:
AO - Versione originale dell'autore proposta per la pubblicazione
Dimensione
7.58 MB
Formato
Adobe PDF
|
7.58 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris