Coordination in multiagent systems and Laplacian spectra of digraphs

Simple item page
dc.creatorChebotarev, Pavel
dc.creatorAgaev, Rafig
dc.date2009-02-24
dc.date.accessioned2026-07-07T12:54:13Z
dc.date.available2026-07-07T12:54:13Z
dc.descriptionConstructing 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.
dc.description15 pages, 2 figures, 40 references. To appear in Automation and Remote Control, Vol.70, No.3, 2009
dc.identifierhttps://arxiv.org/abs/0902.4098
dc.identifierhttp://arxiv.org/abs/0902.4098
dc.identifierAutomation and Remote Control, Vol.70 (2009), No.3, P. 469-483
dc.identifierdoi:10.1134/S0005117909030126
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223851
dc.subjectMultiagent Systems
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subjectOptimization and Control
dc.titleCoordination in multiagent systems and Laplacian spectra of digraphs
dc.typetext

Files

Collections

arXiv