Abstract
AbstractThis 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
