← 研踪 PaperTrailarXiv:2611.02340 · v1
On Stochastic Continuous-Time Linear System Identification for Adaptive Stabilization
首次提交 2026-11-02 08:38
版本更新 2026-11-02 08:38
雷达观测 2026-11-04 23:42
摘要
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 \emph{signal saturation}: stronger excitation improves stabilization only logarithmically with the excitation strength. Finally, we show experimentally that accurate identification of the full dynamics is \emph{not} necessary for successful stabilization.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-02 08:38 · 最新观测版本
On Stochastic Continuous-Time Linear System Identification for Adaptive Stabilization
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 \emph{signal saturation}: stronger excitation improves stabilization only logarithmically with the excitation strength. Finally, we show experimentally that accurate identification of the full dynamics is \emph{not} necessary for successful stabilization.
查看此版本解读 →查看此版本原文 ↗