IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/183401.html
   My bibliography  Save this article

A Case Study on Air Combat Decision Using Approximated Dynamic Programming

Author

Listed:
  • Yaofei Ma
  • Xiaole Ma
  • Xiao Song

Abstract

As a continuous state space problem, air combat is difficult to be resolved by traditional dynamic programming (DP) with discretized state space. The approximated dynamic programming (ADP) approach is studied in this paper to build a high performance decision model for air combat in 1 versus 1 scenario, in which the iterative process for policy improvement is replaced by mass sampling from history trajectories and utility function approximating, leading to high efficiency on policy improvement eventually. A continuous reward function is also constructed to better guide the plane to find its way to “winner” state from any initial situation. According to our experiments, the plane is more offensive when following policy derived from ADP approach other than the baseline Min-Max policy, in which the “time to win” is reduced greatly but the cumulated probability of being killed by enemy is higher. The reason is analyzed in this paper.

Suggested Citation

  • Yaofei Ma & Xiaole Ma & Xiao Song, 2014. "A Case Study on Air Combat Decision Using Approximated Dynamic Programming," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-10, September.
    • Handle: RePEc:hin:jnlmpe:183401
    DOI: 10.1155/2014/183401
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/183401.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/183401.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/183401?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
    ---><---

    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:hin:jnlmpe:183401. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.