UPM Institutional Repository

An approach for solving discrete game problems with total constraints on controls


Raxmonov, Asqar and Ibragimov, Gafurjan I. (2014) An approach for solving discrete game problems with total constraints on controls. Abstract and Applied Analysis, 2014. art. no. 674651. pp. 1-6. ISSN 1085-3375; ESSN: 1687-0409


We consider a linear pursuit game of one pursuer and one evader whose motions are described by different-type linear discrete systems. Controls of the players satisfy total constraints. Terminal set M is a subset of Rn and it is assumed to have nonempty interior. Game is said to be completed if y(k) - x(k) ∈ M at some step k. To construct the control of the pursuer, at each step i , we use positions of the players from step 1 to step and the value of the control parameter of the evader at the step i. We give sufficient conditions of completion of pursuit and construct the control for the pursuer in explicit form. This control forces the evader to expend some amount of his resources on a period consisting of finite steps. As a result, after several such periods the evader exhausted his energy and then pursuit will be completed.

Download File

[img] PDF
Restricted to Repository staff only

Download (1MB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
DOI Number: https://doi.org/10.1155/2014/674651
Publisher: Hindawi Publishing Corporation
Keywords: Game; Constraints; Controls; Pursuit game
Depositing User: Nabilah Mustapa
Date Deposited: 24 Jun 2015 07:35
Last Modified: 20 Oct 2017 04:00
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1155/2014/674651
URI: http://psasir.upm.edu.my/id/eprint/36390
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item