IDEAS home Printed from https://ideas.repec.org/a/hin/complx/7326157.html
   My bibliography  Save this article

Finite-Time Current Tracking in Boost Converters by Using a Saturated Super-Twisting Algorithm

Author

Listed:
  • Juan-Eduardo Velázquez-Velázquez
  • Rosalba Galván-Guerra
  • José-Antonio Ortega-Pérez
  • Yair Lozano-Hernández
  • Raúl Villafuerte-Segura

Abstract

The power converters are widely used in several industrial applications where it is necessary to obtain from a fixed voltage another one higher or lower than the original. In this paper, we focus on the DC-DC (direct current) boost converters, where to guarantee the desired voltage, an internal current tracking loop is usually used. However, this tracking cannot be assured in the presence of unknown load changes and external perturbations when traditional controller strategies are implemented. In this paper, an advanced control strategy is proposed to ensure the current tracking using a saturated super-twisting controller on the power converter. The finite-time current tracking of a DC-DC boost converter is assured in the presence of bounded Lipschitz perturbations composed by unknown load changes and exogenous signals. The proposed approach generates a continuous bounded control signal applied to the converter by using a sigma-delta modulator . The controller gains are tuned to obtain finite-time stabilization of the tracking error, while the control signal remains bounded. To illustrate the effectiveness of the proposed results, the controller is applied to a physical boost converter using the hardware implemented and an STM32 Discovery development card. Besides, the controller is compared with a first-order sliding mode controller showing that for small sample times, the energy of the error signal is reduced.

Suggested Citation

  • Juan-Eduardo Velázquez-Velázquez & Rosalba Galván-Guerra & José-Antonio Ortega-Pérez & Yair Lozano-Hernández & Raúl Villafuerte-Segura, 2020. "Finite-Time Current Tracking in Boost Converters by Using a Saturated Super-Twisting Algorithm," Complexity, Hindawi, vol. 2020, pages 1-16, October.
  • Handle: RePEc:hin:complx:7326157
    DOI: 10.1155/2020/7326157
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/7326157.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/8503/2020/7326157.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/7326157?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:7326157. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.