Safety Filter for Robust Disturbance Rejection via Online Optimization
Joyce Lai, Peter Seiler
TL;DR
The paper tackles instability risks in disturbance rejection schemes that rely on online convex optimization when plant models are uncertain. It introduces a safety filter implemented as an adaptive FIR disturbance-rejection block whose gains are constrained by a scaled small-gain condition to guarantee robust finite-gain stability, while minimizing deviations from the unconstrained OCO command through an $\infty$-norm objective. The main contributions are (i) defining a safe gain set $\mathcal{F}_\beta$, (ii) proving an explicit online solution for the safety filter and a saturating corollary that avoids explicit coefficient computation, and (iii) demonstrating via an RLS-based AFDR example that robustness is preserved under model uncertainty with improved disturbance rejection. This approach enables online, provably safe disturbance rejection in high-precision control applications where OCO is used for learning disturbance characteristics, with practical saturation-based implementation.
Abstract
Disturbance rejection in high-precision control applications can be significantly improved upon via online convex optimization (OCO). This includes classical techniques such as recursive least squares (RLS) and more recent, regret-based formulations. However, these methods can cause instabilities in the presence of model uncertainty. This paper introduces a safety filter for systems with OCO in the form of adaptive finite impulse response (FIR) filtering to ensure robust disturbance rejection. The safety filter enforces a robust stability constraint on the FIR coefficients while minimally altering the OCO command in the $\infty$-norm cost. Additionally, we show that the induced $\ell_\infty$-norm allows for easy online implementation of the safety filter by directly limiting the OCO command. The constraint can be tuned to trade off robustness and performance. We provide a simple example to demonstrate the safety filter.
