Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems

DOI10.1007/978-3-030-85037-1_4OpenAlexW3197778381MaRDI QIDQ832032FDOQ832032

Authors: Stanley Bak, Parasara Sridhar Duggirala, Edward D. Kim 

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2105.11796

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Sapo: reachability computation and parameter synthesis of polynomial dynamical systems
• Reachability analysis of polynomial systems using linear programming relaxations
• Hybrid Systems: Computation and Control
• Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes
• Formalization of Bernstein polynomials and applications to global optimization
• Fast construction of constant bound functions for sparse polynomials
• An algorithm for global optimization using the Taylor-Bernstein form as inclusion function
• Title not available (Why is that?)
• Static Analysis
• Reachability computation for polynomial dynamical systems
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Template polyhedra and bilinear 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

Cited In (3)

• Automatic Dynamic Parallelotope Bundles for Reachability Analysis of Nonlinear Systems
• NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems
• Kaa

Uses Software

• Sapo
• GitHub
• ReachNN
• Kodiak

This page was built for publication: Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832032)