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.

scholarly journals Mean Square Stability of Impulsive Stochastic Differential Systems

2011 ◽  
Vol 2011 ◽  
pp. 1-13 ◽  
Author(s):  
Shujie Yang ◽  
Bao Shi ◽  
Mo Li
Keyword(s):  
Stochastic Analysis ◽  
Functional Method ◽  
Stochastic Equations ◽  
Mean Square ◽  
Differential Systems ◽  
Numerical Examples ◽  
Mean Square Stability ◽  
Analysis Theory ◽  
Delay Dependent ◽  
Theoretical Results

Based on Lyapunov-Krasovskii functional method and stochastic analysis theory, we obtain some new delay-dependent criteria ensuring mean square stability of a class of impulsive stochastic equations. Numerical examples are given to illustrate the effectiveness of the theoretical results.

scholarly journals Consensus of Multiagent Systems with Sampled Information and Noisy Measurements

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Zhao-Jun Tang ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao
Keyword(s):  
Multiagent Systems ◽  
Directed Network ◽  
First Order ◽  
Network Topologies ◽  
Strong Consensus ◽  
Measurement Noises ◽  
Simulation Results ◽  
Approximation Type ◽  
Noisy Measurements ◽  
Theoretical Results

We consider consensus problems of first-order multiagent systems with sampled information and noisy measurements. A distributed stochastic approximation type algorithm is employed to attenuate the measurement noises. We provide conditions under which almost sure strong consensus is guaranteed for fixed and switching directed network topologies. Simulation results are provided to illustrate the theoretical results.

scholarly journals Containment Control of Multiagent Systems with Multiple Leaders and Noisy Measurements

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Zhao-Jun Tang ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao
Keyword(s):  
Convex Hull ◽  
Multiagent Systems ◽  
Stochastic Approximation ◽  
Mean Square ◽  
Containment Control ◽  
Simulation Results ◽  
Approximation Type ◽  
Noisy Measurements ◽  
Multiple Leaders ◽  
Theoretical Results

We consider the distributed containment control of multiagent systems with multiple stationary leaders and noisy measurements. A stochastic approximation type and consensus-like algorithm is proposed to solve the containment control problem. We provide conditions under which all the followers can converge both almost surely and in mean square to the stationary convex hull spanned by the leaders. Simulation results are provided to illustrate 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.

Multiconsensus of first-order multiagent systems with directed topologies

2020 ◽  
Vol 34 (23) ◽  
pp. 2050240
Author(s):  
Xiao-Wen Zhao ◽  
Guangsong Han ◽  
Qiang Lai ◽  
Dandan Yue
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sufficient Conditions ◽  
Consensus Problem ◽  
Multiple Agents ◽  
First Order ◽  
The Matrix ◽  
Directed Topologies ◽  
Necessary And Sufficient ◽  
Theoretical Results

The multiconsensus problem of first-order multiagent systems with directed topologies is studied. A novel consensus problem is introduced in multiagent systems — multiconsensus. The states of multiple agents in each subnetwork asymptotically converge to an individual consistent value in the presence of information exchanges among subnetworks. Linear multiconsensus protocols are proposed to solve the multiconsensus problem, and the matrix corresponding to the protocol is designed. Necessary and sufficient conditions are derived based on matrix theory, under which the stationary multiconsensus and dynamic multiconsensus can be reached. Simulations are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Group Consensus with a Dynamic Leader for Multiagent Systems via Sampled-Data Control

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Hong Xia ◽  
Ting-Zhu Huang ◽  
Jin-Liang Shao ◽  
Jun-Yan Yu
Keyword(s):  
Multiagent Systems ◽  
Matrix Theory ◽  
Sampling Period ◽  
Group Consensus ◽  
Sampled Data ◽  
Ultimate Boundedness ◽  
Tracking Errors ◽  
Data Control ◽  
Sampled Data Control ◽  
Theoretical Results

This paper considers a group consensus problem with a dynamic leader for multiagent systems in a sampled-data setting. With the leader’s state available to only a fraction of the followers, a distributed linear protocol based on sampled-data control is proposed for group consensus under fixed directed topology. On basis ofM-matrix theory, we derive a sufficient condition on the sampling period and the control parameter for ultimate boundedness of the tracking errors. Furthermore, simulation examples are provided to demonstrate the effectiveness of the theoretical results.

scholarly journals Complete Periodic Synchronization of Memristor-Based Neural Networks with Time-Varying Delays

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Huaiqin Wu ◽  
Luying Zhang ◽  
Sanbo Ding ◽  
Xueqing Guo ◽  
Lingling Wang
Keyword(s):  
Neural Networks ◽  
Periodic Solution ◽  
Matrix Theory ◽  
Adaptive Controller ◽  
Network System ◽  
Time Varying ◽  
State Dependent ◽  
Coincidence Theorem ◽  
Error System ◽  
Theoretical Results

This paper investigates the complete periodic synchronization of memristor-based neural networks with time-varying delays. Firstly, under the framework of Filippov solutions, by usingM-matrix theory and the Mawhin-like coincidence theorem in set-valued analysis, the existence of the periodic solution for the network system is proved. Secondly, complete periodic synchronization is considered for memristor-based neural networks. According to the state-dependent switching feature of the memristor, the error system is divided into four cases. Adaptive controller is designed such that the considered model can realize global asymptotical synchronization. Finally, an illustrative example is given to demonstrate the validity of the theoretical results.

scholarly journals Effects of Time-Varying Impulses on the Synchronization of Delayed Dynamical Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Shuiming Cai ◽  
Peipei Zhou ◽  
Zengrong Liu
Keyword(s):  
Network Model ◽  
Comparison Principle ◽  
Network Topology ◽  
Spanning Tree ◽  
Time Varying ◽  
Dynamical Networks ◽  
Numerical Examples ◽  
General Complex ◽  
Delayed Dynamical Networks ◽  
Theoretical Results

The effects of time-varying impulses on the synchronization of a class of general complex delayed dynamical networks are investigated. Different from the existing works, the impulses discussed here are time-varying, and both synchronizing and desynchronizing impulses are considered in the network model simultaneously. Moreover, the network topology is assumed to be directed and weakly connected with a spanning tree. By using the comparison principle, some simple yet generic globally exponential synchronization criteria are derived. It is shown that besides impulse strengths and impulsive interval, the obtained criteria are also closely related with topology structure of the network. Finally, numerical examples are given to demonstrate the effectiveness of the theoretical results.

Sign in / Sign up

Export Citation Format

Share Document