Cooperative versus decentralized strategies in three-pursuer single-evader games

01/24/2020
by   Marco Casini, et al.
0

The value of cooperation in pursuit-evasion games is investigated. The considered setting is that of three pursuers chasing one evader in a planar environment. The optimal evader trajectory for a well-known decentralized pursuer strategy is characterized. This result is instrumental to derive upper and lower bounds to the game length, in the case in which the pursuers cooperate in the chasing strategy. It is shown that the cooperation cannot reduce the capture time by more than one half with respect to the decentralized case, and that such bound is tight.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2021

Cooperation, Retaliation and Forgiveness in Revision Games

Revision game is a very new model formulating the situation where player...
research
03/01/2023

Allocating the surplus induced by cooperation in distribution chains with multiple suppliers and retailers

The coordination of actions and the allocation of profit in supply chain...
research
03/01/2018

Towards Cooperation in Sequential Prisoner's Dilemmas: a Deep Multiagent Reinforcement Learning Approach

The Iterated Prisoner's Dilemma has guided research on social dilemmas f...
research
06/16/2023

Structured Cooperative Learning with Graphical Model Priors

We study how to train personalized models for different tasks on decentr...
research
03/02/2019

Computability Aspects of Differential Games in Euclidian Spaces

We study computability-theoretic aspects of differential games. Our focu...
research
06/17/2019

Lower Bounds and Conditioning of Differentiable Games

Many recent machine learning tools rely on differentiable game formulati...
research
02/10/2019

Expected capture time and throttling number for cop versus gambler

We bound expected capture time and throttling number for the cop versus ...

Please sign up or login with your details

Forgot password? Click here to reset