Reach-avoid games for players with damped double integrator dynamics
This paper studies a reach-avoid game of two damped double integrator players. An attacker aims to reach a static target, while a faster defender tries to protect the target by intercepting the attacker before it reaches the target. In scenarios where the defender succeeds, the defender aims to maximize the attacker's final distance from the target, while the attacker aims to minimize it. This work focuses on determining the equilibrium strategy in the defender-winning scenarios. The optimal state feedback strategy is obtained by a differential game approach combining geometric analysis. We construct a multiple reachable region to analyse the damped double integrator player's motion under optimal strategy. Building on this, a new type of the attacker's dominance region is introduced for the first time. It is shown that different strategies are required when the terminal point lies in distinct areas of the attacker's dominance region. Then, a necessary condition is derived for the proposed strategy to be optimal using differential game approach. Furthermore, a case where both players start at rest is discussed, and some useful properties about the dominance region and the optimal strategy are presented. Simulations are conducted to show the effectiveness of the proposed strategy.
Code (0)
등록된 구현이 없습니다.
Similar 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 PlanningApproximate Solutions to a Class of Reachability Games
In this paper, we present a method for finding approximate Nash equilibria in a broad class of reachability games. These games are often used to formulate both collision avoidance and goal satisfaction. Our method is com…
Collision AvoidancePAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance
Reachability is the most fundamental logical objective, yet it is notoriously difficult to learn in reinforcement learning settings: even for Markov decision processes, PAC learning of reachability is impossible without …
Reinforcement LearningBidding Games on Markov Decision Processes with Quantitative Reachability Objectives
Graph games are fundamental in strategic reasoning of multi-agent systems and their environments. We study a new family of graph games which combine stochastic environmental uncertainties and auction-based interactions a…
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
Dynamic Epistemic Logic (DEL) is a logical framework in which one can describe in great detail how actions are perceived by the agents, and how they affect the world. DEL games were recently introduced as a way to define…