arrow
Return

Safely Learning Dynamical Systems

delete2025-02-04
delete0
PRE
AI
A
Amir Ali Ahmadi
A
Abraar Chaudhry *
V
Vikas Sindhwani
S
Stephen Tu
DOI:10.1007/s10208-025-09689-8delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A fundamental challenge in learning an unknown dynamical system is to reduce model uncertainty by making measurements while maintaining safety. In this work, we formulate a mathematical definition of what it means to safely learn a dynamical system by sequentially deciding where to initialize the next trajectory. In our framework, the state of the system is required to stay within a safety region for a horizon of T time steps under the action of all dynamical systems that (i) belong to a given initial uncertainty set, and (ii) are consistent with the information gathered so far. For our first set of results, we consider the setting of safely learning a linear dynamical system involving n states. For the case T = 1, we present a linear programming-based algorithm that either safely recovers the true dynamics from at most n trajectories, or certifies that safe learning is impossible. For T = 2, we give a semidefinite representation of the set of safe initial conditions and show that inverted right perpendicularn/2inverted left perpendicular trajectories generically suffice for safe learning. For T = infinity, we provide semidefinite representable inner approximations of the set of safe initial conditions and show that one trajectory generically suffices for safe learning. Finally, we extend a number of our results to the cases where the initial uncertainty set contains sparse, low-rank, or permutation matrices, or when the dynamical system involves a control input. Our second set of results concerns the problem of safely learning a general class of nonlinear dynamical systems. For the case T = 1, we give a second-order cone programming based representation of the set of safe initial conditions. For T = infinity, we provide semidefinite representable inner approximations to the set of safe initial conditions. We showhowone can safely collect trajectories and fit a polynomial model of the nonlinear dynamics that is consistent with the initial uncertainty set and best agrees with the observations. We also present extensions of some of our results to the cases where the measurements are noisy or the dynamical system involves disturbances.
Keywords:
Learning dynamical systems
Safe learning
Uncertainty quantification
Robust optimization
Conic optimization
37M
37N
90C

Journal

Foundations of Computational Mathematics cover
Foundations of Computational Mathematics
IF:
2.7
Papers:
70
Citations:
2.4K

Organization

G
Georgia Institute of Technology
Scholars:
1.8W
Papers: 1.4W
Citations: 5.9W
P
Princeton University
Scholars:
2.1W
Papers: 2.3W
Citations: 5.1W
Cited Papers

Cited Papers

On the Sample Complexity of the Linear Quadratic Regulator
err2019-08-05
err0
PREAI
errSarah Dean; Horia Mania; Nikolai Matni; Benjamin Recht; Stephen Tu
errShare
errSave
Data-Driven Science and Engineering
err
IF0
err2019-02-15
err0
errOAAI
errSteven L. Brunton; J. Nathan Kutz
errShare
errSave
Learning-Based Model Predictive Control for Safe Exploration
err2018-12-01
err0
errOAAI
errTorsten Koller; Felix Berkenkamp; Matteo Turchetta; Andreas Krause
errShare
errSave
Learning Dynamical Systems with Side Information
err2023-02-09
err3
errOAAI
errAhmadi, Amir Ali; El Khadir, Bachir
errShare
errSave
A Scalable Controlled Set Invariance Framework with Practical Safety Guarantees
err2019-12-01
err0
PREAI
errThomas Gurriet; Mark Mote; Andrew Singletary; Eric Feron; Aaron D. Ames
errShare
errSave
Applications of second-order cone programming
err1998-11-01
err0
errOAAI
errMiguel Sousa Lobo; Lieven Vandenberghe; Stephen Boyd; Hervé Lebret
errShare
errSave
Robust-to-Dynamics Optimization
err2024-04-16
err0
errOAAI
errAmir Ali Ahmadi; Oktay Günlük
errShare
errSave
researcher View more