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

Efficient algorithms for online tracking of set points in robust model predictive control

Author

Listed:
  • M. Razi
  • M. Haeri

Abstract

This paper presents some computationally efficient algorithms for online tracking of set points in robust model predictive control context subject to state and input constraints. The nonlinear systems are represented by a linear model along with an additive nonlinear term which is locally Lipschitz. As an unstructured uncertainty, this term is replaced in the robust stability constraint by its Lipschitz coefficient. A scheduled control technique is employed to transfer the system to desired set points, given online, by designing local robust model predictive controllers. This scheme includes estimating the regions of feasibility and stability of the related equilibriums and online switching among the local controllers. The proposed optimisation problems for calculating the regions of feasibility and stability are defined as linear matrix inequalities that can be solved in polynomial time. The effectiveness of the proposed algorithms is illustrated by an example.

Suggested Citation

  • M. Razi & M. Haeri, 2017. "Efficient algorithms for online tracking of set points in robust model predictive control," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(8), pages 1635-1645, June.
  • Handle: RePEc:taf:tsysxx:v:48:y:2017:i:8:p:1635-1645
    DOI: 10.1080/00207721.2017.1280551
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2017.1280551?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:48:y:2017:i:8:p:1635-1645. 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.