Related papers: Planar Herding of Multiple Evaders with a Single H…
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 multi-robot multi-target tracking, robots coordinate to monitor groups of targets moving about an environment. We approach planning for such scenarios by formulating a receding-horizon, multi-robot sensing problem with a mutual…
We describe and analyze a generalization of the classic ``Four Bugs on a Square'' cyclic pursuit problem. Instead of allowing the bugs to spiral towards one another, we constrain $N$ bugs to the perimeter of the unit circle. Depending on…
Ecology and evolution are inherently linked, and studying a mathematical model that considers both holds promise of insightful discoveries related to the dynamics of cooperation. In the present article, we use the prisoner's dilemma (PD)…
This paper presents a game-theoretic path-following formulation where the opponent is an adversary road model. This formulation allows us to compute safe sets using tools from viability theory, that can be used as terminal constraints in an…
We consider a class of pursuit-evasion problems where an evader enters a directed acyclic graph and attempts to reach one of the terminal nodes. A pursuer enters the graph at a later time and attempts to capture the evader before it reaches…
We study the spreading of families in two-dimensional multispecies predator-prey systems, in which species cyclically dominate each other. In each time step randomly chosen individuals invade one of the nearest sites of the square lattice…
We report in experiment and simulation the spontaneous formation of dynamically bound pairs of shape changing smarticle robots undergoing locally repulsive collisions. Borrowing terminology from Conway's simulated Game of Life, these…
We present a safe-by-design approach to path planning and control for nonlinear systems. The planner uses a low fidelity model of the plant to compute reference trajectories by solving an MPC problem, while the plant being controlled…
In this paper, two cooperative guidance laws based on two-point boundary value are designed to deal with the problem of cooperative encirclement and simultaneous attack under condition of both known target acceleration and unknown target…
We address the problem of optimal evasion in a planar endgame engagement, where a target with bounded lateral acceleration seeks to avoid interception by a missile guided by a linear feedback law. Contrary to existing approaches, that…
We consider the trajectory replanning problem for a large-scale swarm in a cluttered environment. Our path planner replans for robots by utilizing a hierarchical approach, dividing the workspace, and computing collision-free paths for…
Observational learning often involves congestion: an agent gets lower payoff from an action when more predecessors have taken that action. This preference to act differently from previous agents may paradoxically increase all but one…
We consider a class of pursuit-evasion differential games in which the evader has continuous access to the pursuer's location, but not vice-versa. There is an immobile sensor (e.g., a ground radar station) that can sense the evader's…
In this paper, a pursuit-evasion game of two players known as the game of two identical cars is examined. It is assumed that the game proceeds on a two-dimensional plane. Both players have constant speeds and limited turn radii. The goal of…
As a simple model for criminal behavior, the traditional two-strategy inspection game yields counterintuitive results that fail to describe empirical data. The latter shows that crime is often recurrent, and that crime rates do not respond…
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and robber move along edges of G. The cop number of G is the minimum number of cops that is sufficient to catch…
We study the survival of a prey that is hunted by N predators. The predators perform independent random walks on a square lattice with V sites and start a direct chase whenever the prey appears within their sighting range. The prey is…
We propose an efficient motion planning method designed to efficiently find collision-free trajectories for multiple manipulators. While multi-manipulator systems offer significant advantages, coordinating their motions is computationally…
Evolutionary $2 \times 2$ games are studied with players located on a square lattice. During the evolution the randomly chosen neighboring players try to maximize their collective income by adopting a random strategy pair with a probability…