IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v204y2025i3d10.1007_s10957-024-02572-6.html
   My bibliography  Save this article

$$H^\infty $$ H ∞ -Optimal Control via Game-Theoretic Differential Dynamic Programming and Gaussian Processes

Author

Listed:
  • Wei Sun

    (University of Oklahoma)

  • Theodore B. Trafalis

    (University of Oklahoma)

Abstract

In this paper, we present a nonlinear $$H^\infty $$ H ∞ -optimal control algorithm for a system whose dynamics can be described by the summation of two terms: a known function obtained from system modeling and an unknown function that represents the model error induced by the disturbance and the noise that are not captured by the original model. A Gaussian Process (GP) is utilized as an alternative to a supervised artificial neural network to update the nominal dynamics of the system and provide disturbance estimates based on data gathered through interaction with the system. A soft-constrained two-player zero-sum differential game that is equivalent to the disturbance attenuation problem in nonlinear $$H^\infty $$ H ∞ -optimal control is then formulated to synthesis the $$H^\infty $$ H ∞ controller. The differential game is solved through the Game-Theoretic Differential Dynamic Programming (GT-DDP) algorithm in continuous time. In addition we provide a proof of quadratic convergence of the proposed GT-DDP algorithm. Simulation results on a quadcopter system demonstrate the efficiency of the learning-based control algorithm in handling model uncertainties and external disturbances.

Suggested Citation

  • Wei Sun & Theodore B. Trafalis, 2025. "$$H^\infty $$ H ∞ -Optimal Control via Game-Theoretic Differential Dynamic Programming and Gaussian Processes," Journal of Optimization Theory and Applications, Springer, vol. 204(3), pages 1-20, March.
  • Handle: RePEc:spr:joptap:v:204:y:2025:i:3:d:10.1007_s10957-024-02572-6
    DOI: 10.1007/s10957-024-02572-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02572-6
    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/s10957-024-02572-6?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:joptap:v:204:y:2025:i:3:d:10.1007_s10957-024-02572-6. 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.