Containment control of switched multi-agent systems

Abstract

In this paper, we consider the containment control problem for the switched multi-agent system which is composed of continuous-time and discrete-time subsystems. Continuous-time protocol based on the relative state measurements of agents are designed for the switched multi-agent system with multiple stationary and dynamic leaders, respectively. By using graph theory and matrix theory, some necessary and sufficient conditions are obtained for solving the containment control problem under arbitrary switching. When the leaders are dynamic, impulsive protocol are also proposed for the switched multi-agent system. The simulation results are given to verify the effectiveness of the theoretical results.

Consensus of Hybrid Multi-Agent Systems

“…Zhu et al [24] studied the containment control of such switched multi-agent system. In the practical systems, the dynamics of the agents coupled with each others are different, i.e., the dynamics of agents are hybrid.…”

Semi‐global containment of discrete‐time high‐order multi‐agent systems with input saturation via intermittent control

“…Recently, consensus of multi‐agent systems (MASs) is intensively researched for its widespread applications in sensor networks, vehicle formations, biological systems, and so forth [1–4]. Consensus includes three categories, leaderless consensus [5–9], leader‐following consensus [10–16] and containment [17–20].…”

Resilient consensus of switched multi-agent systems

“…[18] studies the finite-time convergence for switched multi-agent systems based on finite-time stability theory. Scaled consensus and containment control of switched multi-agent systems are also addressed in [19] and [20], respectively.…”

“…The proof of our main result (Theorem 1 below) is carefully divided into two cases, in each of which either the continuous-time subsystem or the discrete-time subsystem dominates in a sense. Moreover, unlike the work [17,18,19,20], no complicated algebraic conditions related to eigenvalues or eigenvectors are imposed here. Second, as an extension, resilient scaled consensus problems are introduced and solved for switched multi-agent systems.…”