Data-Driven Nonconvex Reachability Analysis using Exact Multiplication
By: Zhen Zhang , M. Umar B. Niazi , Michelle S. Chong and more
Potential Business Impact:
Makes computer predictions of moving things more accurate.
This paper addresses a fundamental challenge in data-driven reachability analysis: accurately representing and propagating non-convex reachable sets. We propose a novel approach using constrained polynomial zonotopes to describe reachable sets for unknown LTI systems. Unlike constrained zonotopes commonly used in existing literature, constrained polynomial zonotopes are closed under multiplication with constrained matrix zonotopes. We leverage this property to develop an exact multiplication method that preserves the non-convex geometry of reachable sets without resorting to approximations. We demonstrate that our approach provides tighter over-approximations of reachable sets for LTI systems compared to conventional methods.
Similar Papers
Reachability Analysis of Nonlinear Discrete-Time Systems Using Polyhedral Relaxations and Constrained Zonotopes
Systems and Control
Finds safe paths for robots and cars.
Data-Driven Reachability Analysis for Piecewise Affine Systems
Systems and Control
Ensures self-driving cars stay safe always.
Sparsity-Promoting Reachability Analysis and Optimization of Constrained Zonotopes
Systems and Control
Helps robots know where they are faster.