Discrete-time equivalents of the super-twisting algorithm

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Abstract

In this paper, entirely new discrete-time variants of the super-twisting algorithm are presented. The development of these discrete-time equivalents is based on certain criteria, e.g., the approximation of the continuous-time super-twisting algorithm as the discretization time tends to zero. In contrast to the classical explicit Euler discretized super-twisting dynamics, the proposed schemes are exact in the sense that in the unperturbed case, the controllers ensure local convergence to the origin. Oscillations of the system states caused by the discrete-time implementation of the super-twisting algorithm are avoided. The superiority of the developed control laws is demonstrated in simulation examples as well as in a real-world application. These examples reveal that the standard accuracy of the homogeneous second-order sliding mode is preserved and, in contrast to the explicit Euler discretized algorithm, in the presence of exact discrete measurements, the precision of the controlled variable is insensitive to oversized control gains.
Originalspracheenglisch
Seiten (von - bis)190
Seitenumfang199
FachzeitschriftAutomatica
Jahrgang107
DOIs
PublikationsstatusVeröffentlicht - 2019

Fingerprint

Gain control
Controllers

Dies zitieren

Discrete-time equivalents of the super-twisting algorithm. / Koch, Stefan; Reichhartinger, Markus.

in: Automatica, Jahrgang 107, 2019, S. 190.

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

@article{345f45cc2cb146b58d2a4aeb96e31764,
title = "Discrete-time equivalents of the super-twisting algorithm",
abstract = "In this paper, entirely new discrete-time variants of the super-twisting algorithm are presented. The development of these discrete-time equivalents is based on certain criteria, e.g., the approximation of the continuous-time super-twisting algorithm as the discretization time tends to zero. In contrast to the classical explicit Euler discretized super-twisting dynamics, the proposed schemes are exact in the sense that in the unperturbed case, the controllers ensure local convergence to the origin. Oscillations of the system states caused by the discrete-time implementation of the super-twisting algorithm are avoided. The superiority of the developed control laws is demonstrated in simulation examples as well as in a real-world application. These examples reveal that the standard accuracy of the homogeneous second-order sliding mode is preserved and, in contrast to the explicit Euler discretized algorithm, in the presence of exact discrete measurements, the precision of the controlled variable is insensitive to oversized control gains.",
author = "Stefan Koch and Markus Reichhartinger",
year = "2019",
doi = "https://doi.org/10.1016/j.automatica.2019.05.040.",
language = "English",
volume = "107",
pages = "190",
journal = "Automatica",
issn = "0005-1098",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Discrete-time equivalents of the super-twisting algorithm

AU - Koch, Stefan

AU - Reichhartinger, Markus

PY - 2019

Y1 - 2019

N2 - In this paper, entirely new discrete-time variants of the super-twisting algorithm are presented. The development of these discrete-time equivalents is based on certain criteria, e.g., the approximation of the continuous-time super-twisting algorithm as the discretization time tends to zero. In contrast to the classical explicit Euler discretized super-twisting dynamics, the proposed schemes are exact in the sense that in the unperturbed case, the controllers ensure local convergence to the origin. Oscillations of the system states caused by the discrete-time implementation of the super-twisting algorithm are avoided. The superiority of the developed control laws is demonstrated in simulation examples as well as in a real-world application. These examples reveal that the standard accuracy of the homogeneous second-order sliding mode is preserved and, in contrast to the explicit Euler discretized algorithm, in the presence of exact discrete measurements, the precision of the controlled variable is insensitive to oversized control gains.

AB - In this paper, entirely new discrete-time variants of the super-twisting algorithm are presented. The development of these discrete-time equivalents is based on certain criteria, e.g., the approximation of the continuous-time super-twisting algorithm as the discretization time tends to zero. In contrast to the classical explicit Euler discretized super-twisting dynamics, the proposed schemes are exact in the sense that in the unperturbed case, the controllers ensure local convergence to the origin. Oscillations of the system states caused by the discrete-time implementation of the super-twisting algorithm are avoided. The superiority of the developed control laws is demonstrated in simulation examples as well as in a real-world application. These examples reveal that the standard accuracy of the homogeneous second-order sliding mode is preserved and, in contrast to the explicit Euler discretized algorithm, in the presence of exact discrete measurements, the precision of the controlled variable is insensitive to oversized control gains.

U2 - https://doi.org/10.1016/j.automatica.2019.05.040.

DO - https://doi.org/10.1016/j.automatica.2019.05.040.

M3 - Article

VL - 107

SP - 190

JO - Automatica

JF - Automatica

SN - 0005-1098

ER -