
Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements
Author(s) -
Gao Yanping,
Ma Jingwei,
Zuo Min,
Mo Lipo,
Yu Junyan
Publication year - 2013
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2012.0688
Subject(s) - multi agent system , control theory (sociology) , sampling (signal processing) , computer science , spanning tree , graph , controller (irrigation) , dynamics (music) , state (computer science) , topology (electrical circuits) , mathematics , control (management) , algorithm , artificial intelligence , theoretical computer science , filter (signal processing) , combinatorics , agronomy , computer vision , biology , physics , acoustics
This article studies the consensusability of multi‐agent systems with general linear continuous‐time dynamics. It is assumed that each agent can only obtain the information of other agents at sampling instants. Some sufficient and necessary conditions for consensusability in the case of state feedback are established, and it is shown that multi‐agent systems with periodic sampling are consensusable if and only if the system associated with each agent is stabilisable and the topology graph has a spanning tree. Furthermore, some methods are provided to seek controller gain and sampling period which ensure consensus. Simulations are performed to validate the theoretical results.