Suboptimal Explicit Receding Horizon Control via Approximate Multiparametric Quadratic Programming

Algorithms for solving multiparametric quadratic programming (MPQP) were recently proposed in Refs. 1–2 for computing explicit receding horizon control (RHC) laws for linear systems subject to linear constraints on input and state variables. The reason for this interest is that the solution to MPQP is a piecewise affine function of the state vector and thus it is easily implementable online. The main drawback of solving MPQP exactly is that, whenever the number of linear constraints involved in the optimization problem increases, the number of polyhedral cells in the piecewise affine partition of the parameter space may increase exponentially. In this paper, we address the problem of finding approximate solutions to MPQP, where the degree of approximation is arbitrary and allows to tradeoff between optimality and a smaller number of cells in the piecewise affine solution. We provide analytic formulas for bounding the errors on the optimal value and the optimizer, and for guaranteeing that the resulting suboptimal RHC law provides closed-loop stability and constraint fulfillment