Abstract
We present a novel MPC algorithm without terminal constraints and/or costs, for which the prediction horizon is reduced in comparison to standard MPC while asymptotic stability and inherent robustness properties are maintained. To this end, we derive simplified stability conditions and investigate the interplay of open and closed loop control in MPC. The insight gained from this analysis allows to close the control loop more often while keeping the computational complexity of basic MPC. Our findings are verified by numerical simulations.
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.
