Coordination in multiagent systems and Laplacian spectra of digraphs

Abstract

Constructing and studying distributed control systems requires the analysis of the Laplacian spectra and the forest structure of directed graphs. In this paper, we present some basic results of this analysis partially obtained by the present authors. We also discuss the application of these results to decentralized control and touch upon some problems of spectral graph theory.

15 pages, 2 figures, 40 references. To appear in Automation and Remote Control, Vol.70, No.3, 2009

References in corpus (4)

• On the spectra of nonsymmetric Laplacian matrices
• Forest matrices around the Laplacian matrix
• Spanning Forests of a Digraph and Their Applications
• On Determining the Eigenprojection and Components of a Matrix

Cited by in corpus (7)

• On graph theoretic results underlying the analysis of consensus in multi-agent systems
• Comments on "Consensus and Cooperation in Networked Multi-Agent Systems"
• The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix
• Which Digraphs with Ring Structure are Essentially Cyclic?
• State-dependent effective interactions in oscillator networks through coupling functions with dead zones
• Hierarchical Cyclic Pursuit: Algebraic Curves Containing the Laplacian Spectra
• The projection method for continuous-time consensus seeking