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)...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Publishing Corporation
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/36390/1/36390.pdf |