SearcharxivSearch

arXiv · 2604.02177

Explicit Distributed MPC: Reducing Computation and Communication Load by Exploiting Facet Properties

Abstract

Classical Distributed Model Predictive Control (DiMPC) requires multiple iterations to achieve convergence, leading to high computational and communication burdens. This work focuses on the improvement of an iteration-free distributed MPC methodology that minimizes computational effort and communication load. The aforementioned methodology leverages multiparametric programming to compute explicit control laws offline for each subsystem, enabling real-time control without iterative data exchanges between subsystems. Extending our previous work on iteration-free DiMPC, here we introduce a FAcet-based Critical region Exploration Technique for iteration-free DiMPC (FACET-DiMPC) that further reduces computational complexity by leveraging facet properties to do targeted critical region exploration. Simulation results demonstrate that the developed method achieves comparable control performance to centralized methods, while significantly reducing communication overhead and computation time. In particular, the proposed methodology offers substantial efficiency gains in terms of the average computation time reduction of 98% compared to classic iterative DiMPC methods and 42% compared to iteration-free DiMPC methods, making it well-suited for real-time control applications with tight latency and computation constraints.

Explore related subjects

Keep this discovery

BibTeXRIS

Parth R. Brahmbhatt, Hari S. Ganesh, Styliani Avraamidou. 2026-04-02. Explicit Distributed MPC: Reducing Computation and Communication Load by Exploiting Facet Properties. https://arxiv.org/abs/2604.02177

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

On the suboptimality of stochastic MPC with varying constraint horizon

Enforcing stochastic state constraints over the full prediction horizon in Model Predictive Control (MPC) can be computationally demanding. Here we study stochastic MPC without terminal ingredients in which chance constraints are enforced only over a shorter constraint horizon. Using stochastic relaxed dynamic programming, we derive an explicit upper bound on the average expected closed-loop cost that depends on both prediction and constraint horizons. For linear quadratic problems with affine chance constraints and bounded uniform disturbances, we provide a deterministic reformulation via coordinate transformation and constraint tightening. Simulations illustrate the trade-off between computational effort and performance.

math.OC

Constrained Parameter Update Law for Adaptive Control

In this paper, constrained parameter update laws for adaptive control are developed using barrier constraints. An interpretation of the parameter update law from a constrained optimization problem, in which a regularized Barrier saddle function is formulated to incorporate parameter constraints using inverse and logarithmic barrier functions from interior-point methods. The resulting constrained update law is integrated with an adaptive trajectory tracking controller, enabling online learning of the unknown system model parameters. Forward invariance of the parameter estimate is established and Lyapunov stability of the closed-loop system with the constrained parameter update law is derived. The effectiveness of the proposed constrained adaptive control law is demonstrated through simulations, which validate its ability to maintain parameter estimates within prescribed bounds while ensuring convergence to the true parameter values and achieving steady state tracking performance.

math.OC