Consensus Protocol Design for Leader-Following Multi-Agent Systems With Stochastic Sampling Information

2020 ◽  
Vol 143 (2) ◽  
Author(s):  
K. Subramanian ◽  
P. Muthukumar

Abstract This paper studies a consensus protocol design for leader-following multi-agent systems (MASs) via stochastic sampling information. Unlike traditional sampled-data control, this paper is focused on the stochastically varying sample intervals with a given probability by the Bernoulli distribution. Based on the Lyapunov–Krasovskii functional and reciprocally convex technique, the sufficient conditions are derived for the stochastic sampled-data protocol design of the error system, which guarantees that the following agent's states can reach an agreement on the leader's state. Finally, the numerical examples are provided to demonstrate the effectiveness of the developed theoretical results.

2011 ◽  
Vol 5 (14) ◽  
pp. 1658-1665 ◽  
Author(s):  
Z.-J. Tang ◽  
T.-Z. Huang ◽  
J.-L. Shao ◽  
J.-P. Hu

Author(s):  
Qiaoping Li ◽  
Chao Yue

By designing a novel combined event-triggered control technique, this article analytically studies the distributed leader-following consensus problem of nonlinear fractional chaotic multi-agent systems. First, a novel combined event-triggered mechanism which takes into account both the relative error and the absolute error of the samples is proposed, under which each follower agent executes control update independently at its own event times. Next, a fully distributed event-triggered consensus protocol is designed and the sufficient conditions of consensus are attained. Finally, compared with other event-triggered mechanisms, the simulation experiments illustrate that the event-based consensus protocol proposed in this article can effectively reduce the frequency of actuator data update while ensuring desired consensus performance.


2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
Cui-Qin Ma ◽  
Yun-Bo Zhao ◽  
Wei-Guo Sun

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