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

Learning-enabled stochastic predictive control for nonlinear discrete-time step backward high-order fully actuated systems

Author

Listed:
  • Chao Ning
  • Junhao Zhao
  • Han Wang

Abstract

In this paper, we seamlessly integrate machine learning techniques with stochastic Model Predictive Control (MPC) to address the regulation problem of nonlinear discrete-time step backward High-Order Fully Actuated (HOFA) systems with additive disturbance. By exploiting the full-actuation characteristic of the HOFA system, we neatly eliminate the non-linearity of the system, thus circumventing the complex computation of uncertainty propagation in nonlinear stochastic MPC. To cope with the random disturbance, its probability distribution on each principal component is well captured from data based on principal component analysis, and the uncertainty bound is effectively estimated via kernel density estimation and quantile functions. Based upon such probabilistic information, we impose constraint tightening on the state limits and define terminal sets by drawing on the concept of tubes. On this basis, we employ stochastic MPC for receding horizon control of HOFA systems, of which the recursive feasibility and stability are proved theoretically. Finally, numerical experiments and an application to hydrogen electrolyzer temperature control are used to demonstrate the merits of the proposed approach in comparison with state-of-the-art methods.

Suggested Citation

  • Chao Ning & Junhao Zhao & Han Wang, 2025. "Learning-enabled stochastic predictive control for nonlinear discrete-time step backward high-order fully actuated systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 56(10), pages 2431-2446, July.
  • Handle: RePEc:taf:tsysxx:v:56:y:2025:i:10:p:2431-2446
    DOI: 10.1080/00207721.2024.2448591
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2024.2448591?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:56:y:2025:i:10:p:2431-2446. 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.