pith. sign in

arxiv: 2604.15982 · v1 · submitted 2026-04-17 · 📡 eess.SY · cs.SY

Robust predictive control design for uncertain discrete switched affine systems subject to an input delay

Gerson Portilla , Carolina Albea , Alexandre Seuret This is my paper

Pith reviewed 2026-05-10 08:56 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords robust controlswitched systemspredictive controlinput delayLyapunov functionlimit cycleuncertain affine systemsdiscrete time
0
0 comments X

The pith

A predictive min-switching controller with a Lyapunov function that includes prediction error stabilizes uncertain discrete switched affine systems with input delay.

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

The paper develops robust stabilization conditions for uncertain discrete switched affine systems that experience a one-step input delay. It employs a state-feedback predictive control law that switches by minimizing a cost and predicts future states using only the nominal model parameters. A specially constructed Lyapunov function tracks both the system state and the difference between actual and predicted states, proving that trajectories and predictions converge exponentially to a robust limit cycle. This is significant for applications involving switching systems like converters or vehicles where delays and model uncertainties are common, as it guarantees stability to periodic behavior rather than requiring exact matching.

Core claim

Robust stabilization conditions for uncertain switched affine systems subject to a unitary input delay are obtained through the Lyapunov framework and a min-switching state-feedback predictive control law. The result relies on a prediction scheme considering nominal system parameters. By constructing a Lyapunov function that considers the prediction error, exponential convergence of the system trajectories and system prediction to a robust limit cycle is demonstrated.

What carries the argument

The min-switching state-feedback predictive control law using nominal parameters, paired with a Lyapunov function that incorporates the prediction error to ensure robustness.

If this is right

  • The closed-loop system trajectories converge exponentially to a robust limit cycle.
  • The state predictions also converge to the same limit cycle.
  • Stabilization holds despite uncertainties in the system parameters.
  • The approach provides sufficient conditions that can be verified to design the controller gains.

Where Pith is reading between the lines

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

  • This could be extended to systems with longer or variable delays by adjusting the prediction horizon.
  • The robust limit cycle might allow for designing periodic reference tracking in practical switching applications.
  • Further analysis could quantify the size of the limit cycle or the convergence rate in terms of uncertainty bounds.
  • Simulation with real-world uncertainty realizations would test the practical tightness of the error bounds used in the proof.

Load-bearing premise

The bound on the prediction error induced by using nominal parameters in the predictor must hold and remain valid for the chosen min-switching law even when the actual plant has uncertainties.

What would settle it

A counterexample where, for uncertainties within the assumed bounds, the system trajectories do not converge to a bounded limit cycle or the Lyapunov function fails to decrease as required, such as divergence observed in simulation.

Figures

Figures reproduced from arXiv: 2604.15982 by Alexandre Seuret, Carolina Albea, Gerson Portilla.

