Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Abstract

The super-twisting algorithm is a second order sliding mode control law commonly used for robust control and observation. One of its key properties is the finite time it takes to reach the sliding surface. Using Lyapunov theory, upper bounds for this reaching time may be found. This contribution considers the problem of finding the best bound that may be obtained using a family of quadratic Lyapunov functions. An optimization problem for finding this bound is derived, whose solution may be obtained using semidefinite programming. It is shown that the restrictions imposed on the perturbations and the conservativeness of the obtained bound are significantly reduced compared to existing results from literature.
Originalspracheenglisch
Seiten (von - bis)924-929
FachzeitschriftIEEE Control Systems Letters
Jahrgang3
Ausgabenummer4
DOIs
PublikationsstatusVeröffentlicht - 2019
Veranstaltung58th Conference on Decision and Control - Nice, Frankreich
Dauer: 11 Dez 201913 Dez 2019

Fingerprint

Sliding mode control
Lyapunov functions
Robust control

Schlagwörter

    ASJC Scopus subject areas

    • !!Control and Optimization
    • !!Control and Systems Engineering

    Dies zitieren

    Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm. / Seeber, Richard; Horn, Martin.

    in: IEEE Control Systems Letters, Jahrgang 3, Nr. 4, 2019, S. 924-929.

    Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

    @article{bedf468d6042465a9c34bde1a504c0c8,
    title = "Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm",
    abstract = "The super-twisting algorithm is a second order sliding mode control law commonly used for robust control and observation. One of its key properties is the finite time it takes to reach the sliding surface. Using Lyapunov theory, upper bounds for this reaching time may be found. This contribution considers the problem of finding the best bound that may be obtained using a family of quadratic Lyapunov functions. An optimization problem for finding this bound is derived, whose solution may be obtained using semidefinite programming. It is shown that the restrictions imposed on the perturbations and the conservativeness of the obtained bound are significantly reduced compared to existing results from literature.",
    keywords = "Sliding mode control, Convergence time, Lyapunov functions, Optimisation, Linear matrix inequalities, optimization, convergence time, LMIs, Variable-structure/sliding-mode control",
    author = "Richard Seeber and Martin Horn",
    year = "2019",
    doi = "10.1109/LCSYS.2019.2920163",
    language = "English",
    volume = "3",
    pages = "924--929",
    journal = "IEEE Control Systems Letters",
    issn = "2475-1456",
    publisher = "IEEE Control Systems Society",
    number = "4",

    }

    TY - JOUR

    T1 - Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm

    AU - Seeber, Richard

    AU - Horn, Martin

    PY - 2019

    Y1 - 2019

    N2 - The super-twisting algorithm is a second order sliding mode control law commonly used for robust control and observation. One of its key properties is the finite time it takes to reach the sliding surface. Using Lyapunov theory, upper bounds for this reaching time may be found. This contribution considers the problem of finding the best bound that may be obtained using a family of quadratic Lyapunov functions. An optimization problem for finding this bound is derived, whose solution may be obtained using semidefinite programming. It is shown that the restrictions imposed on the perturbations and the conservativeness of the obtained bound are significantly reduced compared to existing results from literature.

    AB - The super-twisting algorithm is a second order sliding mode control law commonly used for robust control and observation. One of its key properties is the finite time it takes to reach the sliding surface. Using Lyapunov theory, upper bounds for this reaching time may be found. This contribution considers the problem of finding the best bound that may be obtained using a family of quadratic Lyapunov functions. An optimization problem for finding this bound is derived, whose solution may be obtained using semidefinite programming. It is shown that the restrictions imposed on the perturbations and the conservativeness of the obtained bound are significantly reduced compared to existing results from literature.

    KW - Sliding mode control

    KW - Convergence time

    KW - Lyapunov functions

    KW - Optimisation

    KW - Linear matrix inequalities

    KW - optimization

    KW - convergence time

    KW - LMIs

    KW - Variable-structure/sliding-mode control

    UR - http://www.scopus.com/inward/record.url?scp=85067336564&partnerID=8YFLogxK

    U2 - 10.1109/LCSYS.2019.2920163

    DO - 10.1109/LCSYS.2019.2920163

    M3 - Article

    VL - 3

    SP - 924

    EP - 929

    JO - IEEE Control Systems Letters

    JF - IEEE Control Systems Letters

    SN - 2475-1456

    IS - 4

    ER -