Robust GPC using limited complexity polytopes

摘要

This paper handles a duality problem between the Generalized Predictive Control (GPC) strategy and the identification of parameter membership set. The predictor is rewritten so that it is linear with respect to the parameters of member-ship set. The convexity of criterion to be optimised is satisfied.