Loading…
Coordination in multiagent systems and Laplacian spectra of digraphs
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. We also discuss the application of these results published earlier to decentralized control...
Saved in:
Published in: | Automation and remote control 2009-03, Vol.70 (3), p.469-483 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. We also discuss the application of these results published earlier to decentralized control and touch upon some problems of spectral graph theory. |
---|---|
ISSN: | 0005-1179 1608-3032 |
DOI: | 10.1134/S0005117909030126 |