On the Approximation of Invariant Sets for Constrained LDT Systems
Abstract
An algorithm is given for the computation of the maximal invariant subset of a given set for linear discrete-time systems subject to hard constraints on state, control and disturbance inputs. At each iteration the algorithm provides an inner invariant approximation of the maximal invariant set.
