Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.19472 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914052966449152 |
|---|---|
| author | Gould, Brendan Harapanahalli, Akash Coogan, Samuel |
| author_facet | Gould, Brendan Harapanahalli, Akash Coogan, Samuel |
| contents | Interval refinement is a technique for reducing the conservatism of traditional interval based reachability methods by lifting the system to a higher dimension using new auxiliary variables and exploiting the introduced structure through a refinement procedure. We present a novel, efficiently scaling, automatic refinement strategy based on a subspace sampling argument and motivated by reducing the number of interval operations through sparsity. Unlike previous methods, we guarantee that refined bounds shrink as additional auxiliary variables are added. This additionally encourages automation of the lifting phase by allowing larger groups of auxiliary variables to be considered. We implement our strategy in JAX, a high-performance computational toolkit for Python and demonstrate its efficacy on several examples, including regulating a multi-agent platoon to the origin while avoiding an obstacle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_19472 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Automatic and Scalable Safety Verification using Interval Reachability with Subspace Sampling Gould, Brendan Harapanahalli, Akash Coogan, Samuel Systems and Control Interval refinement is a technique for reducing the conservatism of traditional interval based reachability methods by lifting the system to a higher dimension using new auxiliary variables and exploiting the introduced structure through a refinement procedure. We present a novel, efficiently scaling, automatic refinement strategy based on a subspace sampling argument and motivated by reducing the number of interval operations through sparsity. Unlike previous methods, we guarantee that refined bounds shrink as additional auxiliary variables are added. This additionally encourages automation of the lifting phase by allowing larger groups of auxiliary variables to be considered. We implement our strategy in JAX, a high-performance computational toolkit for Python and demonstrate its efficacy on several examples, including regulating a multi-agent platoon to the origin while avoiding an obstacle. |
| title | Automatic and Scalable Safety Verification using Interval Reachability with Subspace Sampling |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2509.19472 |