.png){kind=icon}
Return
Consensus for constrained multi-agent systems with input saturation
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.3480.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The consensus problem for multi-agent systems with input saturation is addressed in this paper. For agents with double-integrator dynamics, we first propose two consensus algorithms, respectively, for the cases with and without velocity measurements. Based on graph theory, homogeneous method and the Lyapunov stability theory, it is proved that the proposed algorithms can guarantee not only the state agreement in finite time for all the agents but also the input saturation requirement. Then, the obtained results and techniques are extended to the finite-time consensus problem for multiple mechanical systems. Numerical simulations are finally provided to verify the effectiveness of the theoretical results. Copyright (c) 2015 John Wiley & Sons, Ltd.
Keywords:
finite-time consensus
multi-agent systems
input saturation
velocity measurements
Euler-Lagrange dynamics
Journal
IF:
3.2
Papers:
7.0K
Citations:
1.4W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveDistributed adaptive coordination for multiple Lagrangian systems under a directed graph without using neighbors' velocity information.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSave
View more