Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
From MaRDI portal
Publication:832032
DOI10.1007/978-3-030-85037-1_4OpenAlexW3197778381MaRDI QIDQ832032
Parasara Sridhar Duggirala, Stanley Bak, Edward D. Kim
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2105.11796
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Reachability computation for polynomial dynamical systems
- Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes
- Fast construction of constant bound functions for sparse polynomials
- An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
- Template polyhedra and bilinear optimization
- Formalization of Bernstein polynomials and applications to global optimization
- Template-Based Unbounded Time Verification of Affine Hybrid Automata
- Finding Relevant Templates via the Principal Component Analysis
- Parallelotope Bundles for Polynomial Reachability
- Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
- Parsimonious, Simulation Based Verification of Linear Systems
- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- Sapo
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Static Analysis
- Hybrid Systems: Computation and Control
This page was built for publication: Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems
