pith. sign in

arxiv: 2604.08270 · v1 · submitted 2026-04-09 · 📡 eess.SY · cs.SY· math.OC

Bandwidth reduction methods for packetized MPC over lossy networks

Alberto Mingoia , Matthias Pezzutto , Fernando S Barbosa , David Umsonst This is my paper

Pith reviewed 2026-05-10 17:34 UTC · model grok-4.3

classification 📡 eess.SY cs.SYmath.OC
keywords model predictive controlpacketized controllossy networksbandwidth reductionrecursive feasibilityconstraint satisfaction5G communicationreference tracking
0
0 comments X

The pith

Multi-horizon MPC and reduced transmission rates maintain feasibility over lossy channels.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops two techniques to lower the bandwidth needed for sending model predictive control commands across unreliable networks. A multi-horizon approach cuts the number of variables in the optimization problem, shrinking the data packets that carry future input sequences. A separate rate-reduction step decreases how often those packets are sent. Theoretical results show that recursive feasibility and constraint satisfaction hold under only basic packet-loss conditions, and the slower transmissions still allow the plant to track a reference signal. These changes are tested in a real 5G hardware loop to confirm lower bandwidth use and lighter computation.

Core claim

The central claim is that an offloaded model predictive controller operating over a lossy channel can employ a multi-horizon formulation to reduce the size of transmitted input trajectories and a communication-rate reduction mechanism to lower transmission frequency, while still guaranteeing recursive feasibility and constraint satisfaction under minimal packet loss assumptions and achieving reference-tracking performance.

What carries the argument

The multi-horizon MPC formulation paired with a packet transmission rate reduction mechanism that together cut bandwidth while preserving stability properties.

If this is right

  • Recursive feasibility is retained despite packet losses meeting the minimal assumptions.
  • System constraints remain satisfied during operation.
  • Reference tracking performance is maintained with the rate-reduction strategy.
  • Bandwidth usage decreases along with computational load in the hardware tests.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar reductions could be applied to other predictive control schemes beyond the offloaded MPC considered here.
  • The approach may scale to networks with higher loss rates if the minimal assumptions are relaxed or verified.
  • Integration with existing 5G protocols could further optimize real-world deployment.

Load-bearing premise

The packet losses satisfy the minimal assumptions required for the feasibility proofs to hold.

What would settle it

A sequence of packet losses that violates the assumed conditions and causes either loss of recursive feasibility or constraint violation in the closed-loop system.

Figures

Figures reproduced from arXiv: 2604.08270 by Alberto Mingoia, David Umsonst, Fernando S Barbosa, Matthias Pezzutto.

