Reachable and controllable sets for two-dimensional,linear, discrete-time systems |
| |
Authors: | J. B. Lasserre |
| |
Affiliation: | (1) Laboratoire d'Automatique et d'Analyse des Systèmes du CNRS, Toulouse, France |
| |
Abstract: | We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated. |
| |
Keywords: | Discrete-time linear systems reachable sets linear algebra Farkas' lemma computational geometry |
本文献已被 SpringerLink 等数据库收录! |