Distributed Consensus of Stochastic Delayed Multi-agent Systems Under Asynchronous Switching

Abstract

In this paper, the distributed exponential consensus of stochastic delayed multi-agent systems with nonlinear dynamics is investigated under asynchronous switching. The asynchronous switching considered here is to account for the time of identifying the active modes of multi-agent systems. After receipt of confirmation of mode's switching, the matched controller can be applied, which means that the switching time of the matched controller in each node usually lags behind that of system switching. In order to handle the coexistence of switched signals and stochastic disturbances, a comparison principle of stochastic switched delayed systems is first proved. By means of this extended comparison principle, several easy to verified conditions for the existence of an asynchronously switched distributed controller are derived such that stochastic delayed multi-agent systems with asynchronous switching and nonlinear dynamics can achieve global exponential consensus. Two examples are given to illustrate the effectiveness of the proposed method.

Fixed-Time Consensus Tracking for Multiagent Systems With High-Order Integrator Dynamics

“…As an important performance measure also for coordination control of multi-agent systems, fast convergence is always pursued to achieve better performance and robustness, such as hybrid formation flying [1], consensus subject to switching topology [2], [3]. For a linear consensus protocol proposed for single integrator multiagent systems, Olfati-Saber and Murray have demonstrated in [4] that the algebraic connectivity of an interaction graph, i.e., the second smallest eigenvalue of the graph Laplacian, qualified the convergence rate.…”

Stochastic synchronization of delayed multiagent networks with intermittent communications: An impulsive framework

“…Generally, a real system is usually affected by external perturbations, which in many cases, are of great uncertainties and hence may be treated as random, as fluctuations from the release of neurotransmitters, and other probabilistic causes. Therefore, it is reasonable to consider the effects of stochastic disturbances during the process of information transmission of multiagent networks linked by communication graphs …”

Consensus analysis for leader‐following multi‐agent systems with second‐order individual dynamics and arbitrary sampling

“…Consensus control, as one of the central problems in multi‐agent coordination, has attracted a great deal of attention of researchers . It deals with the problem of information sharing among individuals.…”

“…Different from the approach in , the work of this paper is based on a sampled‐data control. Compared with the existing work on sampled‐data distributed control (,), the effectiveness of our protocol is studied under the assumption of large sampling periods and arbitrary sampling in general weakly connected topologies. In other words, the studied protocol is robust against the changes of sampling periods and can be applied in constrained communication networks, for instance, in the presence of sampling jitter and packet loss.…”

“…In recent years, sampled-data control has emerged as an interesting topic in the distributed coordination because of the advances in computer and communication technologies. In the sampled-data framework, several results concerning collective behaviors, including consensus problems [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18], formation [19,20], flocking [21,22], and network synchronization problems [23][24][25], have been given in the literature.…”