Search arXivSearch

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 papers

A simple derivation of the Kalman filter

In this lecture note, we present a concise and self-contained derivation of the discrete-time Kalman filter equations that requires only a basic understanding of least squares estimation. The treatment is designed to minimize mathematical overhead while preserving both rigor and generality.

math.OC

Comment on "Event-Triggered Stabilization of Linear Time-Delay Systems via Halanay-Type Inequality"

This comment revisits Lemma 1 in [1], which plays a central role in the event-triggered stabilization analysis developed therein. We identify technical gaps in the proof of the lemma and provide a corrected argument. In particular, careful treatment of the exponentially decaying term shows that its decay rate must be retained in the resulting convergence estimate. The statement of the original lemma, with the exponential decay rate determined by the minimum of the characteristic decay rate and the decay rate of this term, remains valid.

math.OC