Using hash tables to manage the time-storage complexity in a point location problem: Application to explicit model predictive control

The online computational burden of linear model predictive control (MPC) can be moved offline by using multi-parametric programming, so-called explicit MPC. The solution to the explicit MPC problem is a piecewise affine (PWA) state feedback function defined over a polyhedral subdivision of the set of feasible states. The online evaluation of such a control law needs to determine the polyhedral region in which the current state lies. This procedure is called point location; its computational complexity is challenging, and determines the minimum possible sampling time of the system. A new flexible algorithm is proposed which enables the designer to trade off between time and storage complexities. Utilizing the concept of hash tables and the associated hash functions, the proposed method solves an aggregated point location problem that overcomes prohibitive complexity growth with the number of polyhedral regions, while the storage-processing trade-off can be optimized via scaling parameters. The flexibility and power of this approach is supported by several numerical examples.

[1]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[2]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[3]  Tor Arne Johansen,et al.  Approximate explicit constrained linear model predictive control via orthogonal search tree , 2003, IEEE Trans. Autom. Control..

[4]  T.A. Johansen,et al.  Utilizing Reachability Analysis in Point Location Problems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[6]  Alberto Bemporad,et al.  Model predictive control based on linear programming - the explicit solution , 2002, IEEE Transactions on Automatic Control.

[7]  Jack Snoeyink Point Location , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[9]  Lorenzo Fagiano,et al.  Set Membership approximation theory for fast implementation of Model Predictive Control laws , 2009, Autom..

[10]  T. Johansen,et al.  Computation and approximation of piecewise affine control laws via binary search trees , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[11]  Xiaoyan Ma,et al.  Analytical expression of explicit MPC solution via lattice piecewise-affine function , 2009, Autom..

[12]  Colin Neil Jones,et al.  A logarithmic-time solution to the point location problem for parametric linear programming , 2006, Autom..

[13]  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.

[14]  Yang Wang,et al.  Efficient point location via subdivision walking with application to explicit MPC , 2007, 2007 European Control Conference (ECC).

[15]  Morten Hovd,et al.  Algorithms for Online Implementations of Explicit MPC Solutions , 2008 .

[16]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[17]  M. Morari,et al.  Efficient evaluation of piecewise control laws defined over a large number of polyhedra , 2007, 2007 European Control Conference (ECC).

[18]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[19]  Alberto Bemporad,et al.  Efficient On-Line Computation of Constrained Optimal Control , 2008, SIAM J. Control. Optim..

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

[21]  Mato Baotic,et al.  Multi-Parametric Toolbox (MPT) , 2004, HSCC.

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