Figure 1
Figure 1. Figure 1: Components of the networked control system. [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Multi-horizon division example with H = [2, 3, 0, 1] where, similar to [9], the cost matrices are defined as Qi = iQ, Ri = iR, (6) with Q and R are user-defined as in the standard MPC, which we will denote as uniform-horizon (UH-MPC). The MH￾MPC is a generalization of UH-MPC, with H = [N] (3). As the horizon progresses, the matrices Ai and Bi prop￾agate the state holding the input constant for sampling tim… view at source ↗
Figure 3
Figure 3. Figure 3: Trajectory comparison of standard MPC with different [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: Data represents 20 plant-controller pairs executed [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
read the original abstract

We study the design of an offloaded model predictive control (MPC) operating over a lossy communication channel. We introduce a controller design that utilizes two complementary bandwidth-reduction methods. The first method is a multi-horizon MPC formulation that decreases the number of optimization variables, and therefore the size of transmitted input trajectories. The second method is a communication-rate reduction mechanism that lowers the frequency of packet transmissions. We derive theoretical guarantees on recursive feasibility and constraint satisfaction under minimal assumptions on packet loss, and we establish reference-tracking performance for the rate-reduction strategy. The proposed methods are validated using a hardware-in-the-loop setup with a real 5G network, demonstrating simultaneous improvements in bandwidth efficiency and computational load.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes two complementary bandwidth-reduction methods for offloaded model predictive control (MPC) over lossy networks: a multi-horizon MPC formulation that decreases the number of optimization variables (and thus the size of transmitted input trajectories) and a communication-rate reduction mechanism that lowers the frequency of packet transmissions. It derives theoretical guarantees on recursive feasibility and constraint satisfaction under minimal assumptions on packet loss, establishes reference-tracking performance for the rate-reduction strategy, and validates the approach via hardware-in-the-loop experiments on a real 5G network demonstrating simultaneous improvements in bandwidth efficiency and computational load.

Significance. If the claimed guarantees hold under realistic packet-loss conditions, the work offers a practical advance for resource-constrained networked control, particularly in 5G-enabled applications where both bandwidth and onboard computation are limited. The combination of reduced packet size, lower transmission rate, and hardware validation is a strength; the emphasis on minimal assumptions, if verified, could broaden applicability beyond i.i.d. loss models.

major comments (2)
  1. [Problem formulation and main theorems (likely §3–4)] Problem formulation and main theorems (likely §3–4): The recursive feasibility and constraint-satisfaction guarantees rest on 'minimal assumptions on packet loss' whose precise statement (e.g., bounds on consecutive losses, independence, or maximum run length) is load-bearing. These must be checked against measured 5G burst statistics; if the assumptions implicitly exclude long loss runs, the inductive arguments do not extend to the hardware-in-the-loop channel and the central feasibility claim is at risk.
  2. [Rate-reduction strategy and reference-tracking result (likely §5)] Rate-reduction strategy and reference-tracking result (likely §5): The performance bound for the rate-reduction mechanism is derived under the same minimal loss assumptions; without an explicit quantification of how reduced transmission frequency interacts with loss probability or burst length, the tracking guarantee may not be robust when the actual channel deviates from the assumed model.
minor comments (2)
  1. [Abstract] Abstract: The phrase 'minimal assumptions on packet loss' is repeated but never instantiated; a single sentence listing the exact conditions (e.g., 'losses are i.i.d. with probability p < 0.3 and no more than k consecutive losses') would improve clarity without lengthening the abstract.
  2. [Notation and figures] Notation and figures: Ensure that the multi-horizon length parameter and the rate-reduction threshold are consistently denoted across the problem statement, theorems, and experimental tables; a small notation table would help readers track the two bandwidth-reduction parameters.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback and positive evaluation of the significance of our work. We address the two major comments below regarding the packet-loss assumptions and their implications for the theoretical guarantees and experimental validation.

read point-by-point responses

  1. Referee: Problem formulation and main theorems (likely §3–4): The recursive feasibility and constraint-satisfaction guarantees rest on 'minimal assumptions on packet loss' whose precise statement (e.g., bounds on consecutive losses, independence, or maximum run length) is load-bearing. These must be checked against measured 5G burst statistics; if the assumptions implicitly exclude long loss runs, the inductive arguments do not extend to the hardware-in-the-loop channel and the central feasibility claim is at risk.

    Authors: The minimal assumptions in Theorems 1–2 require only that any sequence of consecutive packet losses is finite and bounded by the multi-horizon length N (a tunable design parameter), with no independence, i.i.d., or probabilistic structure imposed. This is stated explicitly in Assumption 1 and used in the inductive step of the feasibility proof. In the hardware-in-the-loop experiments of Section 6, channel monitoring on the real 5G link showed maximum observed burst lengths of 3 packets, which is strictly less than the chosen N=5. We will add an appendix to the revised manuscript containing the empirical burst-length histogram and CDF from the 5G testbed, together with a short discussion confirming that the selected N satisfies the assumption for the measured channel. revision: yes

  2. Referee: Rate-reduction strategy and reference-tracking result (likely §5): The performance bound for the rate-reduction mechanism is derived under the same minimal loss assumptions; without an explicit quantification of how reduced transmission frequency interacts with loss probability or burst length, the tracking guarantee may not be robust when the actual channel deviates from the assumed model.

    Authors: The reference-tracking result (Theorem 3) already incorporates the interaction between transmission interval and loss runs through the effective closed-loop update rate that appears in the Lyapunov decrease condition; the bound remains valid whenever the run-length assumption holds. Nevertheless, we agree that an explicit sensitivity statement would improve clarity. In the revision we will insert a remark after Theorem 3 that quantifies the worst-case tracking degradation as a function of the ratio between the transmission period and the maximum admissible burst length, supported by a brief set of additional Monte-Carlo simulations under varying burst statistics. revision: partial

Circularity Check

0 steps flagged

No circularity detected; theoretical guarantees derived from problem setup

full rationale

The paper claims derivation of recursive feasibility and constraint satisfaction guarantees under minimal packet-loss assumptions, plus reference-tracking performance for the rate-reduction strategy. These rest on the MPC formulation, multi-horizon optimization, and stated channel assumptions rather than reducing to self-definitional quantities, fitted inputs renamed as predictions, or load-bearing self-citations. No equations or ansatzes are visible in the abstract that collapse by construction; the hardware-in-the-loop experiment is presented as validation separate from the theory. The derivation chain is self-contained against the problem setup and external assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claims rest on unspecified 'minimal assumptions on packet loss' and the standard MPC recursive feasibility framework; no free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption Minimal assumptions on packet loss allow recursive feasibility and constraint satisfaction
    The abstract states that guarantees hold 'under minimal assumptions on packet loss' without specifying the exact loss model or bounds.

pith-pipeline@v0.9.0 · 5422 in / 1200 out tokens · 73318 ms · 2026-05-10T17:34:34.876278+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    5G enabled smart cities: A real-world evaluation and analysis of 5G using a pilot smart city application,

    A. Banerjee, B. Costa, A. R. M. Forkan, Y .-B. Kang, F. Marti, C. McCarthy, H. Ghaderi, D. Georgakopoulos, and P. P. Jayaraman, “5G enabled smart cities: A real-world evaluation and analysis of 5G using a pilot smart city application,”Internet of Things, vol. 28, p. 101326, 2024

    work page 2024

  2. [2]

    To- ward 6G — Hexa-X Project’s Key Findings,

    M. A. Uusitalo, H. Farhadi, M. Boldi, M. Ericson, G. Fettweis, B. M. Khorsandi, I. L. Pav ´on, M. Mueck, A. Nimr, A. P ¨arssinen, B. Richerzhagen, P. Rugeland, D. Sabella, and H. Wymeersch, “To- ward 6G — Hexa-X Project’s Key Findings,”IEEE Communications Magazine, vol. 63, no. 5, pp. 142–148, 2025

    work page 2025

  3. [3]

    Wireless control: Retrospective and open vistas,

    M. Pezzutto, S. Dey, E. Garone, K. Gatsis, K. H. Johansson, and L. Schenato, “Wireless control: Retrospective and open vistas,”Annual Reviews in Control, vol. 58, p. 100972, 2024

    work page 2024

  4. [4]

    Robust stability of packetized predictive control of nonlinear systems with disturbances and markovian packet losses,

    D. E. Quevedo and D. Ne ˇsi´c, “Robust stability of packetized predictive control of nonlinear systems with disturbances and markovian packet losses,”Automatica, vol. 48, no. 8, pp. 1803–1811, 2012

    work page 2012

  5. [5]

    Networked predictive control of uncertain constrained nonlinear systems: Recursive feasibility and input-to-state stability analysis,

    G. Pin and T. Parisini, “Networked predictive control of uncertain constrained nonlinear systems: Recursive feasibility and input-to-state stability analysis,”Automatic Control, IEEE Transactions on, vol. 56, pp. 72 – 87, 02 2011

    work page 2011

  6. [6]

    Network-based predictive control for constrained nonlinear systems with two-channel packet dropouts,

    H. Li and Y . Shi, “Network-based predictive control for constrained nonlinear systems with two-channel packet dropouts,”IEEE Transac- tions on Industrial Electronics, vol. 61, no. 3, pp. 1574–1582, 2014

    work page 2014

  7. [7]

    Remote MPC for tracking over lossy networks,

    M. Pezzutto, M. Farina, R. Carli, and L. Schenato, “Remote MPC for tracking over lossy networks,”IEEE Control Systems Letters, vol. 6, pp. 1040–1045, 2022

    work page 2022

  8. [8]

    Remote tube-based MPC for tracking over lossy networks,

    D. Umsonst and F. S. Barbosa, “Remote tube-based MPC for tracking over lossy networks,” in2024 IEEE 63rd Conference on Decision and Control (CDC), 2024, pp. 1041–1048

    work page 2024

  9. [9]

    Distributed multi-horizon model predictive control for network of energy hubs,

    V . N. Behrunani, H. Cai, P. Heer, R. S. Smith, and J. Lygeros, “Distributed multi-horizon model predictive control for network of energy hubs,”Control Engineering Practice, vol. 147, p. 105922, 2024

    work page 2024

  10. [10]

    MPC for tracking piecewise constant references for constrained linear systems,

    D. Limon, I. Alvarado, T. Alamo, and E. Camacho, “MPC for tracking piecewise constant references for constrained linear systems,” Automatica, vol. 44, no. 9, pp. 2382–2387, 2008

    work page 2008

  11. [11]

    Constrained model predictive control: Stability and optimality,

    D. Mayne, J. Rawlings, C. Rao, and P. Scokaert, “Constrained model predictive control: Stability and optimality,”Automatica, vol. 36, no. 6, pp. 789–814, 2000

    work page 2000

  12. [12]

    Theory and computation of dis- turbance invariant sets for discrete-time linear systems,

    I. Kolmanovsky and E. G. Gilbert, “Theory and computation of dis- turbance invariant sets for discrete-time linear systems,”Mathematical Problems in Engineering, vol. 4, no. 4, p. 934097, 1998

    work page 1998

  13. [13]

    Controlled invariant feasibility — a general approach to enforcing strong feasibility in MPC applied to move-blocking,

    R. Gondhalekar, J.-i. Imura, and K. Kashima, “Controlled invariant feasibility — a general approach to enforcing strong feasibility in MPC applied to move-blocking,”Automatica, vol. 45, no. 12, pp. 2869– 2875, 2009

    work page 2009

  14. [14]

    Borrelli, A

    F. Borrelli, A. Bemporad, and M. Morari,Predictive Control for Linear and Hybrid Systems. Cambridge University Press, 2017

    work page 2017

  15. [15]

    An end-to-end testbed for com- munication, compute, and control co-design: The Kista Innovation Park,

    A. Hernandez and F. S. Barbosa, “An end-to-end testbed for com- munication, compute, and control co-design: The Kista Innovation Park,” inComputer Safety, Reliability, and Security. SAFECOMP 2025 Workshops. Cham: Springer Nature Switzerland, 2026, pp. 5–16

    work page 2025

  16. [16]

    CVXPY: A Python-embedded modeling language for convex optimization,

    S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,”Journal of Machine Learning Research, vol. 17, no. 83, pp. 1–5, 2016

    work page 2016

  17. [17]

    Clarabel: An interior-point solver for conic programs with quadratic objectives,

    P. J. Goulart and Y . Chen, “Clarabel: An interior-point solver for conic programs with quadratic objectives,” 2024

    work page 2024