scholarly journals Mean Square Consensus of Nonlinear Multi-Agent Systems under Markovian Impulsive Attacks

2021 ◽  
Vol 11 (9) ◽  
pp. 3926
Author(s):  
Huan Luo ◽  
Yinhe Wang ◽  
Xuexi Zhang ◽  
Peitao Gao ◽  
Haoxiang Wen
Keyword(s):  
Sufficient Conditions ◽  
System Stability ◽  
Consensus Problem ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Special Cases ◽  
Different Types ◽  
Multi Agent ◽  
Mean Square Consensus

This paper focuses primarily on the mean square consensus problem of a class of nonlinear multi-agent systems suffering from stochastic impulsive deception attacks. The attacks here are modeled by completely stochastic destabilizing impulses, where their gains and instants satisfy all distributions and the Markovian process. Compared with existing methods, which assume that only gains are stochastic, it is difficult to deal with systems with different types of random variables. Thus, estimating the influence of these different types on the consensus problem is a key point of this paper. Based on the properties of stochastic processes, some sufficient conditions to solve the consensus problem are derived and some special cases are considered. Finally, a numerical example is given to illustrate the main results. Our results show that the consensus can be obtained if impulsive attacks do not occur too frequently, and it can promote system stability if the gains are below the defined threshold.

scholarly journals Mean-square consensus of discrete-time multi-agent systems with Markovian switching topologies and persistent disturbances

2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772631 ◽  
Author(s):  
Lipo Mo ◽  
Yintao Wang ◽  
Tingting Pan ◽  
Yikang Yang
Keyword(s):  
Discrete Time ◽  
Sufficient Conditions ◽  
Markovian Switching ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Switching Topologies ◽  
Multi Agent ◽  
Persistent Disturbances ◽  
Mean Square Consensus

This article deals with the leader-following mean-square consensus problem of discrete-time general linear multi-agent systems with Markovian switching topologies and persistent disturbances. Assume that the communication topology is not connected at any time but the union topology is connected. First, the estimators are designed to calculate the states of agents when external disturbance not exists. Based on the error information between the truth-values and estimated-values of states, the compensators are proposed to subject to the effect of persistent disturbances. And then, a new mean-square consensus control protocol is proposed for each agent. Second, by using the property of permutation matrix, the original closed-loop system is transferred into an equivalent system. Third, sufficient conditions for mean-square consensus are obtained in the form of matrix inequalities. Finally, numerical simulations are given to illustrate the effectiveness of the theoretical results.

Mean Square Consensus Control for Second Order Multi-Agent Systems under Fixed Topologies and Measurement Noises

2011 ◽  
Vol 403-408 ◽  
pp. 4036-4043 ◽  
Author(s):  
Xue Liang Liu ◽  
Bu Gong Xu ◽  
Li Hua Xie
Keyword(s):  
Matrix Theory ◽  
Sufficient Conditions ◽  
Second Order ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Agent Systems ◽  
Multi Agent ◽  
Measurement Noises ◽  
Mean Square Consensus

This paper considers the mean square consensus problems for second order multi-agent systems with fixed topologies and measurement noises. Two cases were analyzed: 1) undirected networks with fixed topologies; 2) undirected networks with fixed topologies and measurement noises. In order to attenuate the measurement noises, a time-varying consensus gain was introduced in the consensus protocol. Sufficient conditions were derived for all agents to reach consensus in mean square via algebraic graph theory, matrix theory and stochastic analysis approach, by constructing an appropriate Lyapunov function. A numerical example was given to verify our theoretical analysis.

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.

scholarly journals Distributed Event-Triggered Consensus Control of Multi-Agent Systems under Denial-of-Service Jamming Attacks

2021 ◽  
Author(s):  
Mingyue Xiong ◽  
Xin Wang ◽  
Jun Cheng
Keyword(s):  
Denial Of Service ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Dos Attacks ◽  
Topological Graph ◽  
Jamming Attacks ◽  
Agent Systems ◽  
Multi Agent ◽  
Event Triggered

Abstract This work focuses on the consensus problem of multi-agent systems (MASs) under event-triggered control (ETC) subject to denial-of-service (DoS) jamming attacks. To reduce the cost of communication networks, a novel event-triggering mechanism (ETM) is applied to the sleeping interval to determine whether the sampled signal should be transmitted or not. Unlike periodic DoS attacks model, the DoS attacks occurrence are irregular, where attack attributes such as attack frequency and attack duration are taken into account. Moreover, compared with the fixed topological graph, the communication topologies may change due to DoS jamming attacks in this work. In view of this, based on the piecewise Lyapunov functional, sufficient conditions are derived to guarantee that consensus problem of the MASs can be solved. Finally, the effectiveness and correctness of the theoretical results are verified by a numerical example.

scholarly journals Consensus Analysis for High-Order Multi-Agent Systems without or with Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Zhengxin Wang ◽  
Yang Cao
Keyword(s):  
Partial Information ◽  
Sufficient Conditions ◽  
High Order ◽  
Consensus Problem ◽  
Multi Agent Systems ◽  
Consensus Protocol ◽  
Consensus Analysis ◽  
Agent Systems ◽  
Multi Agent ◽  
Necessary And Sufficient

This paper studies the consensus problem for a high-order multi-agent systems without or with delays. Consensus protocols, which only depend on the own partial information of agents and partial relative information with its neighbors, are proposed for consensus and quasi-consensus, respectively. Firstly, some lemmas are presented, and then a necessary and sufficient condition for guaranteeing the consensus is established under the consensus protocol without delays. Furthermore, communication delays are considered. Some necessary and sufficient conditions for solving quasi-consensus problem with delays are obtained. Finally, some simulations are given to verify the theoretical results.

Multi-Agent Consensus Control under Markovian Switching Topology and Time-Delay

2013 ◽  
Vol 427-429 ◽  
pp. 750-754
Author(s):  
Won Il Kim ◽  
Rong Xiong ◽  
Jun Wu
Keyword(s):  
Time Delay ◽  
Controller Design ◽  
Switching Topology ◽  
Linear Matrix ◽  
Time Varying ◽  
Mean Square ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Mean Square Consensus

In this note, the consensus problem of linear multi-agent systems with Markovian communication topology and time-varying delay is investigated. The topology of network is switched by Markovian process and the time-delay is considered to be time-varying and has a lower and upper bounds. A sufficient condition of mean square consensus is obtained in terms of linear matrix inequalities, and based on the condition, a controller design method is presented such that the multi-agent systems reaches to mean square consensus.

Sign in / Sign up

Export Citation Format

Share Document