Fast algorithms for generalized predictive control (GPC) are derived by adopting an approach whereby dynamic programming and a polynomial formulation are jointly exploited. They consist of a set of coupled linear polynomial recursions by which the dynamic output feedback GPC law is recursively computed with only O(Nn) computations for an n-th order plant and N-steps prediction horizon.
Chisci, L., Garulli, A., Zappa, G. (1994). Fast Algorithms For Generalized Predictive Control. SYSTEMS & CONTROL LETTERS, 23(5), 339-348 [10.1016/0167-6911(94)90066-3].
Fast Algorithms For Generalized Predictive Control
Garulli, Andrea;
1994-01-01
Abstract
Fast algorithms for generalized predictive control (GPC) are derived by adopting an approach whereby dynamic programming and a polynomial formulation are jointly exploited. They consist of a set of coupled linear polynomial recursions by which the dynamic output feedback GPC law is recursively computed with only O(Nn) computations for an n-th order plant and N-steps prediction horizon.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/29370
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo