A STATE-SPACE DESCRIPTION FOR GPC CONTROLLERS

Generalized predictive control (GPC)-type control algorithms traditionally derived in the polynomial domain are derived in this paper in the state-space domain, but following the polynomial approach due to Clarke et al. (1987). Relations between the polynomial and state-space parameters are presented. Some possible state-space representations which were used earlier in different publications are discussed. The problem of deriving the GPC algorithm in the state-space domain is solved for the unrestricted case as well as for the case of restricted control and output horizons. Some properties of the state estimate for this problem are presented; in particular, two methods of Kalman filtering-optimal and asymptotic-are proposed. The solution is valid for any possible (minimal or non-minimal) state-space representation. Another approach to this problem is by the 'dynamic programming method' and solving the Riccati equation (Bitmead et al. 1990). This approach is also presented in this paper but the method differs from this earlier work and does not require extending the state dimension. Ultimately, certain features of the state-space approach are discussed, such as (a) the opportunity for straightforward analysis of the transient states produced by switching on the regulator, by changing the set-point or by changing the regulator parameters; (b) easy extension to the multidimensional case; and (c) the possibility of introducing nonlinearities into the model.