Approximate explicit model predictive control incorporating heuristics
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Explicit piecewise linear state feedback solutions to the constrained linear model predictive control problem have recently been characterized and computed numerically using multiparametric quadratic programming. The piecewise linear state feedback is defined on a polyhedral partitioning of the state space, which may be quite complex. Here we suggest an approximate multi-parametric quadratic programming approach, which has the advantages that the partition is structured as a binary search tree. This leads to real-time computation of the piecewise linear state feedback with a computational complexity that is logarithmic with respect to the number of regions in the partition. The algorithm is based on heuristic rules that are used to partition the state space and estimate the approximation error.Keywords
This publication has 12 references indexed in Scilit:
- An algorithm for multi-parametric quadratic programming and explicit MPC solutionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On explicit suboptimal LQR with state and input constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Global analytical model predictive control with input constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Explicit sub-optimal linear quadratic regulation with state and input constraintsAutomatica, 2002
- Computational GeometryPublished by Springer Nature ,2000
- Efficient robust predictive controlIEEE Transactions on Automatic Control, 2000
- Fast algorithm for a constrained infinite horizon LQ problemInternational Journal of Control, 1999
- On constrained infinite-time linear quadratic optimal controlSystems & Control Letters, 1996
- Robust model predictive control of processes with hard constraintsComputers & Chemical Engineering, 1990
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975