Reachability analysis of polynomial systems using linear programming relaxations
From MaRDI portal
Publication:4649293
Recommendations
- Reachability computation for polynomial dynamical systems
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
- Hybrid Systems: Computation and Control
- Reachability analysis of linear systems using support functions
Cited in
(30)- Under-approximating reach sets for polynomial continuous systems
- Comments on ``Reachability of polynomial matrix descriptions (PMDs) by G. F. Fragulis and A. I. G. Vardulakis
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
- Reachability analysis using message passing over tree decompositions
- Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
- Moment propagation of polynomial systems through Carleman linearization for probabilistic safety analysis
- Application of the reachability analysis for the iron homeostasis study
- Inner and outer approximate quantifier elimination for general reachability problems
- Trajectory Based Verification Using Local Finite-Time Invariance
- Under-approximating backward reachable sets by polytopes
- Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis
- Solving Linear Systems with Polynomial Parameter Dependency with Application to the Verified Solution of Problems in Structural Mechanics
- Adaptive directions for Bernstein-based polynomial set evolution
- Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
- Viability, viscosity, and storage functions in model-predictive control with terminal constraints
- Backward Reachability for Polynomial Systems on a Finite Horizon
- Hybrid Systems: Computation and Control
- Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
- Counterexample-Guided Refinement of Template Polyhedra
- Inner and outer approximations of arbitrarily quantified reachability problems
- Polynomial logical zonotope: a set representation for reachability analysis of logical systems
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- Inner approximated reachability analysis
- Algorithms for exact and approximate linear abstractions of polynomial continuous systems
- SOS-based solution approach to polynomial LPV system analysis and synthesis problems
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Sapo: reachability computation and parameter synthesis of polynomial dynamical systems
- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
- Reachability computation for polynomial dynamical systems
This page was built for publication: Reachability analysis of polynomial systems using linear programming relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649293)
