Consensusability of continuous‐time multi‐agent systems with general linear dynamics and intermittent measurements

Abstract

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.

Containment control of continuous-time linear multi-agent systems with aperiodic sampling

“…This special case has been well studied in Gao, Ma, Zuo, Mo, and Yu (2012). For the aperiodic sampling case, we will verify the stability by checking the spectral radius of…”

“…From Theorem 2, we know that the fixed sampling period τ 0 and gain matrix K can be determined by ρ(Φ(τ 0 , L F F , n − m)) < 1. In Gao et al (2012), a condition on the sampling period and the gain matrix K has already been provided. Then, the gain matrix K can be designed by fixing a sampling period.…”

Containment control of switched multi-agent systems

“…Consensus means that a group of agents reach an agreement upon some quantities of interest using information of neighbours. By using matrix theory, graph theory, Lyapunov direct method, etc., consensus problem has been widely investigated under different contexts, such as quantised consensus (Li & Xie, 2012;Zhu, Zheng, & Wang, 2015), group consensus (Yu & Wang, 2010), sampled-databased consensus (Gao, Wang, Xie, & Wu, 2009;Gao, Ma, Zou, Mo, & Yu, 2013). The references mentioned above often consider the consensus problems for a group of agents without any leader.…”

Sampled-Data Consensus for High-Order Multiagent Systems under Fixed and Randomly Switching Topology

“…All the aforementioned literature concentrate on first or second order integrator agents. Nevertheless, the consensus problem of high-order agents is important and has been recently considered by many researchers [12][13][14][15][16][17]. Zhang and Tian [14] pointed out that for high-order multiagent systems the sampling period should be bounded and proposed an allowable bound based on given consensus protocol.…”

“…Zhang and Tian [14] pointed out that for high-order multiagent systems the sampling period should be bounded and proposed an allowable bound based on given consensus protocol. In [15], Gao et al studied the consensusability of sampled-data multiagent systems with general linear dynamics and gave some sufficient and necessary conditions for consensusability in the case of state feedback.…”