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 ℝn and it is assumed to have nonempty interior. Game is said to be completed if yk-x...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2014/674651 |