OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations

DOI10.1007/978-3-030-91265-9_14zbMath1505.65328OpenAlexW3216421739MaRDI QIDQ2154032

Meilun Li, Ruiqi Hu, Zhikun She

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-91265-9_14

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15)

Cites Work

• The flexible, extensible and efficient toolbox of level set methods
• Hybrid systems: From verification to falsification by combining motion planning and discrete search
• Safe over- and under-approximation of reachable sets for autonomous dynamical systems
• Accurate hybridization of nonlinear systems
• Computing the viability kernel using maximal reachable sets
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
• Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
• Algorithm 852
• Trajectory Based Verification Using Local Finite-Time Invariance
• Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems
• Under-Approximating Reach Sets for Polynomial Continuous Systems
• Over- and Under-Approximations of Reachable Sets With Series Representations of Evolution Functions
• Reachability analysis for hybrid systems with nonlinear guard sets
• Inner and outer reachability for the verification of control systems
• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
• Hybrid Systems: Computation and Control

This page was built for publication: OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations