Abstract
Exact or approximate solutions to constrained linear model predictive control (MPC) problems can be pre-computed off-line in an explicit form as a piecewise linear state feedback defined on a polyhedral partition of the state space. However, the complexity of the polyhedral partition often increases rapidly with the dimension of the state vector, and the number of constraints. This paper presents an approach for reducing the dimension of the approximate explicit solution to linear constraint MPC problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
