Abstract
In this paper, we research the group consensus problem of third-order multi-agent systems based on connected bipartite graph topology. According to the characteristics of connected bipartite graphs, we design the group consensus control protocol based on competition for the third-order multi-agent. The necessary and sufficient conditions to achieve group consensus for the third-order multi-agent system are analyzed by using algebraic graph theory and matrix theory, and the value range of coupling parameters is obtained when the multi-agent system achieves group consistency, and the consistent equilibrium point of two groups is also obtained. The simulation results show that the third-order multi-agent system under the connected bipartite graph can achieve group consensus.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
