This paper deals with multi-consensus in multi-agent systems, focusing on the relationship between multi-consensusability and the underlying digraph topology. In particular, the topological arrangement of the network nodes naturally suggests distinguishing among, on the one hand, separate independent groups of agents agreeing internally and, on the other hand, a dependent common subgraph whose internal consensuses can be computed as a convex combination of the different consensuses achieved by the previously mentioned independent groups. The distinct achieved consensuses are as many as the number of groups of agents defining cells of a suitable almost equitable partition. Despite the notational complexity, the related computations are quite simple to carry out, as shown in some examples. (C) 2019 Elsevier Ltd. All rights reserved.

On multi-consensus and almost equitable graph partitions / Monaco, S.; Ricciardi Celsi, L.. - In: AUTOMATICA. - ISSN 0005-1098. - 103:(2019), pp. 53-61. [10.1016/j.automatica.2019.01.021]

On multi-consensus and almost equitable graph partitions

Monaco S.
;
Ricciardi Celsi L.
2019

Abstract

This paper deals with multi-consensus in multi-agent systems, focusing on the relationship between multi-consensusability and the underlying digraph topology. In particular, the topological arrangement of the network nodes naturally suggests distinguishing among, on the one hand, separate independent groups of agents agreeing internally and, on the other hand, a dependent common subgraph whose internal consensuses can be computed as a convex combination of the different consensuses achieved by the previously mentioned independent groups. The distinct achieved consensuses are as many as the number of groups of agents defining cells of a suitable almost equitable partition. Despite the notational complexity, the related computations are quite simple to carry out, as shown in some examples. (C) 2019 Elsevier Ltd. All rights reserved.
2019
Algebraic graph theory; Almost equitable partitions; Multi-agent systems; Multi-consensus
01 Pubblicazione su rivista::01a Articolo in rivista
On multi-consensus and almost equitable graph partitions / Monaco, S.; Ricciardi Celsi, L.. - In: AUTOMATICA. - ISSN 0005-1098. - 103:(2019), pp. 53-61. [10.1016/j.automatica.2019.01.021]
File allegati a questo prodotto
File Dimensione Formato  
Monaco_Preprint_On-Multi-Consensu_2019.pdf

accesso aperto

Note: https://doi.org/10.1016/j.automatica.2019.01.021
Tipologia: Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 394.92 kB
Formato Adobe PDF
394.92 kB Adobe PDF
Monaco_On-Multi-Consensus_2019.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 550.47 kB
Formato Adobe PDF
550.47 kB Adobe PDF   Contatta l'autore

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: https://hdl.handle.net/11573/1334095
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 30
  • ???jsp.display-item.citation.isi??? 27
social impact