Premium
Continuous Fixed‐Time Convergent Super‐Twisting Algorithm in Case of Unknown State and Disturbance Initial Conditions
Author(s) -
Basin Michael,
RodriguezRamirez Pablo,
GarzaAlonso Alison
Publication year - 2019
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.1924
Subject(s) - convergence (economics) , mathematics , bounded function , control theory (sociology) , settling time , disturbance (geology) , multivariable calculus , scalar (mathematics) , constant (computer programming) , extension (predicate logic) , algorithm , control (management) , computer science , mathematical analysis , geometry , engineering , control engineering , artificial intelligence , paleontology , biology , economics , step response , programming language , economic growth
This paper presents a fixed‐time convergent super‐twisting‐like algorithm designed to provide a direct extension, without any additional terms, of the conventional super‐twisting control system, whose state initial condition is unknown and the disturbance initial condition is bounded by a known constant or even completely unknown. The fixed‐time convergent super‐twisting‐like algorithm is first designed for a scalar system and then generalized to a multivariable one. An upper estimate of its convergence (settling) time is calculated in each case. Several examples are provided to illustrate the obtained theoretical results.