IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v55y2024i14p2933-2951.html
   My bibliography  Save this article

Infinite-time robust optimal output tracking of continuous-time linear systems using undiscounted reinforcement learning

Author

Listed:
  • Ali Amirparast
  • S. Kamal Hosseini Sani

Abstract

This research paper focuses on addressing the challenge of infinite-time linear quadratic tracking control (LQT) for linear systems with parametric uncertainty. Traditional solutions to the LQT problem often involve using a discount factor to prevent the cost function from growing unbounded over time. However, this approach can introduce instability in the closed-loop system. To overcome this issue, this paper proposes an alternative approach using an undiscounted cost function that ensures the asymptotic stability of the uncertain closed-loop system. To design a control scheme without requiring precise knowledge of the system dynamics, reinforcement learning (RL) algorithms are employed. However, for systems with uncertain parameters that may lead to instability, the convergence of RL algorithms to a stabilising solution is not guaranteed. To address this limitation, a robust optimal control structure is developed using on-policy and off-policy reinforcement learning algorithms, resulting in a model-free controller. The effectiveness of the proposed robust optimal controller is validated through comparative simulations on an uncertain model of a DC–DC buck converter connected to a constant power load. These simulations demonstrate the advantages and benefits of the robust optimal controller in handling parametric uncertainty and ensuring stability in the control system.

Suggested Citation

  • Ali Amirparast & S. Kamal Hosseini Sani, 2024. "Infinite-time robust optimal output tracking of continuous-time linear systems using undiscounted reinforcement learning," International Journal of Systems Science, Taylor & Francis Journals, vol. 55(14), pages 2933-2951, October.
  • Handle: RePEc:taf:tsysxx:v:55:y:2024:i:14:p:2933-2951
    DOI: 10.1080/00207721.2024.2364289
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2024.2364289
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2024.2364289?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tsysxx:v:55:y:2024:i:14:p:2933-2951. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.