Data-driven certificates of constraint enforcement and stability for unmodeled, discrete dynamical systems using tree data structures
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915635256098816 |
|---|---|
| author | Strong, Amy K. Kashani, Ali Danielson, Claus Bridgeman, Leila J. |
| author_facet | Strong, Amy K. Kashani, Ali Danielson, Claus Bridgeman, Leila J. |
| contents | This paper addresses the critical challenge of developing data-driven certificates for the stability and safety of unmodeled dynamical systems by leveraging a tree data structure and an upper bound of the system's Lipschitz constant. Previously, an invariant set was synthesized by iteratively expanding an initial invariant set. In contrast, this work iteratively prunes the constraint set to synthesize an invariant set -- eliminating the need for a known, initial invariant set. Furthermore, we provide stability assurances by characterizing the asymptotic stability of the system relative to an invariant approximation of the minimal positive invariant set through synthesis of a discontinuous piecewise affine Lyapunov function over the computed invariant set. The proposed method takes inspiration from subdivision techniques and requires no prior system knowledge beyond Lipschitz continuity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_19231 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Data-driven certificates of constraint enforcement and stability for unmodeled, discrete dynamical systems using tree data structures Strong, Amy K. Kashani, Ali Danielson, Claus Bridgeman, Leila J. Systems and Control This paper addresses the critical challenge of developing data-driven certificates for the stability and safety of unmodeled dynamical systems by leveraging a tree data structure and an upper bound of the system's Lipschitz constant. Previously, an invariant set was synthesized by iteratively expanding an initial invariant set. In contrast, this work iteratively prunes the constraint set to synthesize an invariant set -- eliminating the need for a known, initial invariant set. Furthermore, we provide stability assurances by characterizing the asymptotic stability of the system relative to an invariant approximation of the minimal positive invariant set through synthesis of a discontinuous piecewise affine Lyapunov function over the computed invariant set. The proposed method takes inspiration from subdivision techniques and requires no prior system knowledge beyond Lipschitz continuity. |
| title | Data-driven certificates of constraint enforcement and stability for unmodeled, discrete dynamical systems using tree data structures |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2511.19231 |