This work describes a novel control protocol for multi-agent systems to solve the dynamic max-consensus problem. In this problem, each agent has access to an external timevarying scalar signal and has the objective to estimate and track the maximum among all these signals by exploiting only local communications. The main strength of the proposed protocol is that it is able to self-tune its internal parameters in order to achieve an arbitrary small steady-state error without significantly affecting the convergence time. We employ the proposed protocol in the context of distributed graph parameter estimations, such as size, diameter, and radius, and provide simulations in the scenario of open multi-agent systems. Copyright (C) 2022 The Authors.
Dynamic max-consensus with local self-tuning
Deplano, D
Primo
;Franceschelli, MPenultimo
;Giua, AUltimo
2022-01-01
Abstract
This work describes a novel control protocol for multi-agent systems to solve the dynamic max-consensus problem. In this problem, each agent has access to an external timevarying scalar signal and has the objective to estimate and track the maximum among all these signals by exploiting only local communications. The main strength of the proposed protocol is that it is able to self-tune its internal parameters in order to achieve an arbitrary small steady-state error without significantly affecting the convergence time. We employ the proposed protocol in the context of distributed graph parameter estimations, such as size, diameter, and radius, and provide simulations in the scenario of open multi-agent systems. Copyright (C) 2022 The Authors.File | Dimensione | Formato | |
---|---|---|---|
Dynamic max-consensus with local self-tuning.pdf
accesso aperto
Descrizione: Paper online
Tipologia:
versione editoriale (VoR)
Dimensione
508.22 kB
Formato
Adobe PDF
|
508.22 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.