By Topic

Distributed Coordination of Multi-Agent Systems With Quantized-Observer Based Encoding-Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tao Li ; Key Laboratory of Systems and Control, Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China ; Lihua Xie

Integrative design of communication mechanism and coordinated control law is an interesting and important problem for multi-agent networks. In this paper, we consider distributed coordination of discrete-time second-order multi-agent systems with partially measurable state and a limited communication data rate. A quantized-observer based encoding-decoding scheme is designed, which integrates the state observation with encoding/decoding. A distributed coordinated control law is proposed for each agent which is given in terms of the states of its encoder and decoders. It is shown that for a connected network, 2-bit quantizers suffice for the exponential asymptotic synchronization of the states of the agents. The selection of controller parameters and the performance limit are discussed. It is shown that the algebraic connectivity and the spectral radius of the Laplacian matrix of the communication graph play key roles in the closed-loop performance. The spectral radius of the Laplacian matrix is related to the selection of control gains, while the algebraic connectivity is related to the spectral radius of the closed-loop state matrix. Furthermore, it is shown that as the number of agents increases, the asymptotic convergence rate can be approximated as a function of the number of agents, the number of quantization levels (communication data rate) and the ratio of the algebraic connectivity to the spectral radius of the Laplacian matrix of the communication graph.

Published in:

IEEE Transactions on Automatic Control  (Volume:57 ,  Issue: 12 )