Related papers: Group Chase and Escape with Conversion from Target…
We study the survival probability of an immobile target in presence of N independent diffusing walkers. We address the problem of the Mean Target Lifetime and its dependence on the number and initial distribution of the walkers when the…
This paper addresses a multi-pursuer single-evader pursuit-evasion game where the free-moving evader moves faster than the pursuers. Most of the existing works impose constraints on the faster evader such as limited moving area and moving…
This paper considers a pursuit-evasion scenario among three agents -- an evader, a pursuer, and a defender. We design cooperative guidance laws for the evader and the defender team to safeguard the evader from an attacking pursuer. Unlike…
A fixed-confidence, finite-sample problem of active hypothesis testing arises in many safety-critical applications. Situated in the context of sequential hypothesis testing, this paper studies the effect of hypothesis elimination on the…
This paper considers a scenario of pursuing a moving target that may switch behaviors due to external factors in a dynamic environment by motion estimation using visual sensors. First, we present an improved Visual Motion Observer with…
We prove that chase-escape with conversion on the complete graph undergoes a phase transition at equal fitness and derive simple asymptotic formulas for the extinction probability, the total number of converted sites, and the expected…
We review some representative results for first-passage problems involving so-called mortal or evanescent walkers, i.e., walkers with a finite lifetime. The mortality constraint plays a key role in the modeling of many real scenarios, as it…
A swarm of preys when attacked by a predator is known to rely on their cooperative interactions to escape. Understanding such interactions of collectively moving preys and the emerging patterns of their escape trajectories still remain…
Our aim is to present a new model which encompasses pace optimization and motor control effort for a runner on a fixed distance. We see that for long races, the long term behaviour is well approximated by a turnpike problem. We provide…
In this paper, we investigate the problem of joint searching and tracking of multiple mobile targets by a group of mobile agents. The targets appear and disappear at random times inside a surveillance region and their positions are random…
Collective migration of animals in a cohesive group is rendered possible by a strategic distribution of tasks among members: some track the travel route, which is time and energy-consuming, while the others follow the group by interacting…
This paper investigates a pursuit-evasion problem involving three agents: a pursuer, an evader, and a defender. Cooperative guidance laws are developed for the evader-defender team that guarantee interception of the pursuer by the defender…
The survival chance of a prey chased by a predator depends not only on their relative speeds but importantly also on the local environment they have to face. For example, a wolf chasing a deer might take a long time to cross a river which…
The maximum surveillance of a target which is holding course is considered, wherein an observer vehicle aims to maximize the time that a faster target remains within a fixed-range of the observer. This entails two coupled phases: an…
We study the degree of success of a single predator hunting a herd of prey on a two dimensional square lattice landscape. We explicitly consider the self volume of the prey restraining their dynamics on the lattice. The movement of both…
The historical origins of the game theoretic predator-prey pursuit problem can be traced back to Benda, et al., 1985 [1]. Their work adapted the predator-prey ecology problem into a pursuit environment which focused on the dynamics of…
We propose a new approach for solving combinatorial optimization problem by utilizing the mechanism of chases and escapes, which has a long history in mathematics. In addition to the well-used steepest descent and neighboring search, we…
A planar herding problem is considered, where a superior pursuer herds a flock of non-cooperative, inferior evaders around a predefined target point. An inverse square law of repulsion is assumed between the pursuer and each evader. Two…
We propose a decentralized solution for a pursuit-evasion game involving a heterogeneous group of rational (selfish) pursuers and a single evader based on the framework of potential games. In the proposed game, the evader aims to delay (or,…
We consider a search problem in which one or more targets must be rescued by a search party, or Searcher. The targets may be survivors of some natural disaster, or prisoners held by an adversary. The targets are hidden among a finite set of…