Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
From MaRDI portal
Recommendations
Cites work
- A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
- A note on two problems in connexion with graphs
- Controlling a Class of Nonlinear Systems on Rectangles
- Diagnostic Information for Realizability
- Enhancing model checking in verification by AI techniques
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 2080065 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Markov decision processes and regular events
- Model repair for probabilistic systems
- Receding horizon control for temporal logic specifications
Cited in
(46)- An improved algorithm for the control synthesis of nonlinear sampled switched systems
- Reachability analysis of nonlinear systems using hybridization and dynamics scaling
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Adaptive reachability algorithms for nonlinear systems using abstraction error analysis
- Reachability analysis of a general class of neural ordinary differential equations
- Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications
- OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations
- Functional sets with typed symbols: Mixed zonotopes and polynotopes for hybrid nonlinear reachability and filtering
- Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming
- Set-based control for disturbed piecewise affine systems with state and actuation constraints
- Reachability analysis using message passing over tree decompositions
- Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems
- A higher order method for input-affine uncertain systems
- Scalable static hybridization methods for analysis of nonlinear systems
- Verification of Hybrid Systems
- On Reachability Analysis of Nonlinear Systems with Joint Integral Constraints
- Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
- scientific article; zbMATH DE number 1956619 (Why is no real title available?)
- scientific article; zbMATH DE number 1956649 (Why is no real title available?)
- Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems
- Accurate reachability analysis of uncertain nonlinear systems
- Sensitivity analysis of uncertain dynamic systems using set-valued integration
- Under-approximating backward reachable sets by polytopes
- Reachability analysis of polynomial systems using linear programming relaxations
- Backward Reachability for Polynomial Systems on a Finite Horizon
- Reachability computation for polynomial dynamical systems
- Forward inner-approximated reachability of non-linear continuous systems
- Hybrid Systems: Computation and Control
- Quantifying conformance using the Skorokhod metric
- Safety verification for regime-switching jump diffusions via barrier certificates
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
- Formal lumping of polynomial differential equations through approximate equivalences
- Adaptive parameter tuning for reachability analysis of nonlinear systems
- Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis
- Constrained polynomial zonotopes
- Linearization, model reduction and reachability in nonlinear ODEs
- Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes
- Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
- RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems
- Constraint-driven nonlinear reachability analysis with automated tuning of tool properties
- Inner and outer approximations of arbitrarily quantified reachability problems
- Sparse intersection checking for sparse polynomial zonotopes
- Linearization, model reduction and reachability in nonlinear \textsc{ODEs}
- Reachability of Koopman linearized systems using explicit kernel approximation and polynomial zonotope refinement
- Inner and outer approximate quantifier elimination for general reachability problems
- Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes
This page was built for publication: Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986920)
