Coordination in multiagent systems and Laplacian spectra of digraphs
classification
💻 cs.MA
cs.DMmath.COmath.OC
keywords
analysiscontrollaplacianresultssomespectrasystemsapplication
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.