Abstract
We address the problem of synthesizing state-constraint sets for a fully decentralized Model Predictive Control (MPC) scheme. We consider linear time-invariant discrete time systems, with subsystems possibly coupled in both dynamics and state constraints. For each individual subsystem we employ a set-based framework to compute the state-constraint sets, that are used to synthesize local tube-based MPC controllers. The offline problem that computes the constraint sets explicitly ensures that the feasible regions of the MPC controllers are non-empty, and whenever the controllers are feasible, the overall system constraints are satisfied with the least conservativeness possible. We demonstrate the closed-loop performance of the decentralized scheme, assessed with respect to centralized MPC, using a numerical example.
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.
