Thèse de doctorat
Résumé : After a short introduction, this thesis presents ways of computing relevant sets and operations in constrained control. In particular, admissible reference-dependent invariant sets based on Lyapunov (Ch. 3), the Pontryagin difference of basic semi-algebraic sets (Ch. 4), an extension to the Model Predictive Control for Tracking to deal with nonconvex sets of steady-state admissible references (Ch. 5), and the study of the Maximal Output Admissible Set for saturated (Ch. 6) and polynomial systems (Ch. 7).