Under-Approximating Reach Sets for Polynomial Continuous Systems
From MaRDI portal
Publication:4561432
DOI10.1145/3178126.3178133zbMath1417.93064OpenAlexW2796287609MaRDI QIDQ4561432
Naijun Zhan, Bai Xue, Martin Fränzle
Publication date: 6 December 2018
Published in: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3178126.3178133
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations ⋮ A generalization of Bellman's equation with application to path planning, obstacle avoidance and invariant set estimation ⋮ Linearization, model reduction and reachability in nonlinear ODEs ⋮ Reachability analysis using dissipation inequalities for uncertain nonlinear systems ⋮ Reachable set computation of linear systems with nonconvex constraints via convex optimization
Uses Software
This page was built for publication: Under-Approximating Reach Sets for Polynomial Continuous Systems
