Primal-Dual Enumeration for Multiparametric Linear Programming
Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (pLPs) and solved explicitly offline. Several algorithms have recently been proposed in the literature that solve these pLPs in a fairly efficient manner, all of which have as a base operation the computation and removal of redundant constraints. For many problems, it is this redundancy elimination that requires the vast majority of the computation time. This paper introduces a new solution technique for multiparametric linear programs based on the primal–dual paradigm. The proposed approach reposes the problem as the vertex enumeration of a linearly transformed polytope and then simultaneously computes both its vertex and halfspace representations. Exploitation of the halfspace representation allows, for smaller problems, a very significant reduction in the number of redundancy elimination operations required, resulting in many cases in a much faster algorithm.
KeywordsModel Predictive Control Tangent Cone Model Predictive Controller Support Cone Parametric Linear Program
Unable to display preview. Download preview PDF.
- 2.Tøndel, P., Johansen, T., Bemporad, A.: An algorithm for multi-parametric quadratic programming and explicit MPC solutions. Automatica, 489–497 (2003)Google Scholar
- 5.Bertsekas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific (1997)Google Scholar
- 6.Jones, C.: Polyhedral Tools for Control. PhD thesis, University of Cambridge (2005)Google Scholar
- 8.Fukuda, K.: Frequently asked questions in polyhedral computation (2000), http://www.ifor.math.ethz.ch/fukuda/polyfaq/polyfaq.html
- 9.Preparatat, F., Shamos, M.: Computational Geometry: An Introduction. Springer, New York (1985)Google Scholar
- 10.Motzkin, T., Raiffa, H., Thompson, G., Thrall, R.: The double description method. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II. Ann. of Math. Stud, vol. 8, pp. 51–73. Princeton University Press, Princeton (1953)Google Scholar
- 11.Seidel, R.: A convex hull algorithm optimal for point sets in even dimension. Master’s thesis, Dept. of Computer Science. University of British Columbia, Vancouver, Canada (1981)Google Scholar
- 13.Kvasnica, M., Grieder, P., Baotić, M.: Multi-Parametric Toolbox (MPT) (2004), http://control.ee.ethz.ch/~mpt/
- 14.Bemporad, A.: Hybrid toolbox, Version 1.0.10 (2005), http://www.dii.unisi.it/hybrid/toolbox/
- 16.Murray, W., Saunders, M.: Systems Optimization Laboratory (SOL) (2006), http://www.sbsi-sol-optimize.com