Coordination in multiagent systems and Laplacian spectra of digraphs

Authors:
P. Yu. Chebotarev;R. P. Agaev
Affiliations:
Trapeznikov Institute of Control Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2009

Citing 3
Cited 5

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Spanning Forests of a Digraph and Their Applications

Automation and Remote Control
On Determining the Eigenprojection and Components of a Matrix

Automation and Remote Control

Dynamic models of informational control in social networks

Automation and Remote Control
Synchronization in networks of linear agents with output feedbacks

Automation and Remote Control
The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Automation and Remote Control
Models of strategic behavior

Automation and Remote Control
Equidistant arrangement of agents on line: Analysis of the algorithm and its generalization

Automation and Remote Control

Quantified Score

Hi-index	0.01

Visualization

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. We also discuss the application of these results published earlier to decentralized control and touch upon some problems of spectral graph theory.