IEEE Transactions on Automatic Control· 2012Q1
Strict Lyapunov Functions for the Super-Twisting Algorithm
- 1,301citations
- Q1SCImago
- 2012year
Short summary
A new method constructs strict Lyapunov functions for the super-twisting algorithm, guaranteeing finite-time convergence and enhanced robustness to perturbations.
AI-generated from the title and abstract; the full text is not read.
Key points
- Developed a method to construct strict Lyapunov functions for the super-twisting algorithm.
- These functions guarantee finite-time convergence and estimate convergence time.
- The approach enhances robustness to a wider range of perturbations.
- Lyapunov functions and their derivatives are quadratic forms, simplifying operations.
AI-generated from the title and abstract; the full text is not read.
Abstract
A method to construct a family of strict Lyapunov functions, i.e., with negative definite derivative, for the super-twisting algorithm, without or with perturbations, is provided. This second order sliding modes algorithm is widely used to design controllers, observers and exact differentiators. The proposed Lyapunov functions ascertain finite time convergence, provide an estimate of the convergence time, and ensure the robustness of the finite-time or ultimate boundedness for a class of perturbations wider than the classical ones for this algorithm. Since the Lyapunov functions and their derivatives are quadratic forms, the operation with them is as simple as for linear time invariant systems.
The authors' abstract, as published at the source. IEEE Transactions on Automatic Control, 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Control and Systems Engineering
Control and Systems EngineeringEngineering