Multi-Agent Reach-Avoid Games: Two Attackers Versus One Defender and Mixed Integer Programming
We propose a hybrid approach that combines Hamilton-Jacobi (HJ) reachability and mixed-integer optimization for solving a reach-avoid game with multiple attackers and defenders. The reach-avoid game is an important problem with potential applications in air traffic control and multi-agent motion planning; however, solving this game for many attackers and defenders is intractable due to the adversarial nature of the agents and the high problem dimensionality. In this paper, we first propose an HJ reachability-based method for solving the reach-avoid game in which 2 attackers are playing against 1 defender; we derive the numerically convergent optimal winning sets for the two sides in environments with obstacles. Utilizing this result and previous results for the 1 vs. 1 game, we further propose solving the general multi-agent reach-avoid game by determining the defender assignments that can maximize the number of attackers captured via a Mixed Integer Program (MIP). Our method generalizes previous state-of-the-art results and is especially useful when there are fewer defenders than attackers. We validate our theoretical results in numerical simulations.
Code (1)
Tasks
Motion PlanningSimilar Papers 제목 키워드 기반
Back to the Future: Efficient, Time-Consistent Solutions in Reach-Avoid Games
We study the class of reach-avoid dynamic games in which multiple agents interact noncooperatively, and each wishes to satisfy a distinct target criterion while avoiding a failure criterion. Reach-avoid games are commonl…
Motion PlanningTowards Type Agnostic Cyber Defense Agents
With computing now ubiquitous across government, industry, and education, cybersecurity has become a critical component for every organization on the planet. Due to this ubiquity of computing, cyber threats have continue…
reinforcement-learningReinforcement LearningConvex-Concave Zero-Sum Stochastic Stackelberg Games
Zero-sum stochastic Stackelberg games can be used to model a large class of problems, ranging from economics to human robot interaction. In this paper, we develop policy gradient methods to solve these games from noisy g…
Reach-Avoid Differential game with Reachability Analysis for UAVs: A decomposition approach
Reach-avoid (RA) games have significant applications in security and defense, particularly for unmanned aerial vehicles (UAVs). These problems are inherently challenging due to the need to consider obstacles, consider th…
Dimensionality ReductionSA-IGA: A Multiagent Reinforcement Learning Method Towards Socially Optimal Outcomes
In multiagent environments, the capability of learning is important for an agent to behave appropriately in face of unknown opponents and dynamic environment. From the system designer's perspective, it is desirable if th…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)