IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v77y2020i1d10.1007_s10589-020-00198-8.html
   My bibliography  Save this article

Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis

Author

Listed:
  • Nicolas Delanoue

    (LARIS, Université d’Angers)

  • Mehdi Lhommeau

    (LARIS, Université d’Angers)

  • Sébastien Lagrange

    (LARIS, Université d’Angers)

Abstract

This paper presents an approximation scheme for optimal control problems using finite-dimensional linear programs and interval analysis. This is done in two parts. Following Vinter approach (SIAM J Control Optim 31(2):518–538, 1993) and using occupation measures, the optimal control problem is written into a linear programming problem of infinite-dimension (weak formulation). Thanks to Interval arithmetic, we provide a relaxation of this infinite-dimensional linear programming problem by a finite dimensional linear programming problem. A proof that the optimal value of the finite dimensional linear programming problem is a lower bound to the optimal value of the control problem is given. Moreover, according to the fineness of the discretization and the size of the chosen test function family, obtained optimal values of each finite dimensional linear programming problem form a sequence of lower bounds which converges to the optimal value of the initial optimal control problem. Examples will illustrate the principle of the methodology.

Suggested Citation

  • Nicolas Delanoue & Mehdi Lhommeau & Sébastien Lagrange, 2020. "Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis," Computational Optimization and Applications, Springer, vol. 77(1), pages 307-334, September.
    • Handle: RePEc:spr:coopap:v:77:y:2020:i:1:d:10.1007_s10589-020-00198-8
    DOI: 10.1007/s10589-020-00198-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00198-8
    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-020-00198-8?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:77:y:2020:i:1:d:10.1007_s10589-020-00198-8. 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.