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

Finite-horizon differential games for missile–target interception system using adaptive dynamic programming with input constraints

Author

Listed:
  • Jingliang Sun
  • Chunsheng Liu

Abstract

In this paper, the problem of intercepting a manoeuvring target within a fixed final time is posed in a non-linear constrained zero-sum differential game framework. The Nash equilibrium solution is found by solving the finite-horizon constrained differential game problem via adaptive dynamic programming technique. Besides, a suitable non-quadratic functional is utilised to encode the control constraints into a differential game problem. The single critic network with constant weights and time-varying activation functions is constructed to approximate the solution of associated time-varying Hamilton–Jacobi–Isaacs equation online. To properly satisfy the terminal constraint, an additional error term is incorporated in a novel weight-updating law such that the terminal constraint error is also minimised over time. By utilising Lyapunov's direct method, the closed-loop differential game system and the estimation weight error of the critic network are proved to be uniformly ultimately bounded. Finally, the effectiveness of the proposed method is demonstrated by using a simple non-linear system and a non-linear missile–target interception system, assuming first-order dynamics for the interceptor and target.

Suggested Citation

  • Jingliang Sun & Chunsheng Liu, 2018. "Finite-horizon differential games for missile–target interception system using adaptive dynamic programming with input constraints," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(2), pages 264-283, January.
  • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:2:p:264-283
    DOI: 10.1080/00207721.2017.1401153
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2017.1401153?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:49:y:2018:i:2:p:264-283. 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.