On Feasibility, Stability and Performance in Distributed Model Predictive Control

Abstract

In distributed model predictive control (DMPC), where a centralized optimization problem is solved in distributed fashion using dual decomposition, it is important to keep the number of iterations in the solution algorithm small. In this technical note, we present a stopping condition to such distributed solution algorithms that is based on a novel adaptive constraint tightening approach. The stopping condition guarantees feasibility of the optimization problem and stability and a prespecified performance of the closed-loop system.