Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
From MaRDI portal
Publication:4649293
DOI10.1007/978-3-642-33386-6_12zbMath1375.68077OpenAlexW187235213MaRDI QIDQ4649293
Mohamed Amin Ben Sassi, Romain Testylier, Antoine Girard, Thao Dang
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
Nonconvex programming, global optimization (90C26) Linear programming (90C05) Discrete-time control/observation systems (93C55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems ⋮ Viability, viscosity, and storage functions in model-predictive control with terminal constraints ⋮ A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Reachability computation for polynomial dynamical systems ⋮ Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
Uses Software
This page was built for publication: Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
