Core Concepts
The author proposes multiplayer strategies to win reach-avoid games with polygonal obstacles, focusing on hierarchical optimal task allocation and pursuit winning regions.
Abstract
The paper discusses a multiplayer reach-avoid differential game involving pursuers protecting a region from evaders. Pursuit strategies are proposed based on Apollonius circles, convex goal-covering polygons, and Euclidean shortest paths. The goal is to maximize the number of defeated evaders through cooperative strategies.
Stats
Pursuers cooperate to protect a region from evaders.
Pursuit strategy involves Apollonius circles, convex polygons, and shortest paths.
Hierarchical task allocation maximizes defeated evaders.
Strategies ensure capture or delay of evaders reaching the protected region.
Convex goal-covering polygons guarantee consistent goal visibility.
Safe distance optimization ensures non-negative distances between regions.
Pursuit strategies aim to maintain consistent goal visibility for all players.