Stabilization of Linear Switched Systems with Long Constant Input Delay via Average or Averaging Predictor Feedbacks
Andreas Katsanikakis, Nikolaos Bekiaris-Liberis
TL;DR
The paper tackles stabilization of linear switched systems with a long input delay $D$, where future switching is not fully observable. It develops two predictor-based delay-compensation strategies: an average predictor using a nominal average system with known minimum dwell time, and an averaging predictor feedback that combines exact per-mode predictors; both rely on backstepping and a suite of Lyapunov functionals to prove uniform exponential stability under small parameter variations and a dwell-time bound that grows with the delay. Theoretical guarantees are complemented by simulations showing stabilization and performance gains when dwell-time information is available, as well as robustness to modest delay perturbations. The work extends prior conference results by introducing new stability analyses and providing practical guidelines for predictor design under uncertain switching, with implications for networked control, transportation, and energy systems where delays and switching co-occur.
Abstract
We develop delay-compensating feedback laws for linear switched systems with time-dependent switching. Because the future values of the switching signal, which are needed for constructing an exact predictor-feedback law, may be unavailable at current time, the key design challenge is how to construct a proper predictor state. We resolve this challenge constructing two alternative, average predictor-based feedback laws. The first is viewed as a predictor-feedback law for a particular average system, properly modified to provide exact state predictions over a horizon that depends on a minimum dwell time of the switching signal (when it is available). The second is, essentially, a modification of an average of predictor feedbacks, each one corresponding to the fixed-mode predictor-feedback law. We establish that under the control laws introduced, the closed-loop systems are (uniformly) exponentially stable, provided that the differences among system's matrices and among (nominal stabilizing) controller's gains are sufficiently small, with a size that is inversely proportional to the delay length. Since no restriction is imposed on the delay, such a limitation is inherent to the problem considered (in which the future switching signal values are unavailable), and thus, it cannot be removed. The stability proof relies on multiple Lyapunov functionals constructed via backstepping and derivation of solutions' estimates for quantifying the difference between average and exact predictor states. We present consistent numerical simulation results, which illustrate the necessity of employing the average predictor-based laws and demonstrate the performance improvement when the knowledge of a minimum dwell time is properly utilized for improving state prediction accuracy.
