Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices

DOI10.1145/3178126.3178128zbMath1417.93059arXiv1801.09526OpenAlexW2963403829MaRDI QIDQ4561431

Andreas Podelski, Goran Frehse, Frédéric Viry, Christian Schilling, Sergiy Bogomolov, Marcelo Forets

Publication date: 6 December 2018

Published in: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week) (Search for Journal in Brave)

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

zbMATH Keywords

reachability analysissafety verificationlinear time-invariant systemsset recurrence relation

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Attainable sets, reachability (93B03)

Related Items (9)

Varying zonotopic tube RMPC with switching logic for lateral path tracking of autonomous vehicle ⋮ Conservative time discretization: a comparative study ⋮ Comparison of guaranteed state estimators for linear time-invariant systems ⋮ Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis ⋮ Reachability Analysis for Linear Systems with Uncertain Parameters using Polynomial Zonotopes ⋮ Reachability of weakly nonlinear systems using Carleman linearization ⋮ Reachability analysis of nonlinear systems using hybridization and dynamics scaling ⋮ Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

Uses Software

• Ellipsoidal Toolbox
• SpaceEx
• XSpeed
• JuliaReach
• Expokit.jl
• Unnamed Item
• Unnamed Item

This page was built for publication: Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices