Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
From MaRDI portal
Recommendations
- Hybrid Systems: Computation and Control
- Reachability computation for polynomial dynamical systems
- A Bernstein Polynomial Approach to Estimating Reachable Set of Periodic Piecewise Polynomial Systems
- Reachability analysis of polynomial systems using linear programming relaxations
- Polynomial level-set method for attractor estimation
- Under-approximating reach sets for polynomial continuous systems
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Inner-Approximating Reachable Sets for Polynomial Systems With Time-Varying Uncertainties
- On polyhedral estimation of the attainability domains of linear multistep systems
- Convergence of Polynomial Level Sets
Cited in
(8)- OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations
- A sums-of-squares extension of policy iterations
- Reachable set estimation for inertial Markov jump BAM neural network with partially unknown transition rates and bounded disturbances
- Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming
- Direct formal verification of liveness properties in continuous and hybrid dynamical systems
- Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
- Safety verification for regime-switching jump diffusions via barrier certificates
- An algorithm for computing robust forward invariant sets of two dimensional nonlinear systems
This page was built for publication: Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353361)
