IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v79y2009i5p1452-1471.html
   My bibliography  Save this article

Robust constrained receding-horizon predictive control via bounded data uncertainties

Author

Listed:
  • Ramos, C.
  • Martínez, M.
  • Sanchis, J.
  • Salcedo, J.V.

Abstract

The main objective of this work consists of obtaining a new robust and stable Model Predictive Control (MPC). One widely used technique for improving robustness in MPC consists of the Min–Max optimization, where an analogy can be established with the Bounded Data Uncertainties (BDU) method. The BDU is a regularization technique for least-squares problems by taking into account the uncertainty bounds. So BDU both improves robustness in MPC and offers a guided way of tuning the empirically tuned penalization parameter for the control effort in MPC due to the duality that the parameter coincides with the regularization one in BDU. On the other hand, the stability objective is achieved by the use of terminal constraints, in particular the Constrained Receding-Horizon Predictive Control (CRHPC) algorithm, so the original CRHPC–BDU controller is stated, which presents a better performance from the point of view of robustness and stability than a standard MPC.

Suggested Citation

  • Ramos, C. & Martínez, M. & Sanchis, J. & Salcedo, J.V., 2009. "Robust constrained receding-horizon predictive control via bounded data uncertainties," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(5), pages 1452-1471.
    • Handle: RePEc:eee:matcom:v:79:y:2009:i:5:p:1452-1471
    DOI: 10.1016/j.matcom.2008.06.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475408002310
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2008.06.002?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:matcom:v:79:y:2009:i:5:p:1452-1471. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.