Abstract
Ellipsoidal invariant sets have been widely used as target sets in MPC. These sets can be computed by constructing appropriate Linear Difference Inclusions together with additional constraints to ensure that the ellipsoid lies within a given Inclusion Polytope. The choice of this polytope has a significant effect on the size of the computed ellipsoid, but the optimal inclusion polytope cannot in general be computed systematically. This paper shows that use of polytopic invariant sets overcomes this difficulty, resulting in larger stabilizable sets without loss of closed-loop performance. In the interests of online efficiency, consideration is focused on interpolation-based NMPC.
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.
