Consensus among autonomous agents is a key problem in multiagent control. In this article, we consider averaging consensus policies over time-varying graphs in presence of unknown but bounded communication delays. It is known that consensus is established (no matter how large the delays are) if the graph is periodically, or uniformly quasi-strongly connected (UQSC). The UQSC condition is often believed to be the weakest sufficient condition under which consensus can be proved. We show that the UQSC condition can actually be substantially relaxed and replaced by a condition that we call aperiodic quasi-strong connectivity, which, in some sense, proves to be very close to the necessary condition (the so-called integral connectivity). Under the assumption of reciprocity of interactions (e.g., for undirected or type-symmetric graphs), a necessary and sufficient condition for consensus in presence of bounded communication delays is established; the relevant results have been previously proved only in the undelayed case.
Delay Robustness of Consensus Algorithms: Continuous-Time Theory / Proskurnikov, Anton V.; Calafiore, Giuseppe Carlo. - In: IEEE TRANSACTIONS ON AUTOMATIC CONTROL. - ISSN 0018-9286. - ELETTRONICO. - 68:9(2023), pp. 5301-5316. [10.1109/TAC.2022.3218606]
Delay Robustness of Consensus Algorithms: Continuous-Time Theory
Proskurnikov, Anton V.;Calafiore, Giuseppe Carlo
2023
Abstract
Consensus among autonomous agents is a key problem in multiagent control. In this article, we consider averaging consensus policies over time-varying graphs in presence of unknown but bounded communication delays. It is known that consensus is established (no matter how large the delays are) if the graph is periodically, or uniformly quasi-strongly connected (UQSC). The UQSC condition is often believed to be the weakest sufficient condition under which consensus can be proved. We show that the UQSC condition can actually be substantially relaxed and replaced by a condition that we call aperiodic quasi-strong connectivity, which, in some sense, proves to be very close to the necessary condition (the so-called integral connectivity). Under the assumption of reciprocity of interactions (e.g., for undirected or type-symmetric graphs), a necessary and sufficient condition for consensus in presence of bounded communication delays is established; the relevant results have been previously proved only in the undelayed case.File | Dimensione | Formato | |
---|---|---|---|
TAC3218606_Postprint.pdf
accesso aperto
Tipologia:
2. Post-print / Author's Accepted Manuscript
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
2.14 MB
Formato
Adobe PDF
|
2.14 MB | Adobe PDF | Visualizza/Apri |
Delay_Robustness_of_Consensus_Algorithms_Continuous-Time_Theory-1.pdf
accesso riservato
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
1.26 MB
Formato
Adobe PDF
|
1.26 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2981384