.png){kind=icon}
Return
On Multivariable Super-Twisting Algorithm Reaching Time Assessment
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2024.3407018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article provides an linear matrix inequality (LMI)-based procedure for reaching time estimation of the multivariable super-twisting algorithm dealing with convex bounded parameter uncertainty and exogenous disturbances with norm-bounded time-derivative. For a class of Lyapunov functions, we are able to determine the optimal reaching time estimation that emerges from the solution of a surprisingly simple mathematical programming problem. As far as the reaching time estimation and validation are concerned the worst input disturbance, related to the considered class of Lyapunov function, is fully characterized. The impact of the theoretical results is discussed by means of illustrative examples borrowed from the literature.
Keywords:
Estimation
Lyapunov methods
Symmetric matrices
Upper bound
Closed loop systems
Uncertainty
Eigenvalues and eigenfunctions
Finite-time convergence
multivariable super twisting algorithm (MSTA)
reaching time estimation
robustness
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more