Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Controlled Invariance of Discrete Time Systems

Author(s):

R. Vidal, S. Schaffert, J. Lygeros, S. Sastry
Conference/Journal:

Lecture Notes in Computer Science LNCS, no. 1790, pp. 437-450, Article in book: "Hybrid Systems: Computation and Control"
Abstract:

An algorithm for computing the maximal controlled invariant set and the least restrictive controller for discrete time systems is proposed. We show how the algorithm can be encoded using quantifier elimination, which leads to a semi-decidability result for definable systems. For discrete time linear systems with all sets specified by linear inequalities, a more efficient implementation is proposed using linear programming and Fourier elimination. If in addition the system is in controllable canonical form, the input is scalar and unbounded, the disturbance is scalar and bounded and the initial set is a rectangle, then the problem is decidable

Year:

2000
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { VidEtal:2000:IFA_2531,
    author={R. Vidal and S. Schaffert and J. Lygeros and S. Sastry},
    title={{Controlled Invariance of Discrete Time Systems}},
    journal={Lecture Notes in Computer Science LNCS},
    year={2000},
    volume={},
    number={1790},
    pages={437--450},
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=2531}
}
Permanent link