Efficient implementation of MPC for tracking using ADMM by decoupling its semi-banded structure
Victor Gracia, Pablo Krupa, Daniel Limon, Teodoro Alamo
TL;DR
This work tackles the computational burden of MPCT by exploiting its semi-banded optimization problem through an ADMM-based solver. By reformulating MPCT into a split problem with a z-update solved via a Woodbury-based semi-banded decomposition and a simple v-update, the method recovers the banded structure that enables efficient solves. Compared to the existing EADMM approach, the proposed ADMM offers unconditional convergence guarantees for any $\rho>0$ and often demonstrates superior practical performance, particularly for reachable references, as shown on a ball-and-plate example. The results support the viability of fast, embedded MPCT implementations by leveraging the semi-banded ADMM decomposition.
Abstract
Model Predictive Control (MPC) for tracking formulation presents numerous advantages compared to standard MPC, such as a larger domain of attraction and recursive feasibility even when abrupt changes in the reference are produced. As a drawback, it includes some extra decision variables in its related optimization problem, leading to a semi-banded structure that differs from the banded structure encountered in standard MPC. This semi-banded structure prevents the direct use of the efficient algorithms available for banded problems. To address this issue, we present an algorithm based on the alternating direction method of multipliers that explicitly takes advantage of the underlying semi-banded structure of the MPC for tracking.
