Fully Distributed Adaptive Finite-Time Consensus for Uncertain Nonlinear Multiagent Systems

Zhao, Le; Liu, Yungang; Li, Fengzhong; Man, Yongchao

doi:10.1109/tcyb.2020.3035752

Cited by 41 publications

(9 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…∑ N j=1 a ij sgn 0.5 (x i − x j ), ̇cij = a ij (x i − x j ) T (x i − x j ), i = 1, … , 4, ( F I G U R E 7 When noise intensity 𝜎 = 3, the edge-based finite-time adaptive consensus of nonlinear SMASs (17) under noise interference F I G U R E 8 Edge-based finite-time adaptive consensus of nonlinear SMASs (17) where c ij (0) ∈ [1,3] 17) under the consensus protocol (19) are shown in Figure 7, and the simulation of the finite-time consensus is shown in Figure 8.…”

Section: Simulation Examplesmentioning

confidence: 99%

“…[20][21][22] That is, the adaptive technology can automatically adjust the parameters of the protocols (controllers) to adapt to the changes of environmental conditions or process parameters by measuring the continuous information of the process state, so as to maintain the performance criteria required by the control systems. 19 Therefore, adaptive technology has distinct advantages in the cooperative control of MASs, which not only can make the consensus protocols more robust and flexible, but also can reduce or avoid vibration, undesirable distortion and environmental stochastic noise. 19,[23][24][25] Based on these advantages, Chen et al 26 proposed some fault-tolerant consensus protocols for MASs by using adaptive techniques.…”

Section: Introductionmentioning

confidence: 99%

“…19 Therefore, adaptive technology has distinct advantages in the cooperative control of MASs, which not only can make the consensus protocols more robust and flexible, but also can reduce or avoid vibration, undesirable distortion and environmental stochastic noise. 19,[23][24][25] Based on these advantages, Chen et al 26 proposed some fault-tolerant consensus protocols for MASs by using adaptive techniques. Meanwhile, Huang et al 27 and He et al 28 studied the consensus control of MASs with uncertain control directions and dynamic event-triggered strategies by adaptive techniques, respectively.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Finite‐time adaptive consensus of stochastic multi‐agent systems with node‐based and edge‐based adaptive law design methods

Xiao

Wang

Liao

2022

Adaptive Control & Signal

View full text Add to dashboard Cite

Summary This article investigates the finite‐time consensus control for stochastic multi‐agent systems (SMASs) by using adaptive techniques. First, we propose a finite‐time adaptive consensus protocol for SMASs with node‐based adaptive law design method. Second, a finite‐time adaptive consensus protocol is also proposed for SMASs by adding a dynamical scaling parameter to the weights on the edges of the communication graph. Finally, two simulation examples are provided to verify the effectiveness of the two consensus protocols.

show abstract

Section: Simulation Examplesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Finite‐time adaptive consensus of stochastic multi‐agent systems with node‐based and edge‐based adaptive law design methods

Xiao

Wang

Liao

2022

Adaptive Control & Signal

View full text Add to dashboard Cite

show abstract

“…Then, the finite time consensus comes into being. Compared with the asymptotic consensus, the convergence speed of the finite time consensus is obviously faster, which possesses stronger robustness and higher control precision [ 7 , 8 , 9 , 10 , 11 , 12 , 13 ]. However, the finite time consensus still has obvious limitations; that is, its convergence time is related to the initial values.…”

Section: Introductionmentioning

confidence: 99%

Fixed-Time Leader-Following Consensus Tracking Control for Nonliear Multi-Agent Systems under Jointly Connected Graph

Zhao

et al. 2022

Entropy

Self Cite

View full text Add to dashboard Cite

This paper researches the fixed-time leader-following consensus problem for nonlinear multi-agent systems (MASs) affected by unknown disturbances under the jointly connected graph. In order to achieve control goal, this paper designs a fixed-time consensus protocol, which can offset the unknown disturbances and the nonlinear item under the jointly connected graph, simultaneously. In this paper, the states of multiple followers can converge to the state of the leader within a fixed time regardless of the initial conditions rather than just converging to a small neighborhood near the leader state. Finally, a simulation example is given to illustrate the theoretical result.

show abstract

“…The dynamic evolution of such systems is closely related to the information transmission relationship among agents. In particular, the distributed controllability based on neighbors ensures that the network system has the ability to obtain behavior goals, such as consensus, formation control and stabilization [1][2][3][4][5], etc.…”

Section: Introductionmentioning

confidence: 99%

The Controllability and Strong Structural Controllability of Laplacian Dynamics

Liu

2021

2021 40th Chinese Control Conference (CCC)

Self Cite

View full text Add to dashboard Cite

In this paper, classic controllability and structural controllability under two protocols are investigated. For classic controllability, the multiplicity of eigenvalue zero of general Laplacian matrix L * is shown to be determined by the sum of the numbers of zero circles, identical nodes and opposite pairs, while it is always simple for the Laplacian L with diagonal entries in absolute form. For a fixed structurally balanced topology, the controllable subspace is proved to be invariant even if the antagonistic weights are selected differently under the corresponding protocol with L. For a graph expanded from a star graph rooted from a single leader, the dimension of controllable subspace is two under the protocol associated with L * . In addition, the system is structurally controllable under both protocols if and only if the topology without unaccessible nodes is connected. As a reinforcing case of structural controllability, strong structural controllability requires the system to be controllable for any choice of weights. The connection between father nodes and child nodes affects strong structural controllability because it determines the linear relationship of the control information from father nodes. This discovery is a major factor in establishing the sufficient conditions on strong structural controllability for multi-agent systems under both protocols, rather than for complex networks, about latter results are already abundant.

show abstract

Fully Distributed Adaptive Finite-Time Consensus for Uncertain Nonlinear Multiagent Systems

Cited by 41 publications

References 39 publications

Finite‐time adaptive consensus of stochastic multi‐agent systems with node‐based and edge‐based adaptive law design methods

Finite‐time adaptive consensus of stochastic multi‐agent systems with node‐based and edge‐based adaptive law design methods

Fixed-Time Leader-Following Consensus Tracking Control for Nonliear Multi-Agent Systems under Jointly Connected Graph

The Controllability and Strong Structural Controllability of Laplacian Dynamics

Contact Info

Product

Resources

About