Game theory turns drone swarms into chase-evasion predators
New framework reveals when adversarial agents dominate, systems enter endless chase cycles...
Researchers Ruiming Zheng, Mohammad Pirani, and Davide Spinello from the University of Ottawa have formulated multi-agent area coverage control as a two-player zero-sum game between cooperative and adversarial agent groups. Traditional coverage control allocates resources based on a fixed environmental risk density field. Here they generalize it by allowing adversarial agents to dynamically generate the spatial risk field, linking both groups through the coverage metric that serves as the game reward. This induces coupled gradient-descent-ascent controllers.
Analysis of a low-dimensional case reveals a Hopf bifurcation dictated by the ratio of each group's control gains. In the adversarial-dominated regime, the system enters a periodic chase-evasion cycle; in the ordinary-agent regime it converges to a fixed configuration. Numerical simulations validate these insights. Under Nash equilibrium, ordinary agents converge to a generalized centroidal Voronoi tessellation, while adversarial agents settle at their own equilibrium centroids. The work has been submitted to IFAC and is available on arXiv.
- Models area coverage as a zero-sum game between cooperative and adversarial multi-agent systems
- Reveals a Hopf bifurcation: adversarial dominance leads to periodic chase-evasion cycles, ordinary dominance to fixed configurations
- Nash equilibrium yields generalized centroidal Voronoi tessellations for cooperative agents and equilibrium centroids for adversaries
Why It Matters
Enables strategic swarm deployment for security, surveillance, and defense scenarios where autonomous agents must counteract adversarial swarms.