IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v15y2024i5p33-d1493244.html
   My bibliography  Save this article

A Solution to Dynamic Weapon Assignment Problem Based on Game Theory for Naval Platforms

Author

Listed:
  • Oğuzkan Akbel

    (Electrical-Electronics Engineering Department, Faculty of Engineering, Ankara University, 06830 Ankara, Turkey)

  • Aykut Kalaycıoğlu

    (Electrical-Electronics Engineering Department, Faculty of Engineering, Ankara University, 06830 Ankara, Turkey)

Abstract

Weapon target assignment is a critical challenge in military contexts. Traditionally, commanding officers manually decide weapon assignments, but the problem’s complexity has grown over time. To address this, automated systems have been introduced. These systems fall into two categories, which are static (time-independent) and dynamic (considering changes over time). Static systems solve the problem for a single time step without considering temporal changes. Dynamic systems incorporate time as a variable, adapting to evolving scenarios. Two main approaches exist, which are asset-based and target-based. Asset-based approach maximizes the survival probability of assets, which is our focus in this study. We propose a solution using game theory that spans the entire area and all time frames. We employ game theory, treating continuous functions of time as utility functions for vessels. Continuous probability-to-kill values for weapons are defined across the area. Threat trajectories yield continuous kill probabilities for the weapons, translating to vessel utility. To avoid inefficiencies, we align individual vessel utility with global utility. The Nash Equilibrium provides the optimal weapon assignment strategy. Our study uses a naval environment for analysis. In summary, our research leverages game theory to dynamically assign weapons to naval vessels, aiming to maximize asset survival.

Suggested Citation

  • Oğuzkan Akbel & Aykut Kalaycıoğlu, 2024. "A Solution to Dynamic Weapon Assignment Problem Based on Game Theory for Naval Platforms," Games, MDPI, vol. 15(5), pages 1-16, October.
  • Handle: RePEc:gam:jgames:v:15:y:2024:i:5:p:33-:d:1493244
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/15/5/33/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2073-4336/15/5/33/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kevin Glazebrook & Alan Washburn, 2004. "Shoot-Look-Shoot: A Review and Extension," Operations Research, INFORMS, vol. 52(3), pages 454-463, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahmet Silav & Esra Karasakal & Orhan Karasakal, 2022. "Bi-objective dynamic weapon-target assignment problem with stability measure," Annals of Operations Research, Springer, vol. 311(2), pages 1229-1247, April.
    2. Lu, Yiping & Chen, Danny Z., 2021. "A new exact algorithm for the Weapon-Target Assignment problem," Omega, Elsevier, vol. 98(C).
    3. Gregory Levitin & Kjell Hausken, 2012. "Resource Distribution in Multiple Attacks with Imperfect Detection of the Attack Outcome," Risk Analysis, John Wiley & Sons, vol. 32(2), pages 304-318, February.
    4. Gregory Levitin & Kjell Hausken, 2010. "Resource Distribution in Multiple Attacks Against a Single Target," Risk Analysis, John Wiley & Sons, vol. 30(8), pages 1231-1239, August.
    5. K. D. Glazebrook & C. Kirkbride & H. M. Mitchell & D. P. Gaver & P. A. Jacobs, 2007. "Index Policies for Shooting Problems," Operations Research, INFORMS, vol. 55(4), pages 769-781, August.
    6. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.

    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:gam:jgames:v:15:y:2024:i:5:p:33-:d:1493244. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.