Comments on "Consensus and cooperation in networked multi-agent systems"

Author

Chebotarev, Pavel

Author_Institution

Inst. of Control Sci., Russian Acad. of Sci., Moscow, Russia

Volume

98

Issue

7

fYear

2010

fDate

7/1/2010 12:00:00 AM

Firstpage

1353

Lastpage

1354

Abstract

The objective of this note is to give several comments regarding consensus and cooperation in networked multi-agent systems, and to mention some closely related results published in 2000 and 2001. This paper focuses on the graph theoretic results underlying the analysis of consensus in multiagent systems. As stated in the Introduction, "Graph Laplacians and their spectral properties are important graph related matrices that play a crucial role in convergence analysis of consensus and alignment algorithms." In particular, the stability properties of the distributed consensus algorithms for networked multiagent systems are completely determined by the location of the Laplacian eigenvalues of the network.

Keywords

Laplace equations; convergence; eigenvalues and eigenfunctions; graph theory; matrix algebra; multi-agent systems; Laplacian eigenvalues; convergence analysis; distributed consensus algorithms; graph Laplacians; graph related matrices; graph theoretic results; networked multiagent systems; Algorithm design and analysis; Convergence; Eigenvalues and eigenfunctions; Laplace equations; Multiagent systems; Stability analysis;

fLanguage

English

Journal_Title

Proceedings of the IEEE

Publisher

ieee

ISSN

0018-9219

Type

jour

DOI

10.1109/JPROC.2010.2049911

Filename

5485031