Couple-group consensus of multi-agent systems in the cooperation-competition network

Hu, Hong-Xiang; Yu, Wenwu; Wen, Guanghui; Qin, Guozheng; Cheng, Quanxin

doi:10.1109/chicc.2016.7554679

Cited by 2 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But most researchers focus on the Multi-agent system that there is only cooperation between agents, but in practice there is not only cooperation between agents, but also competition between them. In [8] , the competition relation is studied for the first time, and the concept of bidirectional consistency is put forward.In reference [9] , the coupling group consensus problem of dynamic agents in cooperative-competitive networks is studied. In practical applications, because of the limitation of bandwidth and the precision of data transmission, it is important to quantify the data in the measurement and transmission.…”

Section: Introductionmentioning

confidence: 99%

Bidirectional consistency of multi-agent based on data-driven

Cui

Zhao

et al. 2023

Third International Conference on Digital Signal and Computer Communications (DSCC 2023)

View full text Add to dashboard Cite

For the nonlinear discrete-time Multi-agent system of unknown dynamic models, there are cooperation and competition between agents, and the problem of data quantification in communication, a model-free adaptive iterative control (MFAILC) algorithm is proposed. First, the method of compact form dynamic linearization (CFDL) is used to transform the agent system into a model with time-varying parameters, and the quantizer is applied to quantize the data in the process of processing, and the cooperation-competition relationship between multi-agents is considered in algebraic graph theory, on this basis, the MFAILC control algorithm is designed and the convergence of the proposed algorithm is proved. Finally, the simulation results verify the effectiveness of the proposed algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

Bidirectional consistency of multi-agent based on data-driven

Cui

Zhao

et al. 2023

Third International Conference on Digital Signal and Computer Communications (DSCC 2023)

View full text Add to dashboard Cite

show abstract

“…Related work on group and cluster synchronization of networks has been carried out in [14][15][16][17] . Much of the current research into group consensus [18][19][20][21] assumes a balanced adjacency graph between groups, that is, the sum of inter-cluster connections sum to zero. Also, the groups, or clusters, of nodes that reach consensus with each other are defined on the network with a typical requirement being that each group satisfies some structural property, notably without exploiting any inherent graphical properties of the network.…”

Section: Introductionmentioning

confidence: 99%

Symmetry induced group consensus

Klickstein

Pecora

Sorrentino

2019

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

There has been substantial work studying consensus problems for which there is a single common final state, although there are many real-world complex networks for which the complete consensus may be undesirable. More recently, the concept of group consensus whereby subsets of nodes are chosen to reach a common final state distinct from others has been developed, but the methods tend to be independent of the underlying network topology. Here, an alternative type of group consensus is achieved for which nodes that are symmetric achieve a common final state. The dynamic behavior may be distinct between nodes that are not symmetric. We show how group consensus for heterogeneous linear agents can be achieved via a simple coupling protocol that exploits the topology of the network. We see that group consensus is possible on both stable and unstable trajectories.We observe and characterize the phenomenon of isolated group consensus, where one or more clusters may achieve group consensus while the other clusters do not.Consensus problems are an important topic when designing control protocols for distributed systems where it is desirable for uniform behavior between nodes like power generators in the grid, mobile robots, or autonomous vehicles. Sometimes though, complete consensus is not the desired behavior, but rather group consensus whereby some nodes' behaviors will coincide while others do not. This problem has been tackled previously using linear matrix inequalities (LMIs) or Lyapunov functions but the result can only guarantee complete consensus. We instead present a method derived using the automorphism group of the underlying graph which provides more granular information that splits the dynamics of consensus motion from different types of orthogonal, cluster breaking motion.

show abstract

Couple-group consensus of multi-agent systems in the cooperation-competition network

Cited by 2 publications

References 27 publications

Bidirectional consistency of multi-agent based on data-driven

Bidirectional consistency of multi-agent based on data-driven

Symmetry induced group consensus

Contact Info

Product

Resources

About