Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs

Meng, Deyuan; Du, Mingjun; Jia, Yingmin

doi:10.1109/tac.2016.2528539

Cited by 311 publications

(115 citation statements)

References 30 publications

Supporting

Mentioning

114

Contrasting

Order By: Relevance

“…Recently, many new consensus problems have emerged, such as group consensus and scaled consensus, etc. In the problem of scaled consensus, which was proposed by Roy, each agent has a unique scale that is independent of other agents'.…”

Section: Introductionmentioning

confidence: 99%

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Cheng

Zhou

Bai

et al. 2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper investigates the distributed scaled consensus problem of multiple agents with high‐order dynamics under the asynchronous setting, where each agent measures the neighbors' information at certain discrete time instants according to its own clock rather than the whole discrete process and all agents' clocks are independent of each other. Assume that the communication topology can be arbitrarily switched and the information transfer between agents has a time‐varying delay. Under the designed asynchronous distributed control protocol, it is shown that the agents with the same scale will reach a common final state, while the agents with different scales will reach different final states. Moreover, an effective parameters selection strategy is presented for a large number of gain parameters in high‐order multiagent systems based on novel model transformation techniques. Simulation examples are provided to demonstrate the high‐order scaled consensus performances for the agents in the presence of asynchronous setting.

show abstract

Section: Introductionmentioning

confidence: 99%

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Cheng

Zhou

Bai

et al. 2019

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

show abstract

“…It is well known that, for multiagent systems over nonnegative graphs, a fundamental collective behavior is consensus, which implies that states of all agents will eventually converge to the same value . For multiagent systems over signed graphs, due to the antagonistic interactions, some new collective behaviors emerge, such as bipartite consensus, sign consensus, fragmentation, and interval bipartite consensus . An earlier work on multiagent systems over signed graphs was reported by Altafini, which studies bipartite consensus problem of single integrator dynamics.…”

Section: Introductionmentioning

confidence: 99%

“…When the graph is not structurally balanced, using certain control laws, the multiagent system might exhibit interval bipartite consensus, trivial consensus, or sign consensus . Since structurally unbalanced graph is a huge class of graph topologies, it will be more useful and interesting to investigate collective behaviors over some specific subclasses of signed graphs, among which is the class of eventually positive signed graphs …”

Section: Introductionmentioning

confidence: 99%

Sign‐consensus over cooperative‐antagonistic networks with switching topologies

Jiang

Zhang

Chen

2018

Intl J Robust & Nonlinear

View full text Add to dashboard Cite

Summary This paper studies sign consensus, a collective behavior of multiagent systems, when both cooperative and antagonistic interactions coexist among agents. By sign consensus, it means that the states of all agents will eventually achieve the same sign but may with different magnitudes. Compared with some recent works on sign‐consensus problems, where only fixed graphs are considered and the graph adjacency matrix needs to be eventually positive, this paper allows the graph to be switching over time. Control laws are proposed and analyzed with respect to three classes of switching graphs. Examples illustrate the efficacy of the control algorithms.

show abstract

“…However, it is very natural to see, in many real examples, that in MASs some agents cooperate while others compete, and MASs with competitive interactions can introduce more complex behaviors. To quantitatively model such a scenario, the concept of bipartite consensus, i.e., agents agree on a certain quantity with the equal modulus but different signs, has been proposed [9], and many achievements have been made [9][10][11][12][13][14][15][16][17][18]. In [9], for singleintegrator MASs, a linear feedback protocol is designed and under the assumption that the communication topology G is strongly connected, the MAS is proved to achieve bipartite consensus if and only if G is structurally balanced.…”

Section: Introductionmentioning

confidence: 99%

Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise

Zhao

Sun

2018

Journal of Control Science and Engineering

View full text Add to dashboard Cite

Event-triggered bipartite consensus of single-integrator multi-agent systems is investigated in the presence of measurement noise. A time-varying gain function is proposed in the event-triggered bipartite consensus protocol to reduce the negative effects of the noise corrupted information processed by the agents. Using the state transition matrix, Itô formula, and the algebraic graph theory, necessary and sufficient conditions are given for the proposed protocol to yield mean square bipartite consensus. We find that the weakest communication requirement to ensure the mean square bipartite consensus under event-triggered protocol is that the signed digraph is structurally balanced and contains a spanning tree. Numerical examples validated the theoretical findings where the system shows no Zeno behavior.

show abstract

Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs

Cited by 311 publications

References 30 publications

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Scaled consensus for asynchronous high‐order discrete‐time multiagent systems

Sign‐consensus over cooperative‐antagonistic networks with switching topologies

Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise

Contact Info

Product

Resources

About