Reachability analysis of polynomial systems using linear programming relaxations
DOI10.1007/978-3-642-33386-6_12zbMATH Open1375.68077OpenAlexW187235213MaRDI QIDQ4649293FDOQ4649293
Authors: Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang, Antoine Girard 
Publication date: 21 November 2012
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33386-6_12
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
Linear programming (90C05) Nonconvex programming, global optimization (90C26) Specification and verification (program logics, model checking, etc.) (68Q60) Discrete-time control/observation systems (93C55)
Cited In (18)
- 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
- Polynomial Level-Set Method for Polynomial System Reachable Set Estimation
- Trajectory Based Verification Using Local Finite-Time Invariance
- 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
- 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
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- 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
- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
- Reachability computation for polynomial dynamical systems
Uses Software
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)
