Toward Rapid and Optimal Strategy for Swarm Conflict: A Computational Game Approach

2024/02/02 by Tao Zhang, Yiji Zhu, Zhu Yiji +3
Engineering · Computer Science · #Military Defense Systems Analysis #Guidance and Control Systems #Distributed Control Multi-Agent Systems

paper · doi:10.1109/taes.2024.3361436

Abstract

The decision and control problem for swarm operations is crucial for autonomous military conflict management. In this paper, the underlying decision and control problem is treated as a non-cooperative game problem, in which the underlying target assignment problem is generalized to be a graph-theoretic problem. We introduce an algorithm to seek the desired Nash equilibrium with the help of the parallel maximum weight matching algorithm. Then, we prove that the proposed solution is <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">ε</tex-math></inline-formula> -Nash with guaranteed computational efficiency, and is well suited for the swarm conflict. Simulation results verified the effectiveness of the proposed solutions.

Citations

• Game-theoretic modeling and control of a military air operation

Related

• Nash equilibrium seeking in coalition games for multiple Euler-Lagrange systems: Analysis and application to USV swarm confrontation
• A Scalable Reinforcement Learning Approach for Attack Allocation in Swarm to Swarm Engagement Problems
• Scalable Planning and Learning Framework Development for Swarm-to-Swarm Engagement Problems
• Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning
• A consensus-based algorithm for non-convex multiplayer games