Multiplayer Reach-Avoid Games via Pairwise Outcomes
From MaRDI portal
Abstract: A multiplayer reach-avoid game is a differential game between an attacking team with NA attackers and a defending team with ND defenders playing on a compact domain with obstacles. The attacking team aims to send M of the NA attackers to some target location, while the defending team aims to prevent that by capturing attackers or indefinitely delaying attackers from reaching the target. Although the analysis of this game plays an important role in many applications, the optimal solution to this game is computationally intractable when NA>1 or ND>1. In this paper, we present two approaches for the NA=ND=1 case to determine pairwise outcomes, and a graph theoretic maximum matching approach to merge these pairwise outcomes for an NA,ND>1 solution that provides guarantees on the performance of the defending team. We will show that the four-dimensional Hamilton-Jacobi-Isaacs approach allows for real-time updates to the maximum matching, and that the two-dimensional "path defense" approach is considerably more scalable with the number of players while maintaining defender performance guarantees.
Cited in
(30)- Efficient path planning algorithms in reach-avoid problems
- The complete differential game of active target defense
- A review of multi agent perimeter defense games
- Game value for a pursuit-evasion differential game problem in a Hilbert space
- Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games
- Pursuit differential game of many pursuers with integral constraints on compact convex set
- Pursuit in the presence of a defender
- Cooperative target protection from a superior attacker
- Approximate optimal influence over an agent through an uncertain interaction dynamic
- Optimal strategy analysis for adversarial differential games
- Deep reinforcement learning for swarm systems
- Optimal strategies for the lifeline differential game with limited lifetime
- Cooperative strategies for two-evader-one-pursuer reach-avoid differential games
- Multiplayer Bandits Without Observing Collision Information
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
- Streamlining variational inference for constraint satisfaction problems
- Optimal strategies for large-scale pursuers against one evader: a mean field game-based hierarchical control approach
- On two problems of pursuit of a group of evaders in differential games with fractional derivatives
- Double capture of coordinated evaders in recurrent differential games
- Multiplayer homicidal chauffeur reach-avoid games: a pursuit enclosure function approach
- Reach-avoid games with two heterogeneous defenders and one attacker
- A collision-free pursuit-evasion framework for indirect herding and formation control of noncooperative UAVs
- One superior pursuer and multiple-evader differential games with two lifelines
- A target defence-intrusion game with considering the obstructive effect of target
- Defending a city from multi-drone attacks: a sequential Stackelberg security games approach
- On a problem of evasion by a group of coordinated evaders
- A geometric approach to reach-avoid games with time limits
- A time advantage function-based solution to two-player circular target defense games
- Multi-defender capture-the-flag game with convex target regions
- Competitive perimeter defense in linear environments
This page was built for publication: Multiplayer Reach-Avoid Games via Pairwise Outcomes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282394)
