Computing and Estimating the Reaching Time of the Super-Twisting Algorithm

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The super-twisting algorithm is a second-order sliding-mode algorithm that may be used either for control or for observation purposes. An important performance characteristic of this algorithm is the so-called reaching or convergence time, the time it takes for the controller to reach the sliding surface or for the estimates to converge. In this chapter, three techniques are discussed to estimate, i.e., upper bound, and in some cases even compute this reaching time in the presence of additive perturbations, which are Hölder continuous in the state or Lipschitz continuous in the time. The first is obtained from an analytic computation of the unperturbed reaching time; the second is based on a family of quadratic Lyapunov functions; and the third is derived from a necessary and sufficient stability criterion. For each approach, the range of permissible perturbations, its asymptotic properties with respect to parameters and perturbation bounds, and, when applicable, the selection of parameters are discussed. Numerical comparisons illustrate the results obtained with each approach.

Original languageEnglish
Title of host publicationVariable-Structure Systems and Sliding-Mode Control
Subtitle of host publicationFrom Theory to Practice
PublisherSpringer International
Chapter3
Pages73-123
Number of pages51
ISBN (Electronic)978-3-030-36621-6
ISBN (Print)978-3-030-36620-9
DOIs
Publication statusPublished - 11 Feb 2020

Publication series

NameStudies in Systems, Decision and Control
Volume271
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Optimization
  • Decision Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Control and Systems Engineering
  • Automotive Engineering
  • Social Sciences (miscellaneous)

Fingerprint Dive into the research topics of 'Computing and Estimating the Reaching Time of the Super-Twisting Algorithm'. Together they form a unique fingerprint.

Cite this