By Topic

Dynamic consensus of linear multi-agent systems

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 $33
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

3 Author(s)
Z. Li ; Sch. of Autom., Beijing Inst. of Technol., Beijing, China ; Z. Duan ; G. Chen

This study concerns the consensus of a network of agents with general linear or linearised dynamics, whose communication topology contains a directed spanning tree. An observer-type consensus protocol based on the relative outputs of the neighbouring agents is adopted. The notion of consensus region is introduced, as a measure for the robustness of the protocol and as a basis for the protocol design. For neutrally stable agents, it is shown that there exists a protocol achieving consensus together with a consensus region that is the entire open right-half plane if and only if each agent is stabilisable and detectable. An algorithm is further presented for constructing such a protocol. For consensus with a prescribed convergence speed, a multi-step protocol design procedure is given, which yields an unbounded consensus region and at the same time maintains a favourable decoupling property. Finally, the consensus algorithms are extended to solve the formation control problems.

Published in:

IET Control Theory & Applications  (Volume:5 ,  Issue: 1 )