This paper addresses the design of an average consensus control law for perturbed multi-agent systems subject to unknown bounded-in-average disturbances. The consensus strategy is developed for both continuous-time and asynchronous event-triggered implementations. A fully distributed control approach is proposed to ensure practical stability within a specific attractor. The key novelty lies in leveraging projection matrix properties to design the Laplacian weights and triggering parameters through feasible Linear Matrix Inequalities (LMIs). Numerical results validate the theoretical analysis and demonstrate the method's scalability and efficiency, even for large networks with random topologies.
Weighted network design for practical average consensus in perturbed Multi-Agent Systems / Leccese, Sara; Caiazzo, Bianca; Petrillo, Alberto; Santini, Stefania; Seuret, Alexandre. - 59:11(2025), pp. 102-107. ( 2nd IFAC Workshop on Control of Complex Systems, COSY 2025, jointly with the 9th IFAC Symposium on System Structure and Control, SSSC 2025 and the 19th IFAC Workshop on Time Delay Systems, TDS 2025 fra 2025) [10.1016/j.ifacol.2025.09.532].
Weighted network design for practical average consensus in perturbed Multi-Agent Systems
Leccese, Sara;Caiazzo, Bianca;Petrillo, Alberto
;Santini, Stefania;
2025
Abstract
This paper addresses the design of an average consensus control law for perturbed multi-agent systems subject to unknown bounded-in-average disturbances. The consensus strategy is developed for both continuous-time and asynchronous event-triggered implementations. A fully distributed control approach is proposed to ensure practical stability within a specific attractor. The key novelty lies in leveraging projection matrix properties to design the Laplacian weights and triggering parameters through feasible Linear Matrix Inequalities (LMIs). Numerical results validate the theoretical analysis and demonstrate the method's scalability and efficiency, even for large networks with random topologies.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


