Linear Discrete Pursuit Game Problem with Total Constraints

Atamurat Kuchkarov, Gafurjan Ibragimov and Akmal Sotvoldiev

Abstract and Applied Analysis, 2013, vol. 2013, issue 1

Abstract: 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 z(t) 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.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2013/840925

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2013:y:2013:i:1:n:840925

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().