Related papers: Optimal Evasion from a Sensing-Limited Pursuer

This paper studies optimal communication and coordination strategies in cyber-physical systems for both defender and attacker within a game-theoretic framework. We model the communication network of a cyber-physical system as a sensor…

With the increasing use of robots in daily life, there is a growing need to provide robust collaboration protocols for robots to tackle more complicated and dynamic problems effectively. This paper presents a novel, factor graph-based…

We model and analyze a herding problem, where the drivers try to steer the evaders' trajectories while the evaders always move away from the drivers. This problem is motivated by the guidance-by-repulsion model [Escobedo, R., Iba\~nez, A.…

We consider a two player game, where a first player has to install a surveillance system within an admissible region. The second player needs to enter the the monitored area, visit a target region, and then leave the area, while minimizing…

Solutions to pursuit-evasion and surveillance-evasion differential games are typically computed and expressed using open-loop representations, with the synthesis of feedback strategies significantly less common. We propose a numerical…

We consider a hide-and-seek game between a Hider and a Seeker over a finite set of locations. The Hider chooses one location to conceal a stationary treasure, while the Seeker visits the locations sequentially along a route. As the search…

This paper proposes a new perspective on the conventional planar target tracking problem. One evader and one pursuer are considered in the dynamics. In the planar tracking, pursuer has the ability to measure the position and the velocity…

Partial monitoring is an expressive framework for sequential decision-making with an abundance of applications, including graph-structured and dueling bandits, dynamic pricing and transductive feedback models. We survey and extend recent…

Pursuing a drifting target in a turbulent flow is an extremely difficult task whenever the searcher has limited propulsion and maneuvering capabilities. Even in the case when the relative distance between pursuer and target stays below the…

In this paper, an optimal control problem is considered where a target vehicle aims to reach a desired location in minimum time while avoiding a dynamic engagement zone. Using simple motion, four potential approaches are considered. First,…

We study the trajectory optimization problem under chance constraints for continuous-time stochastic systems. To address chance constraints imposed on the entire stochastic trajectory, we propose a framework based on the set erosion…

The perimeter defense game has received interest in recent years as a variant of the pursuit-evasion game. A number of previous works have solved this game to obtain the optimal strategies for defender and intruder, but the derived theory…

We consider a pursuit-evasion game [11] played between two agents, 'Blue' (the pursuer) and 'Red' (the evader), over $T$ time steps. Red aims to attack Blue's territory. Blue's objective is to intercept Red by time $T$ and thereby limit the…

This paper addresses a critical aerial defense challenge in contested airspace, involving three autonomous aerial vehicles -- a hostile drone (the pursuer), a high-value drone (the evader), and a protective drone (the defender). We present…

We present a method for pursuit/evasion that is highly efficient and and scales to large teams of aircraft. The underlying algorithm is an efficient algorithm for solving Markov Decision Processes (MDPs) that supports fully continuous state…

Self-avoidance is a common mechanism to improve the efficiency of a random walker for covering a spatial domain. However, how this efficiency decreases when self-avoidance is impaired or limited by other processes has remained largely…

Suppose that in a given planar circular region, there are some smart mobile evaders and we would like to find them using sweeping agents. We assume that each agent has a line sensor of length 2r. We propose procedures for designing…

We present a numerical approach to finding optimal trajectories for players in a multi-body, asset-guarding game with nonlinear dynamics and non-convex constraints. Using the Iterative Best Response (IBR) scheme, we solve for each player's…

The timing of strategic exit is one of the most important but difficult business decisions, especially under competition and uncertainty. Motivated by this problem, we examine a stochastic game of exit in which players are uncertain about…

We consider linear search for an escaping target whose speed and initial position are unknown to the searcher. A searcher (an autonomous mobile agent) is initially placed at the origin of the real line and can move with maximum speed $1$ in…