scholarly journals Multiagent Consensus Control under Network-Induced Constraints

2013 ◽  
Vol 2013 ◽  
pp. 1-4
Author(s):  
Won Il Kim ◽  
Rong Xiong ◽  
Qiuguo Zhu ◽  
Jun Wu
Keyword(s):  
Multiagent Systems ◽  
Information Exchange ◽  
Design Procedure ◽  
Mean Square ◽  
Markov Jump ◽  
Consensus Control ◽  
Markov Jump System ◽  
System Method ◽  
Necessary And Sufficient ◽  
Mean Square Consensus

Mean consensus problem is studied using a class of discrete time multiagent systems in which information exchange is subjected to some network-induced constraints. These constraints include package dropout, time delay, and package disorder. Using Markov jump system method, the necessary and sufficient condition of mean square consensus is obtained and a design procedure is presented such that multiagent systems reach mean square consensus.

Stability Analysis for Discrete-Time Markov Jump System

2012 ◽  
Vol 249-250 ◽  
pp. 1224-1227
Author(s):  
Ming Wei Li ◽  
Yi Chen ◽  
Xiao Han Zhang
Keyword(s):  
Linear Systems ◽  
Data Packet ◽  
Linear Matrix ◽  
Packet Dropout ◽  
Mean Square ◽  
Markov Jump ◽  
Jump Linear Systems ◽  
Data Packet Dropout ◽  
Markov Jump System ◽  
Markov Jump Linear Systems

Network control systems (NCSs) where the problems of data packet dropout induced by communication channel is studied in this paper. We model the data packet dropout a Markov Jump Linear systems and introduce a freedom matrix. Our goal is to find a controller such that the Markov Jump Linear systems mean square stable. According to linear matrix inequalities (LMI), we can get the sufficient condition on the mean square stabilization of NCSs. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed approach.

scholarly journals Construction of Adaptive Consensus Gains for Multiagent Systems with Multiplicative Noise

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Shoubo Jin ◽  
Qiuju Yu
Keyword(s):  
Time Delay ◽  
Multiagent Systems ◽  
Directed Graph ◽  
Multiplicative Noise ◽  
Communication Delay ◽  
Mean Square ◽  
Inaccurate Information ◽  
Leader Following ◽  
The Mean ◽  
Mean Square Consensus

The leader-following consensus of linear multiagent systems with multiplicative noise and adaptive gains is investigated under the fixed directed graph. Because of multiplicative noise, the agents interacting with the leader can only obtain the inaccurate information. Firstly, this paper designs the adaptive gains of multiagent systems, which can converge to some fixed values and force the states to synchronize. Different from the mandatory gains, the adaptive gains depend on the states of agents and can be adjusted with the change of states. Secondly, it is shown that the multiagent systems without time delay can obtain mean square consensus under the adaptive gains. Moreover, in the presence of multiplicative noise and communication delay, the mean square consensus is also acquired in the same adaptive gains. Finally, the validity of the conclusion is simulated by an example.

scholarly journals Dynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Wen-Min Zhou ◽  
Jiang-Wen Xiao
Keyword(s):  
Multiagent Systems ◽  
Information Exchange ◽  
Matrix Theory ◽  
Weighted Graph ◽  
General Linear ◽  
Packet Dropout ◽  
Consensus Problem ◽  
Mean Square ◽  
Consensus Protocol ◽  
Random Packet Dropout

This paper is concerned with the consensus problem of general linear discrete-time multiagent systems (MASs) with random packet dropout that happens during information exchange between agents. The packet dropout phenomenon is characterized as being a Bernoulli random process. A distributed consensus protocol with weighted graph is proposed to address the packet dropout phenomenon. Through introducing a new disagreement vector, a new framework is established to solve the consensus problem. Based on the control theory, the perturbation argument, and the matrix theory, the necessary and sufficient condition for MASs to reach mean-square consensus is derived in terms of stability of an array of low-dimensional matrices. Moreover, mean-square consensusable conditions with regard to network topology and agent dynamic structure are also provided. Finally, the effectiveness of the theoretical results is demonstrated through an illustrative example.

scholarly journals Distributed Consensus of Semi-Markovian Jumping Multiagent Systems with Mode-Dependent Topologies

2018 ◽  
Vol 2018 ◽  
pp. 1-7
Author(s):  
Yidao Ji
Keyword(s):  
Multiagent Systems ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Mean Square ◽  
Sampled Data ◽  
Distributed Consensus ◽  
Consensus Protocol ◽  
Markov Jump ◽  
Markovian Jumping ◽  
Mean Square Stability

This paper investigates the distributed consensus problem of multiagent systems with semi-Markovian jumping dynamics in the mean-square sense. Moreover, the mode-dependent communication topologies and sampled-data consensus protocol over the networks are considered. By semi-Markov jump theory, the consensus problem is first transformed into a mean-square stability problem. Then, sufficient conditions are established with the designed mode-dependent consensus protocol. Finally, a numerical example is provided for verifying the effectiveness of our theoretical results.

scholarly journals Mean Square Consensus for Uncertain Multiagent Systems with Noises and Delays

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Yuangong Sun
Keyword(s):  
Multiagent Systems ◽  
Stochastic Analysis ◽  
Matrix Theory ◽  
Time Varying ◽  
Mean Square ◽  
Numerical Examples ◽  
Measurement Noises ◽  
Approximation Type ◽  
Theoretical Results ◽  
Mean Square Consensus

This paper investigates the consensus problem in mean square for uncertain multiagent systems with stochastic measurement noises and symmetric or asymmetric time-varying delays. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the convergence of a class of distributed stochastic approximation type protocols with time-varying consensus gains. Numerical examples are also given to illustrate the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document