The Deformed Consensus Protocol - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Automatica Année : 2013

The Deformed Consensus Protocol

Résumé

This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consensus protocol are studied in terms of parameter s for some special families of undirected and directed graphs, and for arbitrary graph topologies by leveraging the spectral theory of quadratic eigenvalue problems. Examples and simulation results are provided to illustrate our theoretical findings.
Fichier principal
Vignette du fichier
Morbidi_AUTO13_ExtVer.pdf (841.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00961491 , version 1 (20-03-2014)

Identifiants

Citer

Fabio Morbidi. The Deformed Consensus Protocol. Automatica, 2013, 49 (10), pp.3049-3055. ⟨10.1016/j.automatica.2013.07.006⟩. ⟨hal-00961491⟩
168 Consultations
1443 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More