Fast Model Predictive Control Combining Offline Method and Online Optimization with K-D Tree

Computation time is the main factor that limits the application of model predictive control (MPC). This paper presents a fast model predictive control algorithm that combines offline method and online optimization to solve the MPC problem. The offline method uses a k-d tree instead of a table to implement partial enumeration, which accelerates online searching operation. Only a part of the explicit solution is stored in the k-d tree for online searching, and the k-d tree is updated in runtime to accommodate the change in the operating point. Online optimization is invoked when searching on the k-d tree fails. Numerical experiments show that the proposed algorithm is efficient on both small-scale and large-scale processes. The average speedup factor in the large-scale process is at least 6, the worst-case speedup factor is at least 2, and the performance is less than 0.05% suboptimal.

[1]  Stephen J. Wright,et al.  Applying new optimization algorithms to more predictive control , 1996 .

[2]  Alberto Bemporad,et al.  An algorithm for multi-parametric quadratic programming and explicit MPC solutions , 2003, Autom..

[3]  Frank J. Christophersen,et al.  Controller complexity reduction for piecewise affine systems through safe region elimination , 2007, 2007 46th IEEE Conference on Decision and Control.

[4]  Alberto Bemporad,et al.  Evaluation of piecewise affine control via binary search tree , 2003, Autom..

[5]  Stephen J. Wright,et al.  Fast, large-scale model predictive control by partial enumeration , 2007, Autom..

[6]  Alberto Bemporad,et al.  An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control , 2014, IEEE Transactions on Automatic Control.

[7]  Pantelis Sopasakis,et al.  A global piecewise smooth Newton method for fast large-scale model predictive control , 2011, Autom..

[8]  A. Bemporad,et al.  Suboptimal Explicit Receding Horizon Control via Approximate Multiparametric Quadratic Programming , 2003 .

[9]  Stephen P. Boyd,et al.  Fast Model Predictive Control Using Online Optimization , 2010, IEEE Transactions on Control Systems Technology.

[10]  Manfred Morari,et al.  Polytopic Approximation of Explicit Model Predictive Controllers , 2010, IEEE Transactions on Automatic Control.

[11]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[12]  Chak-Kuen Wong,et al.  Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees , 1977, Acta Informatica.

[13]  Stephen J. Wright,et al.  Application of Interior-Point Methods to Model Predictive Control , 1998 .

[14]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[15]  Tor Arne Johansen,et al.  Using hash tables to manage the time-storage complexity in a point location problem: Application to explicit model predictive control , 2011, Autom..

[16]  Alberto Bemporad,et al.  The explicit linear quadratic regulator for constrained systems , 2003, Autom..

[17]  H. J. Ferreau,et al.  An online active set strategy to overcome the limitations of explicit MPC , 2008 .

[18]  Tor Arne Johansen,et al.  Approximate explicit receding horizon control of constrained nonlinear systems , 2004, Autom..

[19]  Johan U. Backstrom,et al.  Quadratic programming algorithms for large-scale model predictive control , 2002 .

[20]  Manfred Morari,et al.  Real-time suboptimal model predictive control using a combination of explicit MPC and online optimization , 2008, 2008 47th IEEE Conference on Decision and Control.