Pursuit-evasion game of many players with coordinate-wise integral constraints on a convex set in the plane | Zendy

Массимилиано Феррара | Zendy; Gafurjan Ibragimov | Zendy; Mehdi Salimi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Pursuit-evasion game of many players with coordinate-wise integral constraints on a convex set in the plane

Author(s) -

Массимилиано Феррара,

Gafurjan Ibragimov,

Mehdi Salimi

Publication year - 2017

Publication title -

doaj (doaj: directory of open access journals)

Language(s) - English

DOI - 10.1478/aapp.952a6

Subject(s) - pursuer , mathematics , plane (geometry) , differential game , regular polygon , set (abstract data type) , sequential game , bayesian game , evasion (ethics) , repeated game , differential (mechanical device) , combinatorics , mathematical economics , game theory , computer science , mathematical optimization , geometry , physics , immune system , thermodynamics , immunology , biology , programming language

We study a differential game of many pursuers and one evader in the plane. It is assumed that the pursuers and evader move is allowed within a non empty closed convex set in the plane. Control functions of players are subject to coordinate-wise integral constraints. The game is over when the state of the evader y coincides with that of a pursuer x_i, i={1,...,m} at given time t_i (unspecified), i.e., x_i(t_i)=y(t_i). We obtain conditions under which the game is over in finite time, no matter where the players start from. Moreover, we construct winning for the pursuers

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research