Sparse intersection checking for sparse polynomial zonotopes

DOI10.1145/3716863.3718029MaRDI QIDQ6904639zbMATH OpenFDO

Authors Yusheng Huang, Yi-Fan Sun, Stanley Bak

Publication date 7 November 2025

Full work available at URL https://doi.org/10.1145/3716863.3718029

zbMATH Keywords

reachability analysisformal verificationpolynomial zonotopes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites work

• scientific article; zbMATH DE number 2069519 (Why is no real title available?)
• scientific article; zbMATH DE number 1444352 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• A polyhedral study of binary polynomial programs
• Algorithmic analysis of nonlinear hybrid systems
• An equation for continuous chaos
• Application de la théorie des équations intégrales linéaires aux systèmes d'équations différentielles non linéaires
• Class of global minimum bounds of polynomial functions
• Constrained zonotopes: a new tool for set-based estimation and fault detection
• Ellipsotopes: Uniting Ellipsoids and Zonotopes for Reachability Analysis and Fault Detection
• Global optimization with polynomials and the problem of moments
• Hybrid Systems: Computation and Control
• On the Minimum Volume Covering Ellipsoid of Ellipsoids
• Parsimonious, Simulation Based Verification of Linear Systems
• Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes
• Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
• Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
• Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
• Semidefinite programming relaxations for semialgebraic problems
• Sparse Polynomial Zonotopes: A Novel Set Representation for Reachability Analysis
• Symbolic Models for Nonlinear Control Systems Without Stability Assumptions
• The basic algorithm for pseudo-Boolean programming revisited
• The multilinear polytope for acyclic hypergraphs
• Towards a Taylor-Carleman bilinearization approach for the design of nonlinear state-feedback controllers

This page was built for publication: Sparse intersection checking for sparse polynomial zonotopes

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