A Hierarchical MPC Approach with Guaranteed Feasibility for Dynamically Coupled Linear Systems

Abstract

In this chapter we describe an iterative two-layer hierarchical approach to MPC of large-scale linear systems subject to coupled linear constraints. The algorithm uses constraint tightening and applies a primal-dual iterative averaging procedure to provide feasible solutions in every sampling step. This helps overcome typical practical issues related to the asymptotic convergence of dual decomposition based distributed MPC approaches. Bounds on constraint violation and level of suboptimality are provided. The method can be applied to large-scale MPC problems that are feasible in the first sampling step and for which the Slater condition holds (i.e., there exists a solution that strictly satisfies the inequality constraints). Using this method, the controller can generate feasible solutions of the MPC problem even when the dual solution does not reach optimality, and closed-loop stability is also ensured using bounded suboptimality. © Springer Science+Business Media Dordrecht 2014.