scholarly journals Event-triggered bipartite consensus of multi-agent systems in signed networks

2022 ◽  
Vol 7 (4) ◽  
pp. 5499-5526
Author(s):  
Hongjie Li ◽  
Keyword(s):  
Sampling Period ◽  
Cooperative Interaction ◽  
Multi Agent Systems ◽  
Transmission Scheme ◽  
Signed Networks ◽  
Lur’E System ◽  
Agent Systems ◽  
Multi Agent ◽  
Bipartite Consensus ◽  
Event Triggered

<abstract><p>This paper focuses on the event-triggered bipartite consensus of multi-agent systems in signed networks, where the dynamics of each agent is assumed to be Lur'e system, and both the cooperative interaction and antagonistic interaction are allowed among neighbor agents. A novel event-triggered communication scheme is presented to save limited network resources, and distributed bipartite control techniques are raised to address the bipartite leaderless consensus and bipartite leader-following consensus respectively. By virtue of the Lyapunov stability theory and algebraic graph theory, bipartite consensus conditions are derived, which can be easily solved by MATLAB. In addition, the upper bounds of the sampling period and triggered parameter can be estimated. Finally, two examples are employed to show the validity and advantage of the proposed transmission scheme.</p></abstract>

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

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Cui-Qin Ma ◽  
Yun-Bo Zhao ◽  
Wei-Guo Sun
Keyword(s):  
Sufficient Conditions ◽  
Measurement Noise ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Negative Effects ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Multi Agent ◽  
Bipartite Consensus ◽  
Event Triggered

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, Ito^ 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.

Sign in / Sign up

Export Citation Format

Share Document