2020
DOI: 10.1007/978-981-15-8613-2_2
|View full text |Cite
|
Sign up to set email alerts
|

A Lyapunov based Saturated Super-Twisting Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Notice that the flexibility of the Lyapunov approach allows the development of control algorithms to solve more particular problems. For saturated nonlinear systems, the work in [17] proposed a strong Lyapunov function to deal with the saturated super-twisting algorithm. Moreover, the implicit Lyapunov function methodology has also been applied to prove finite, and even more, fixed-time stability using the concept of homogeneity [18][19][20].…”
Section: Introduction 1motivationmentioning
confidence: 99%
“…Notice that the flexibility of the Lyapunov approach allows the development of control algorithms to solve more particular problems. For saturated nonlinear systems, the work in [17] proposed a strong Lyapunov function to deal with the saturated super-twisting algorithm. Moreover, the implicit Lyapunov function methodology has also been applied to prove finite, and even more, fixed-time stability using the concept of homogeneity [18][19][20].…”
Section: Introduction 1motivationmentioning
confidence: 99%