Bipartite consensus strategies for coopetition networks
2014 (English)In: 2014 33rd Chinese Control Conference (CCC), IEEE Computer Society, 2014, 1505-1510 p.Conference paper (Refereed)
Cooperation and competition are two typical interactional relationships in natural and engineering networked systems. Some interesting collective behaviors can emerge through local interactions within the networked systems. This paper focuses on the coexistence of competition and cooperation (i.e., coopetition) at the network level and, simultaneously, the collective dynamics on such coopetition networks. The coopetition network is represented by a directed signed graph. The interaction relationship between the agents on the coopetition network is described by a multi-agent system. We investigate two bipartite consensus strategies for the agents such that all the agents converge to a final state characterized by identical modulus but opposite sign. Under a weak connectivity assumption that the signed network has a spanning tree, some sufficient conditions are derived for bipartite consensus of multi-agent systems with the help of a structural balance theory. Finally, simulation results are provided to demonstrate the bipartite consensus formation.
Place, publisher, year, edition, pages
IEEE Computer Society, 2014. 1505-1510 p.
, Chinese Control Conference, CCC, ISSN 1934-1768
Bipartite Consensus, Coopetition Networks, Spanning Tree, Structural Balance
IdentifiersURN: urn:nbn:se:kth:diva-157975DOI: 10.1109/ChiCC.2014.6896851ScopusID: 2-s2.0-84907937944ISBN: 978-988156384-2OAI: oai:DiVA.org:kth-157975DiVA: diva2:774215
33rd Chinese Control Conference, CCC 2014, 28 July 2014 through 30 July 2014, Nanjing, China
QC 201412222014-12-222014-12-182014-12-22Bibliographically approved