核心概念
Characterizing the convex hulls of reachable sets simplifies estimation algorithms efficiently.
摘要
The article discusses the challenges of computing reachable sets in control systems and proposes a new approach to estimate the convex hulls of reachable sets efficiently. It introduces an algorithm based on characterizing the convex hulls of reachable sets using solutions of an ordinary differential equation with initial conditions on the sphere. The article also explores the structure of the boundary of reachable convex hulls and provides error bounds for the estimation algorithm. Applications to neural feedback loop analysis and robust MPC are discussed.
I. Introduction
- Reachability analysis is crucial in control theory and robust controller design.
- It involves characterizing all states a system can reach in the future.
- Reachability analysis certifies feedback loop performance and designs robust controllers.
- Robust MPC constructs tubes around nominal state trajectories to ensure constraint satisfaction.
II. Related Work
- Existing methods seek convex over-approximations of reachable sets.
- Various numerical methods and approaches are used for forward reachable sets of nonlinear systems.
- The deep connection between geometry, reachability analysis, and optimal control is explored.
III. Notations and Preliminary Results
- Definitions and notations related to Euclidean inner product, norms, and convex geometry are provided.
- Differential geometry concepts and Gauss maps of common sets are discussed.
IV. The Structure of H(Xt)
- The main contribution is a new characterization of the convex hulls of reachable sets.
- The convex hulls of reachable sets can be computed efficiently using an ordinary differential equation.
- An estimation algorithm is proposed to estimate the convex hulls of reachable sets accurately.
V. Proof of Theorem 1
- The proof of Theorem 1 is presented for cases where X0 is a singleton or an ovaloid.
- The convex hulls of reachable sets are characterized as the convex hulls of solutions to an ODE for different initial conditions.
VI. The Boundary Structure of H(Xt), Geometric Estimation, and Error Bounds
- Error bounds for estimating reachable convex hulls are discussed.
- The boundaries of the convex hulls of reachable sets are shown to be smooth submanifolds under certain assumptions.
- An optimal control scheme is proposed for estimating reachable convex hulls efficiently.
统计
ODEd0의 해결을 위한 방향 d0에 대한 해가 존재합니다.
ODEd0의 해결은 초기 조건 d0에 의해 결정됩니다.
引用
"Our main contribution is a new characterization of the convex hulls of reachable sets of dynamical systems."
"The convex hulls of reachable sets can now be computed as the convex hulls of solutions of an ODE for different initial conditions."