Resumen de Explicit model predictive control: A connected-graph approach
Richard Oberdieck, Nikolaos A. Diangelakis, Efstratios N. Pistikopoulos
Abstract The ability to solve model predictive control (MPC) problems of linear time-invariant systems explicitly and offline via multi-parametric quadratic programming (mp-QP) has become a widely used methodology. The most efficient approaches used to solve the underlying mp-QP problem are either based on combinatorial considerations, which scale unfavorably with the number of constraints, or geometrical considerations, which require heuristic tuning of the step-size and correct identification of the active set. In this paper, we describe a novel algorithm which unifies these two types of approaches by showing that the solution of a mp-QP problem is given by a connected graph, where the nodes correspond to the different optimal active sets over the parameter space. Using an extensive computational study, as well as the explicit MPC solution of a combined heat and power system, the merits of the proposed algorithm are clearly highlighted.
