Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes
This paper extends the results given by \textit{E. Luo} et al. [in: Proceedings of the 26th ACM international conference on hybrid systems: computation and control, HSCC 2023, part of the 16th CPS-IoT week, San Antonio, TX, USA, May 9--12, 2023. New York, NY: Association for Computing Machinery (ACM). Paper No. 17, 12 p. (2023; Zbl 07807958)], by using an efficient and scalable algorithm to optimize multi-affine zonotopes, which are a special case of polynomial zonotopes. The paper presents the reachable set computation algorithm for a linear system with uncertain parameters, extends the reachability algorithm to linear systems with time-varying parameters, linear time-varying systems, nonlinear systems, and explores the potential applications in the field of hybrid systems and an optimization algorithm for the multi-affine zonotope, which is a special polynomial zonotope. \N\NThe main results of this research are: (1) the identification of additional structural properties in polynomial zonotopes beneficial for the algorithm, especially multi-affine zonotopes, and (2) the development of improved optimization algorithms using the identified structural properties for more efficient computation. In addition, the proposed algorithm is evaluated using two examples illustrating the performance improvements and its applicability.
- Affine arithmetic: concepts and applications
- Avoiding geometric intersection operations in reachability analysis of hybrid systems
- Computational techniques for hybrid system verification
- Conservative time discretization: a comparative study
- Control and estimation in linear time-varying systems based on ellipsoidal reachability sets
- Flowpipe approximation and clustering in space-time
- scientific article; zbMATH DE number 1444352 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Numerical verification of affine systems with up to a billion dimensions
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- Over- and Under-Approximations of Reachable Sets With Series Representations of Evolution Functions
- Overapproximating Reachable Tubes of Linear Time-Varying Systems
- Parsimonious, Simulation Based Verification of Linear Systems
- Reach set approximation through decomposition with low-dimensional sets and high-dimensional matrices
- Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes
- Reachability Analysis of Large Linear Systems With Uncertain Inputs in the Krylov Subspace
- Reachability analysis of linear systems using support functions
- 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
- Reachable set computation for uncertain time-varying linear systems
- Simulation-equivalent reachability of large linear systems with inputs
- Sparse Polynomial Zonotopes: A Novel Set Representation for Reachability Analysis
- Utilizing dependencies to obtain subsets of reachable sets
- Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis
This page was built for publication: Reachability analysis for linear systems with uncertain parameters using polynomial zonotopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7015106)
