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

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)...

Full description

Bibliographic Details
Main Authors: Raxmonov, Asqar, Ibragimov, Gafurjan I.
Format: Article
Language:English
Published: Hindawi Publishing Corporation 2014
Online Access:http://psasir.upm.edu.my/id/eprint/36390/
http://psasir.upm.edu.my/id/eprint/36390/1/36390.pdf
_version_ 1848848318940053504
author Raxmonov, Asqar
Ibragimov, Gafurjan I.
author_facet Raxmonov, Asqar
Ibragimov, Gafurjan I.
author_sort Raxmonov, Asqar
building UPM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T09:32:36Z
format Article
id upm-36390
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T09:32:36Z
publishDate 2014
publisher Hindawi Publishing Corporation
recordtype eprints
repository_type Digital Repository
spelling upm-363902017-10-20T04:00:38Z http://psasir.upm.edu.my/id/eprint/36390/ An approach for solving discrete game problems with total constraints on controls Raxmonov, Asqar Ibragimov, Gafurjan I. 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. Hindawi Publishing Corporation 2014 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/36390/1/36390.pdf 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 http://www.hindawi.com/journals/aaa/2014/674651/abs/ 10.1155/2014/674651
spellingShingle Raxmonov, Asqar
Ibragimov, Gafurjan I.
An approach for solving discrete game problems with total constraints on controls
title An approach for solving discrete game problems with total constraints on controls
title_full An approach for solving discrete game problems with total constraints on controls
title_fullStr An approach for solving discrete game problems with total constraints on controls
title_full_unstemmed An approach for solving discrete game problems with total constraints on controls
title_short An approach for solving discrete game problems with total constraints on controls
title_sort approach for solving discrete game problems with total constraints on controls
url http://psasir.upm.edu.my/id/eprint/36390/
http://psasir.upm.edu.my/id/eprint/36390/
http://psasir.upm.edu.my/id/eprint/36390/
http://psasir.upm.edu.my/id/eprint/36390/1/36390.pdf