On the properties of the deformed consensus protocol

This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the undirected 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 graphs, and for graphs of arbitrary topology by leveraging the spectral theory of quadratic eigenvalue problems. Examples and simulation results are provided to illustrate our theoretical findings.

[1]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[2]  Israel Michael Sigal,et al.  Introduction to Spectral Theory , 1996 .

[3]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[4]  Alireza Tahbaz-Salehi,et al.  A Necessary and Sufficient Condition for Consensus Over Random Networks , 2008, IEEE Transactions on Automatic Control.

[5]  D. Cvetkovic,et al.  Signless Laplacians of finite graphs , 2007 .

[6]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[7]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[8]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[9]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[10]  S. R. Simanca,et al.  On Circulant Matrices , 2012 .

[11]  Israel Michael Sigal,et al.  Introduction to Spectral Theory: With Applications to Schrödinger Operators , 1995 .

[12]  Long Wang,et al.  Finite-Time Consensus Problems for Networks of Dynamic Agents , 2007, IEEE Transactions on Automatic Control.

[13]  Gene H. Golub,et al.  Matrix computations , 1983 .

[14]  Randy A. Freeman,et al.  Multi-Agent Coordination by Decentralized Estimation and Control , 2008, IEEE Transactions on Automatic Control.

[15]  Karl Meerbergen,et al.  The Quadratic Eigenvalue Problem , 2001, SIAM Rev..

[16]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[17]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.

[18]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[19]  Ruggero Carli,et al.  Average consensus on networks with quantized communication , 2009 .

[20]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.