Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/16694
| Title: | Dynamic Assignment Strategies for Multi-Agent Target Defense Differential Games |
| Authors: | Soni, Harsh Tiwari, Shubhneet Arunaditya Dash, P. Singh, Sharad Kumar |
| Keywords: | Game Theory;Multi-agent Systems;Pursuit-evasion Games;Target-defense Differential Games;Combinatorial Optimization;Computation Theory;Computational Methods;Continuous Time Systems;Intelligent Agents;Multi Agent Systems;Network Security;Active Targets;Assignment Strategies;Continuous-time Dynamics;Differential Games;Dynamic Assignment;Multi Agent;Multiagent Systems (mass);Pursuit/evasion Games;Real Time Strategies;Target-defense Differential Game;Game Theory |
| Issue Date: | 2025 |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Citation: | Soni, H., Tiwari, S., Arunaditya Dash, P., & Singh, S. K. (2025). Dynamic Assignment Strategies for Multi-Agent Target Defense Differential Games. 5766–5772. https://doi.org/10.1109/CCDC65474.2025.11090729 |
| Abstract: | This paper addresses dynamic assignment strategies in multi-agent Target-Attacker-Defender (TAD) differential games, involving an active target, M attackers, and N defenders. These games are challenging due to their continuous-time dynamics and the need for real-time strategy adaptation in complex, interdependent environments. Traditional static assignment methods often result in suboptimal defense outcomes due to their inability to adapt to evolving game states. To address this, we propose a novel dynamic agent allocation strategy that continuously reassigns defenders to attackers in real time, maximizing the likelihood of successful target defense. Our approach combines Linear Quadratic Differential Games (LQDG) with a recedinghorizon framework, enhancing defender coordination and effectiveness. We demonstrate significant improvements over static methods in dynamic, multi-agent defense scenarios. Furthermore, we analyze cases where M = N, M>N, and M<N, comparing the performance of the proposed algorithm under these conditions through simulation results. © 2025 Elsevier B.V., All rights reserved. |
| URI: | https://dx.doi.org/10.1109/CCDC65474.2025.11090729 https://dspace.iiti.ac.in:8080/jspui/handle/123456789/16694 |
| ISBN: | 979-8331510565 |
| Type of Material: | Conference Paper |
| Appears in Collections: | Department of Electrical Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: