IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v86y2023i3d10.1007_s10589-022-00398-4.html
   My bibliography  Save this article

Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC

Author

Listed:
  • Gabriele Eichfelder

    (Technische Universität Ilmenau)

  • Lars Grüne

    (Universität Bayreuth)

  • Lisa Krügel

    (Universität Bayreuth)

  • Jonas Schießl

    (Universität Bayreuth)

Abstract

We consider nonlinear model predictive control (MPC) with multiple competing cost functions. In each step of the scheme, a multiobjective optimal control problem with a nonlinear system and terminal conditions is solved. We propose an algorithm and give performance guarantees for the resulting MPC closed loop system. Thereby, we significantly simplify the assumptions made in the literature so far by assuming strict dissipativity and the existence of a compatible terminal cost for one of the competing objective functions only. We give conditions which ensure asymptotic stability of the closed loop and, what is more, obtain performance estimates for all cost criteria. Numerical simulations on various instances illustrate our findings. The proposed algorithm requires the selection of an efficient solution in each iteration, thus we examine several selection rules and their impact on the results. and we also examine numerically how different selection rules impact the results

Suggested Citation

  • Gabriele Eichfelder & Lars Grüne & Lisa Krügel & Jonas Schießl, 2023. "Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC," Computational Optimization and Applications, Springer, vol. 86(3), pages 1081-1116, December.
    • Handle: RePEc:spr:coopap:v:86:y:2023:i:3:d:10.1007_s10589-022-00398-4
    DOI: 10.1007/s10589-022-00398-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-022-00398-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-022-00398-4?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.

    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:spr:coopap:v:86:y:2023:i:3:d:10.1007_s10589-022-00398-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.