Skip to Main content Skip to Navigation
Journal articles

The Deformed Consensus Protocol

Fabio Morbidi 1, *
* Corresponding author
1 NECS - Networked Controlled Systems
GIPSA-DA - Département Automatique, Inria Grenoble - Rhône-Alpes
Abstract : 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.
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download
Contributor : Fabio Morbidi <>
Submitted on : Thursday, March 20, 2014 - 10:37:46 AM
Last modification on : Wednesday, May 13, 2020 - 4:16:01 PM
Document(s) archivé(s) le : Friday, June 20, 2014 - 10:55:46 AM


Files produced by the author(s)




Fabio Morbidi. The Deformed Consensus Protocol. Automatica, Elsevier, 2013, 49 (10), pp.3049-3055. ⟨10.1016/j.automatica.2013.07.006⟩. ⟨hal-00961491⟩



Record views


Files downloads