Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems

This paper investigates the joint effect of agent dynamic, network topology and communication data rate on consensusability of linear discrete-time multi-agent systems. Neglecting the finite communication data rate constraint and under undirected graphs, a necessary and sufficient condition for cons...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control 2011-10, Vol.56 (10), p.2262-2275
Main Authors: You, Keyou, Xie, Lihua
Format: Article
Language:English
Subjects:
Agents (artificial intelligence)
Algorithms
Bandwidth
Communication graphs
consensusability
Convergence
convergence rate
Decoding
Dynamics
eigenratio
Eigenvalues and eigenfunctions
Entropy
Expert systems
finite communication data rate
formationability
Graphs
Laplace equations
Mathematical analysis
multi-agent systems
Multiagent systems
Networks
Protocols
Studies
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!
Description
Summary:This paper investigates the joint effect of agent dynamic, network topology and communication data rate on consensusability of linear discrete-time multi-agent systems. Neglecting the finite communication data rate constraint and under undirected graphs, a necessary and sufficient condition for consensusability under a common control protocol is given, which explicitly reveals how the intrinsic entropy rate of the agent dynamic and the communication graph jointly affect consensusability. The result is established by solving a discrete-time simultaneous stabilization problem. A lower bound of the optimal convergence rate to consensus, which is shown to be tight for some special cases, is provided as well. Moreover, a necessary and sufficient condition for formationability of multi-agent systems is obtained. As a special case, the discrete-time second-order consensus is discussed where an optimal control gain is designed to achieve the fastest convergence. The effects of undirected graphs on consensability/formationability and optimal convergence rate are exactly quantified by the ratio of the second smallest to the largest eigenvalues of the graph Laplacian matrix. An extension to directed graphs is also made. The consensus problem under a finite communication data rate is finally investigated.
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2011.2164017