Abstract
Min-max model predictive control (MMMPC) is one of the strategies used to control plants subject to bounded additive uncertainties. The implementation of MMMPC suffers a large computational burden, especially when hard constraints are taken into account, due to the complex numerical optimization problem that has to be solved at every sampling time. The paper shows how to overcome this by transforming the original problem into a reduced min-max problem whose solution is much simpler. In this way, the range of processes to which MMMPC can be applied is considerably broadened. Proofs based on the properties of the cost function and a simulation example are given in the paper.
Sign-in/Register to access full text options 
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.
