Answers are grounded in this paper and cite their sources.
The explicit Model Predictive Control (MPC) has emerged as a powerful technique to solve the optimization problem offline for embedded applications where computations is performed online. Despite practical obstacles in implementation of explicit model predictive control (MPC), the main drawbacks of MPC, namely the need to solve a mathematical program on line to compute the control action are removed. This paper addresses complexity of explicit model predictive control (MPC) in terms of online evaluation and memory requirement. Complexity reduction approaches for explicit MPC has recently been emerged as techniques to enhance applicability of MPC. Individual deployment of the approaches has not had enough effect on complexity reduction. In this paper, merging the approaches based on complexity reduction is addressed. The binary search tree and complexity reduction via separation are efficient methods which can be confined to small problems, but merging them can result in significant effect and expansion of its applicability. The simulation tests show proposed approach significantly outperforms previous methods.
No takes yet. Share an insight, caveat, or question.
Jamal Arezoo (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: