82.5SYMar 20
End-to-end guarantees for indirect data-driven control of bilinear systems with finite stochastic dataNicolas Chatzikiriakos, Robin Strässer, Frank Allgöwer et al.
In this paper we propose an end-to-end algorithm for indirect data-driven control for bilinear systems with stability guarantees. We consider the case where the collected i.i.d. data is affected by probabilistic noise with possibly unbounded support and leverage tools from statistical learning theory to derive finite sample identification error bounds. To this end, we solve the bilinear identification problem by solving a set of linear and affine identification problems, by a particular choice of a control input during the data collection phase. We provide a priori as well as data-dependent finite sample identification error bounds on the individual matrices as well as ellipsoidal bounds, both of which are structurally suitable for control. Further, we integrate the structure of the derived identification error bounds in a robust controller design to obtain an exponentially stable closed-loop. By means of an extensive numerical study we showcase the interplay between the controller design and the derived identification error bounds. Moreover, we note appealing connections of our results to indirect data-driven control of general nonlinear systems through Koopman operator theory and discuss how our results may be applied in this setup.
51.5OCApr 1
Discrete-Time Event-Triggered Extremum SeekingVictor Hugo Pereira Rodrigues, Tiago Roux Oliveira, Miroslav Krstić et al.
This paper proposes a discrete-time event-triggered extremum seeking control scheme for real-time optimization of nonlinear systems. Unlike conventional discrete-time implementations relying on periodic updates, the proposed approach updates the control input only when a state-dependent triggering condition is satisfied, reducing unnecessary actuation and communication. The resulting closed-loop system combines extremum seeking with an event-triggering mechanism that adaptively determines the input update instants. Using discrete-time averaging and Lyapunov analysis, we establish practical convergence of the trajectories to a neighborhood of the unknown extremum point and show exponential stability of the associated average dynamics. The proposed method preserves the optimization capability of classical extremum seeking while significantly reducing the number of input updates. Simulation results illustrate the effectiveness of the approach for resource-aware real-time optimization.
67.9SYApr 1
Beyond Bounded Noise: Stochastic Set-Membership Estimation for Nonlinear SystemsFelix Brändle, Nicolas Chatzikiriakos, Andrea Iannelli et al.
In this paper, we derive a novel procedure for set-membership estimation of dynamical systems affected by stochastic noise with unbounded support. By employing a bound on the sample covariance matrix, we are able to provide a finite-sample uncertainty set containing the true system parameters with high probability. Our approach can be natively applied to a wide class of nonlinear systems affected by sub- Gaussian noise. Through our analysis, we provide conditions under which the proposed uncertainty set converges to the true system parameters and establish an upper bound on the convergence rate. The proposed uncertainty set can be used directly for the synthesis of robust controllers with probabilistic stability and performance guarantees. Concluding numerical examples demonstrate the advantages of the proposed formulation over established approaches.
46.1SYMar 20
A Controller Synthesis Framework for Weakly-Hard Control SystemsMarc Seidel, Martina Maggio, Frank Allgöwer
Deadline misses are more common in real-world systems than one may expect. The weakly-hard task model has become a standard abstraction to describe and analyze how often these misses occur, and has been especially used in control applications. Most existing control approaches check whether a controller manages to stabilize the system it controls when its implementation occasionally misses deadlines. However, they usually do not incorporate deadline-overrun knowledge during the controller synthesis process. In this paper, we present a framework that explicitly integrates weakly-hard constraints into the control design. Our method supports various overrun handling strategies and guarantees stability and performance under weakly-hard constraints. We validate the synthesized controllers on a Furuta pendulum, a representative control benchmark. The results show that constraint-aware controllers significantly outperform traditional designs, demonstrating the benefits of proactive and informed synthesis for overrun-aware real-time control.
24.2SYApr 1
Robust IMMPC: An Offset-free MPC for Rejecting Unknown DisturbancesFelix Brändle, Frank Allgöwer
Output regulation is the problem of finding a control input to asymptotically track reference trajectories and reject disturbances. This can be addressed by using the internal model principle to embed a model of the disturbance in the controller. In this work, we present a Model Predictive Control scheme to achieve offset-free control. To do so, we extend Internal Model MPC to general bounded disturbances that must not be generated by the disturbance model. We show recursive feasibility, constraint satisfaction, and provide convergence conditions for the optimal reachable output. The proposed controller is validated on a four-tank system.