We study a differential game of many pursuers and one evader. All the players move only along one-skeleton graph an orthoplex dimension d+1. It is assumed that maximal speeds are less than speed By definition, pursuit completed if position pursuer coincides with Evasion said to be possible in movements started from some initial positions evader never any pursuer. found optimal number game. The ...

We consider the problem of having a team of Unmanned Aerial Vehicles (UAV) and Unmanned Ground Vehicles (UGV) pursue a second team of evaders while concurrently building a map in an unknown environment. We cast the problem in a probabilistic game theoretic framework and consider two computationally feasible greedy pursuit policies: local-max and global-max. To implement this scenario on real UA...

Inspired by the hunting and foraging behaviors of group predators, this paper addresses a class of multi-player pursuit-evasion games with one superior evader, who moves faster than the pursuers. We are concerned with the conditions under which the pursuers can capture the evader, involving the minimum number and initial spatial distribution required as well as the cooperative strategies of the...

The present paper is devoted to studying a pursuit differential game described by an infinite system of binary equations in Hilbert space l2. control parameters the players are subject geometric constraints. pursuer tries bring state origin l2, and oppositely, evader avoid it. Our aim construct strategy for complete evasion control. We obtain equation guaranteed times.

The proposed self-adaptive predictive pursuing policy consists of an action decision-making procedure and a procedure of adjusting the estimation of evader’s action preference. Since correct estimation of opponent’s intention would do good to win adversarial games, it introduces the conception of action preference to model opponent’s decision-making. Because evader often has different action pr...

This research concerns the comparison of three different artificial evolution approaches to the design of cooperative behavior in a group of simulated mobile robots. The first and second approaches, termed: single pool and plasticity, are characterized by robots that share a single genotype, though the plasticity approach includes a learning mechanism. The third approach, termed: multiple pools...

A probabilistic pursuit–evasion game from the literature is used as an example to study constrained communication in multi-robot systems. Communication protocols based on time-triggered and event-triggered synchronization schemes are considered. It is shown that by limiting the communication to events when the probabilistic map updated by the individual pursuer contains new information, as meas...

This research concems the comparison of different artificial evolution approaches to the design of cooperative behavior in a team of simulated mobile robots co-evolved against a second team. The first and second approaches, termed single pool and plasticiry, are characterized by robots that share a single genotype, though the plasticity approach includes a leaning mechanism. The third approach,...

This correspondence proposes a solution to the herding problem, a class of pursuit evasion problem, in stochastic framework. The problem involves a “pursuer” agent trying to herd a stochastically moving “evader” agent to a pen. The problem is stated in terms of allowable sequential actions of the two agents. The solution is obtained by applying the principles of stochastic dynamic programming. ...

We investigate the occurrence of two pathological coevolutionary behaviours, specifically disengagement and cycling, in GP systems. An empirical analysis is carried out using constructed GP problems and a historical pursuit and evasion task, the Game of Tag. The effect of semantic bias on the likelihood of pathologies and performance in a coevolutionary context is examined. We present findings ...