Solution of a Linear Pursuit-Evasion Differential Game with Closed and Convex Terminal Set | Zendy

Gafurjan Ibragimov | Zendy; Marzieh Khakestari | Zendy; Atamurat Sh. Kuchkarov | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solution of a Linear Pursuit-Evasion Differential Game with Closed and Convex Terminal Set

Author(s) -

Gafurjan Ibragimov,

Marzieh Khakestari,

Atamurat Sh. Kuchkarov

Publication year - 2011

Publication title -

itb journal of sciences

Language(s) - English

Resource type - Journals

ISSN - 1978-3043

DOI - 10.5614/itbj.sci.2012.44.1.1

Subject(s) - terminal (telecommunication) , pursuit evasion , differential game , set (abstract data type) , differential (mechanical device) , regular polygon , mathematics , evasion (ethics) , mathematical optimization , mathematical economics , computer science , engineering , biology , genetics , geometry , telecommunications , immune system , programming language , aerospace engineering

A linear two-person zero-sum pursuit-evasion differential game is considered. Control functions of players are subject to integral constraints. Terminal set is a closed convex subset of The Pursuer tries to bring the state of the system to the terminal set and the Evader prevents bringing of the state to the terminal set where control resource of the Pursuer is greater than that of Evader. We obtain a formula for the optimal pursuit time and construct optimal strategies of the players in explicit form .

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