Bipartite Containment Control for Multi-agent Systems Under Fixed and Markov Switching Topologies

The distributed bipartite containment control problem of a set of general linear multi-agent systems with structural balanced symbolic graph is studied. The containment control analysis of communication topology under fixed topology and Markov switching topologies are given. Different from the traditional multi-agent containment control, a distributed observer and bipartite containment protocol are designed based on relative neighbour information. Algebraic graph theory and Lyapunov stability theory are applied to make the bipartite containment error and estimation error converge to zero under the action of the containment control protocol, thus making follower agents converge asymptotically to the states of leader agents. Finally, the effectiveness of the theoretical method is verified by simulation examples.

Automated summary

This study investigates the distributed bipartite containment control problem of a set of general linear multi-agent systems with structural balanced symbolic graph. The containment control analysis of communication topology is given under fixed topology and Markov switching topologies. Different from the traditional multi-agent containment control, a distributed observer and bipartite containment protocol are designed based on relative neighbour information. Algebraic graph theory and Lyapunov stability theory are applied to achieve convergence of the bipartite containment error and estimation error to zero, allowing follower agents to asymptotically converge to the states of leader agents. Finally, simulation examples are used to verify the effectiveness of the theoretical method.