Coordination in multiagent systems and Laplacian spectra of digraphs
Multiagent Systems
2009-03-20 v1 Discrete Mathematics
Combinatorics
Optimization and Control
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.
Cite
@article{arxiv.0902.4098,
title = {Coordination in multiagent systems and Laplacian spectra of digraphs},
author = {Pavel Chebotarev and Rafig Agaev},
journal= {arXiv preprint arXiv:0902.4098},
year = {2009}
}
Comments
15 pages, 2 figures, 40 references. To appear in Automation and Remote Control, Vol.70, No.3, 2009