A sampling-based optimization framework computes finite-step invariant ellipsoids for hybrid system return maps with user-specified probabilistic guarantees on invariance.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
eess.SY 2years
2026 2representative citing papers
Formal connections between PAC bounds for three data-driven reachability methods are established, with empirical results showing they are not interchangeable despite similarities.
citing papers explorer
-
Finite-Step Invariant Sets for Hybrid Systems with Probabilistic Guarantees
A sampling-based optimization framework computes finite-step invariant ellipsoids for hybrid system return maps with user-specified probabilistic guarantees on invariance.
-
Probably Approximately Correct (PAC) Guarantees for Data-Driven Reachability Analysis: A Theoretical and Empirical Comparison
Formal connections between PAC bounds for three data-driven reachability methods are established, with empirical results showing they are not interchangeable despite similarities.