Bipartite consensus of general linear multi-agent systems
- 1 June 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07431619,p. 808-812
Abstract
Collective behaviors of multi-agent systems over signed graphs find applications in a variety of scenarios including social networks, predator-prey dynamics, which however have not been adequately addressed as their counterparts with nonnegative graphs. This paper studies bipartite consensus problem of general linear multi-agent systems over signed digraphs. First, we show that for general linear agents, bipartite consensus over signed graphs and ordinary consensus over nonnegative graphs are equivalent. This indicates that prevailing consensus controllers for nonnegative graphs can be adopted to solve bipartite consensus problems. Based on this observation, an existing Riccati equation based cooperative tracking controller is extended to solve the bipartite consensus problem for general linear systems.Keywords
This publication has 15 references indexed in Scilit:
- Cooperative Control of Multi-Agent Systems2014
- Consensus Problems on Networks With Antagonistic InteractionsIEEE Transactions on Automatic Control, 2012
- Dynamics of Opinion Forming in Structurally Balanced Social NetworksPLOS ONE, 2012
- Optimal Design for Synchronization of Cooperative Systems: State Feedback, Observer and Output FeedbackIEEE Transactions on Automatic Control, 2011
- Distributed Coordination of Multi-agent Networks2011
- Distributed Consensus in Multi-vehicle Cooperative Control2008
- Consensus and Cooperation in Networked Multi-Agent SystemsProceedings of the IEEE, 2007
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Algebraic Graph Theory2001
- Social Network Analysis1994