Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
From MaRDI portal
Publication:748756
DOI10.1007/s11786-015-0238-9zbMath1341.68293OpenAlexW1709917142MaRDI QIDQ748756
Publication date: 30 October 2015
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-015-0238-9
(n)-dimensional polytopes (52B11) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items
Constrained zonotopes: a new tool for set-based estimation and fault detection ⋮ Confidence set-membership FIR filter for discrete time-variant systems ⋮ Nonlinear set‐membership state estimation based on the Koopman operator ⋮ Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems
Uses Software
Cites Work
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- The negative cycles polyhedron and hardness of checking some polyhedral properties
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- Flowpipe approximation and clustering in space-time
- Component based design of hybrid systems
- Decomposition Principle for Linear Programs
- Reachability Analysis of Hybrid Systems Using Support Functions
- Lectures on Polytopes
- Variational Analysis
- Computing convex hulls with a linear solver
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Hybrid Systems: Computation and Control
- Verification, Model Checking, and Abstract Interpretation
- Generating all vertices of a polyhedron is hard
- Unnamed Item
- Unnamed Item
- Unnamed Item
