Maximal closed loop admissible set for linear systems with non-convex polyhedral constraints

This paper deals with the computation of the maximal closed-loop admissible set for linear systems with non-convex polyhedral constraints. These constraints are modeled as the union of a finite number of convex polyhedra. An efficient algorithm for the computation of this set, based on removing subsets of the maximal closed-loop invariant set for the convex hull of the original constraints, is proposed and compared with the existing generic algorithm. Next, stability conditions for a general predictive control scheme are applied to the particular problem proposed. Finally, two examples showing the performance of the maximal admissible set algorithm are given.