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 wwith only O( Nn) computations for an n- th order plant and N- steps prediction horizon.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
