Linear Discrete Pursuit Game Problem with Total Constraints | Zendy

Atamurat Kuchkarov | Zendy; Gafurjan Ibragimov | Zendy; Akmal Sotvoldiev | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Linear Discrete Pursuit Game Problem with Total Constraints

Author(s) -

Atamurat Kuchkarov,

Gafurjan Ibragimov,

Akmal Sotvoldiev

Publication year - 2013

Publication title -

abstract and applied analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.228

H-Index - 56

eISSN - 1687-0409

pISSN - 1085-3375

DOI - 10.1155/2013/840925

Subject(s) - mathematics , pursuer , combinatorics , path (computing) , state (computer science) , matrix (chemical analysis) , discrete mathematics , algorithm , mathematical optimization , computer science , materials science , composite material , programming language

We study a linear discrete pursuit game problem of one pursuer and one evader. Control vectors of the players are subjected to total constraints which are discrete analogs of the integral constraints. By definition pursuit can be completed in the game if there exists a strategy of the pursuer such that for any control of the evader the state of system reaches the origin at some time. We obtain sufficient conditions of completion of the game from any initial position of the state space. Strategy of the pursuer is defined as a function of the current state of system and value of control parameter of the evader

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