On Stochastic Continuous-Time Linear System Identification for Adaptive Stabilization
Reza Sadeghi Hafshejani, Mohamad Kazem Shirani Faradonbeh
Abstract
Learning to stabilize an unknown continuous-time stochastic linear system is a central problem in control theory and reinforcement learning. This paper numerically studies data-driven identification of such systems with possibly unstable dynamics for the purpose of stabilization. We present a method that learns a stabilizing gain from observed trajectories, and examine how the failure probability, namely the probability that the learned gain does not stabilize the system, depends on the amount of data, dimension, noise intensity, excitation, and controllability. Numerical experiments on an unstable batch-reactor benchmark show that the squared identification error decays inversely with the aggregate observation time, that is, the combined length of all trajectories, while the failure probability decays exponentially in the same quantity. Hence, despite instability, a single long trajectory can achieve similar stabilization performance to that of many short trajectories of the same total length. We also observe signal saturation: stronger excitation improves stabilization only logarithmically with the excitation strength. Finally, we show experimentally that accurate identification of the full dynamics is not necessary for successful stabilization.
Create a lesson
Related papers
Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits
Jongyeong Lee, Hyundam Yoo
How Risky Is Your Data-Driven Policy?
Omar Besbes, Alon Rieger
Two-Layer Random ReLU Networks Can Separate Disjoint Classes
Yichen Liu, Jianbin Yang
Point interpolation and distributional universality in flow-based generative models
Antonio Álvarez-López, Jingpu Cheng, Liyan Zhang et al.
Nonparametric GARCH: An Iterated Neural Estimator
Ruizhi Deng, Guohao Shen, Ngai Hang Chan
Error Accumulation in Second-Order Sequential Machine Unlearning
Chen Shang, Haolin Zou, Binghe Zhu et al.