Group-Bipartite Consensus in the Networks with Cooperative-Competitive Interactions

Liu, J; Li, H; Ji, J; Luo, J

Group-Bipartite Consensus in the Networks with Cooperative-Competitive Interactions

Liu, J Li, H Ji, J

Luo, J

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Transactions on Circuits and Systems II: Express Briefs, 2020, 67, (12), pp. 3292-3296
Issue Date:: 2020-12-01

Closed Access

	Filename	Description	Size
	09063653.pdf	Published version	426.27 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Liu, J
dc.contributor.author	Li, H
dc.contributor.author	Ji, J https://orcid.org/0000-0003-3280-5463
dc.contributor.author	Luo, J
dc.date.accessioned	2021-02-07T00:06:52Z
dc.date.available	2021-02-07T00:06:52Z
dc.date.issued	2020-12-01
dc.identifier.citation	IEEE Transactions on Circuits and Systems II: Express Briefs, 2020, 67, (12), pp. 3292-3296
dc.identifier.issn	1549-7747
dc.identifier.issn	1558-3791
dc.identifier.uri	http://hdl.handle.net/10453/145889
dc.description.abstract	© 2004-2012 IEEE. This brief addresses the group-bipartite consensus problem of multi-agent systems with cooperative-competitive interactions. By combining the characteristics of group consensus and bipartite consensus, the concept of group-bipartite consensus is introduced to specify multiple bipartite consensus behavior. A distributed control protocol is then proposed for the topology graphs with acyclic partition and sign-balanced couples. The network topology studied in this brief eliminates the constraint that negative links can only exist between different groups, and thus the weights between agents in the same group can be either positive or negative. Some necessary and sufficient conditions for solving group-bipartite consensus problems are established by constructing a new form of the Laplacian matrix associated with the directed communication graphs. A simulation example is given to validate the theoretical results.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE Transactions on Circuits and Systems II: Express Briefs
dc.relation.isbasedon	10.1109/TCSII.2020.2986258
dc.rights	© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0906 Electrical and Electronic Engineering
dc.subject.classification	Electrical & Electronic Engineering
dc.title	Group-Bipartite Consensus in the Networks with Cooperative-Competitive Interactions
dc.type	Journal Article
utslib.citation.volume	67
utslib.for	0906 Electrical and Electronic Engineering
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Mechanical and Mechatronic Engineering
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2021-02-07T00:06:33Z
pubs.issue	12
pubs.publication-status	Published
pubs.volume	67
utslib.citation.issue	12

Abstract:

© 2004-2012 IEEE. This brief addresses the group-bipartite consensus problem of multi-agent systems with cooperative-competitive interactions. By combining the characteristics of group consensus and bipartite consensus, the concept of group-bipartite consensus is introduced to specify multiple bipartite consensus behavior. A distributed control protocol is then proposed for the topology graphs with acyclic partition and sign-balanced couples. The network topology studied in this brief eliminates the constraint that negative links can only exist between different groups, and thus the weights between agents in the same group can be either positive or negative. Some necessary and sufficient conditions for solving group-bipartite consensus problems are established by constructing a new form of the Laplacian matrix associated with the directed communication graphs. A simulation example is given to validate the theoretical results.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/145889