Organizations: Institute of Mechanical Engineering, Ecole Polytechnique Fédérale de Lausanne (EPFL), CH-1015 Lausanne, Switzerland. · Department of Engineering Science, University of Oxford, United Kingdom
The growing complexity of modern control tasks calls for controllers that can react online as objectives and disturbances change, while preserving closed-loop stability. Recent approaches for improving the performance of nonlinear systems while preserving closed-loop stability rely on time-invariant recurrent neural-network controllers, but offer no principled way to update the controller during operation. Most importantly, switching from one stabilizing policy to another can itself destabilize the closed-loop. We address this problem by introducing a stability-preserving update mechanism for nonlinear, neural-network-based controllers. Each controller is modeled as a causal operator with bounded ℓp-gain, and we derive gain-based conditions under which the controller may be updated online. These conditions yield two practical update schemes, time-scheduled and state-triggered, that guarantee the closed-loop remains ℓp-stable after any number of updates. Our analysis further shows that stability is decoupled from controller optimality, allowing approximate or early-stopped controller synthesis. We demonstrate the approach on nonlinear systems with time-varying objectives and disturbances, and show consistent performance improvements over static and naive online baselines while guaranteeing stability.
Figures & tables
Fig. 1 : IMC architecture parametrizing all stability-preserving controllers via a free operator \mathbfcalM∈Lp .
Fig. 2 : Qualitative closed-loop behavior of Algorithm 1 in the two case studies. (Left) Mountains problem at τ=0.8s . Green: obstacles. Colored lines: predicted trajectories over [τ,τ+1.25] ; black: executed trajectory over [0,τ) ; gray dashed: predicted continuation after τ . Colored disks show agent positions and radii. (Right) Dynamic-obstacles problem at τ1=9.3s . Gray: executed trajectory; red dash-dot: reference; blue: predicted trajectory over [τ1,τ1+0.5] ; green: obstacle positions at τ1 .
Fig. 3 : Mountains problem - Total cost (log scale) over 50 runs: nominal scenario (center) and perturbed scenario with impulse disturbances ( 14 ) (right).
Fig. 4 : Dynamic obstacles problem - Total cost (log scale) over 50 runs for the offline controller in [ 10 ] , a receding-horizon open-loop (RHO) planner, and the proposed approach.