Figure 1
Figure 1. Figure 1: State trajectory of uncertain system (7) using the [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Lyapunov function of the uncertain system (7) with [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
read the original abstract

Robust stabilization conditions for uncertain switched affine systems subject to a unitary input delay are presented. They are obtained through the Lyapunov framework and a min-switching state-feedback predictive control law. The result relies on a prediction scheme considering nominal system parameters. By constructing a Lyapunov function that considers the prediction error, we demonstrate the exponential convergence of the system trajectories and system prediction to a robust limit cycle. An example is provided to validate the obtained result.

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

1 major / 2 minor

Summary. The manuscript presents robust stabilization conditions for uncertain discrete switched affine systems subject to a unitary input delay. Conditions are derived via the Lyapunov framework using a min-switching state-feedback predictive control law based on nominal system parameters. A Lyapunov function incorporating the prediction error is constructed to prove exponential convergence of both the system trajectories and the predictions to a robust limit cycle. An example is included for validation.

Significance. If the central Lyapunov decrease condition holds uniformly, the result provides a useful LMI-based design tool for robust control of delayed switched affine systems, where convergence is to a limit cycle rather than an equilibrium. This is relevant for applications such as power electronics or hybrid dynamical systems. The explicit handling of prediction error under uncertainty is a positive technical feature.

major comments (1)
  1. [Lyapunov analysis and main theorem (prediction error bound derivation)] The central claim (abstract and main theorem) rests on the prediction error bound remaining valid under the specific min-switching law that selects the mode from nominal predictions. The derivation must explicitly verify that the LMI conditions ensure invariance of this bound for the actual closed-loop trajectory (i.e., that the Lyapunov decrease holds when switching depends on the nominal predicted state rather than treating switching as arbitrary or independent of the prediction). Without this step, the exponential convergence argument does not necessarily transfer to the uncertain delayed plant.
minor comments (2)
  1. [Main result statement] Clarify the precise definition of the 'robust limit cycle' (including its radius bound) and how it is characterized in the theorem statement.
  2. [Example section] In the numerical example, provide explicit values for the uncertainty bounds and the resulting LMI feasibility margins to allow reproducibility.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive evaluation of our manuscript and for the constructive major comment. We address the concern point by point below and will revise the paper to strengthen the presentation of the Lyapunov analysis.

read point-by-point responses

  1. Referee: [Lyapunov analysis and main theorem (prediction error bound derivation)] The central claim (abstract and main theorem) rests on the prediction error bound remaining valid under the specific min-switching law that selects the mode from nominal predictions. The derivation must explicitly verify that the LMI conditions ensure invariance of this bound for the actual closed-loop trajectory (i.e., that the Lyapunov decrease holds when switching depends on the nominal predicted state rather than treating switching as arbitrary or independent of the prediction). Without this step, the exponential convergence argument does not necessarily transfer to the uncertain delayed plant.

    Authors: We appreciate the referee's observation and agree that an explicit verification step strengthens the argument. The LMI conditions in the manuscript are derived to guarantee a uniform Lyapunov decrease for the augmented state (including prediction error) under the uncertainty bounds and for all admissible switching sequences. Because the min-switching law applied to the nominal prediction is one particular admissible sequence, the decrease condition holds for it as well. Nevertheless, to address the concern directly, we will revise the proof of the main theorem by inserting a short paragraph immediately after the statement of the LMIs. This paragraph will explicitly confirm that the prediction error bound remains invariant under the nominal-based min-switching policy: since the nominal prediction lies inside the ball whose radius is controlled by the Lyapunov function, and the LMIs ensure the decrease for every possible mode consistent with the uncertainty, the bound propagates to the actual uncertain trajectory. The revised manuscript will contain this clarification. revision: yes

Circularity Check

0 steps flagged

No circularity: Lyapunov-based error bound derived independently of switching law

full rationale

The paper constructs a Lyapunov function that explicitly incorporates the prediction error arising from nominal-parameter prediction on an uncertain plant. It then derives matrix inequalities ensuring exponential decrease of this augmented Lyapunov function, thereby proving convergence of both trajectories and predictions to a robust limit cycle. The limit cycle is not presupposed but shown to be attractive under the derived conditions. No step reduces a prediction to a fitted input by construction, nor does any central claim rest on a self-citation chain or imported uniqueness theorem. The min-switching law is applied to nominal predictions, and the error bound is required to hold for the resulting closed-loop behavior; the derivation treats this as a condition to be verified rather than assuming it a priori. The analysis is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard Lyapunov stability for discrete-time systems, the existence of a suitable min-switching rule, and the ability to bound the prediction error induced by parameter mismatch. No explicit free parameters or invented entities are visible in the abstract.

axioms (2)
  • domain assumption Existence of a quadratic Lyapunov function whose decrease can be certified by LMIs or similar conditions under the chosen switching law.
    Invoked implicitly when the paper states that exponential convergence is demonstrated via the Lyapunov framework.
  • domain assumption The uncertainty set is bounded and the nominal model is known exactly.
    Required for the prediction scheme to produce a well-defined error that can be absorbed into the Lyapunov analysis.

pith-pipeline@v0.9.0 · 5363 in / 1377 out tokens · 33595 ms · 2026-05-10T08:56:24.720425+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

23 extracted references · 23 canonical work pages

  1. [1]

    11em plus .33em minus .07em @technote 4000 4000 100 4000 4000 500 `\.=1000 = #1 #1 #1 0pt [0pt][0pt] #1 * \| ** #1 \@IEEEauthorblockNstyle \@IEEEauthorblockAstyle \@IEEEauthordefaulttextstyle \@IEEEauthorblockconfadjspace -0.25em \@IEEEauthorblockNtopspace 0.0ex \@IEEEauthorblockAtopspace 0.0ex \@IEEEauthorblockNinterlinespace 2.6ex \@IEEEauthorblockAinte...

    work page

  2. [2]

    Albea, C., Garcia, G., and Zaccarian, L. (2015). Hybrid dynamic modeling and control of switched affine systems: application to DC - DC converters. In 54th IEEE Conference on Decision and Control, 2264--2269

    work page 2015

  3. [3]

    Beneux, G., Riedinger, P., Daafouz, J., and Grimaud, L. (2017). Robust stabilization of switched affine systems with unknown parameters and its application to DC / DC F lyback converters. In 2017 American Control Conference, 4528--4533

    work page 2017

  4. [4]

    Beneux, G., Riedinger, P., Daafouz, J., and Grimaud, L. (2019). Adaptive stabilization of switched affine systems with unknown equilibrium points: Application to power converters. Automatica, 99, 82--91

    work page 2019

  5. [5]

    and Colaneri, P

    Bolzern, P. and Colaneri, P. (1988). The periodic L yapunov equation. SIAM Journal on Matrix Analysis and Applications, 9(4), 499--512

    work page 1988

  6. [6]

    and Geromel, J

    Deaecto, G. and Geromel, J. (2017). Stability analysis and control design of discrete-time switched affine systems. IEEE Trans. on Automatic Control, 62(8), 4058--4065

    work page 2017

  7. [7]

    Ebihara, Y., Arzelier, D., and Peaucelle, D. (2015). S-variable approach to LMI-based robust control. Springer London

    work page 2015

  8. [8]

    Egidio, L., Daiha, H., and Deaecto, G. (2020). Global asymptotic stability of limit cycle and H _ 2/ H _ performance of discrete-time switched affine systems. Automatica, 116, 108927

    work page 2020

  9. [9]

    and Deaecto, G.S

    Egidio, L.N. and Deaecto, G.S. (2019). Novel practical stability conditions for discrete-time switched affine systems. IEEE Trans. on Automatic Control, 64(11), 4705--4710

    work page 2019

  10. [10]

    Mahmoud, M.S. (2010). Switched Time-Delay Systems. Springer US

    work page 2010

  11. [11]

    Mazenc, F., Ahmed, S., and \"O zbay, H. (2017). State feedback stabilization of switched systems with delay: Trajectory based approach. In 2017 American Control Conference, 4540--4543

    work page 2017

  12. [12]

    Merch \'a n-Riveros, M.C., Albea, C., and Seuret, A. (2024). Data-driven control design for power converters approximated as switched affine systems and experimental validation. IEEE Trans. on Circuits and Systems II: Express Briefs

    work page 2024

  13. [13]

    Portilla, G., Albea, C., and Seuret, A. (2024). Predictive control design for discrete switched affine systems subject to a constant input delay. IEEE Control Systems Letters, 8, 2553--2558

    work page 2024

  14. [14]

    and Lennartson, B

    Rubensson, M. and Lennartson, B. (2000). Stability of limit cycles in hybrid systems using discrete-time L yapunov techniques. In 39th IEEE Conference on Decision and Control, 1397--1402

    work page 2000

  15. [15]

    Rubensson, M., Lennartson, B., and Pettersson, S. (1998). Convergence to limit cycles in hybrid systems-an example. IFAC Proceedings Volumes, 31(20), 683--688

    work page 1998

  16. [16]

    Sanchez, T., Polyakov, A., Fridman, E., and Hetel, L. (2019). A switching controller for a class of MIMO bilinear systems with time delay. IEEE Trans. on Automatic Control, 65(5), 2250--2256

    work page 2019

  17. [17]

    Scherer, C. (2001). Theory of robust control. Delft University of Technology, 1--160

    work page 2001

  18. [18]

    Serieye, M., Albea, C., Seuret, A., and Jungers, M. (2023). Attractors and limit cycles of discrete-time switching affine systems: nominal and uncertain cases. Automatica, 149, 110691

    work page 2023

  19. [19]

    and Ge, S.S

    Sun, Z. and Ge, S.S. (2011). Stability theory of switched dynamical systems. Springer London

    work page 2011

  20. [20]

    Theunisse, T.A., Chai, J., Sanfelice, R.G., and Heemels, W.M.H. (2015). Robust global stabilization of the DC - DC boost converter via hybrid control. IEEE Trans. on Circuits and Systems I: Regular Papers, 62(4), 1052--1061

    work page 2015

  21. [21]

    and Morgansen, K.A

    Vu, L. and Morgansen, K.A. (2010). Stability of time-delay feedback switched linear systems. IEEE Trans. on Automatic Control, 55(10), 2385--2390

    work page 2010

  22. [22]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key month note number organization pages publisher school series title type url volume year label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.state.consts #0 'before.all := #1 'mid.sent...

    work page

  23. [23]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

    work page