A Reference Governor for linear systems with polynomial constraints

Abstract

The paper considers the application of reference governors to linear discrete-time systems with constraints given by polynomial inequalities. We propose a novel algorithm to compute the maximal output admissible invariant set in the case of polynomial constraints. The reference governor solves a constrained nonlinear minimization problem at initialization and then uses a bisection algorithm at the subsequent time steps. The effectiveness of the method is demonstrated by two numerical examples.