Constrained polynomial zonotopes
From MaRDI portal
Publication:6171823
DOI10.1007/s00236-023-00437-5arXiv2005.08849OpenAlexW3025405458MaRDI QIDQ6171823
Matthias Althoff, Niklas Kochdumper
Publication date: 16 August 2023
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.08849
Related Items
Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis ⋮ Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained zonotopes: a new tool for set-based estimation and fault detection
- Input design for guaranteed fault diagnosis using zonotopes
- Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- Reachability analysis of linear systems using support functions
- A generalization of Caratheodory's theorem
- Zonotopes and Kalman observers: gain optimality under distinct uncertainty paradigms and robust convergence
- Level set methods and dynamic implicit surfaces
- Simulation-equivalent reachability of large linear systems with inputs
- The complexity of the matrix eigenproblem
- Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
- Lectures on Polytopes
- Convex Polytopes
- Parsimonious, Simulation Based Verification of Linear Systems
- Sparse Polynomial Zonotopes: A Novel Set Representation for Reachability Analysis
- Utilizing dependencies to obtain subsets of reachable sets
- Hybrid Systems: Computation and Control
