Data-Driven Abstractions for Control Systems via Random Exploration
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910620547284992 |
|---|---|
| author | Coppola, Rudi Peruffo, Andrea Mazo Jr, Manuel |
| author_facet | Coppola, Rudi Peruffo, Andrea Mazo Jr, Manuel |
| contents | At the intersection of dynamical systems, control theory, and formal methods lies the construction of symbolic abstractions: these typically represent simpler, finite-state models whose behavior mimics that of an underlying concrete system but are easier to analyse. Building an abstraction usually requires an accurate knowledge of the underlying model: this knowledge may be costly to gather, especially in real-life applications. We aim to bridge this gap by building abstractions based on sampling finite length trajectories. To refine a controller built for the abstraction to one for the concrete system, we newly define a notion of probabilistic alternating simulation, and provide Probably Approximately Correct (PAC) guarantees that the constructed abstraction includes all behaviors of the concrete system and that it is suitable for control design, for arbitrarily long time horizons, leveraging scenario theory. Our method is then tested on several numerical benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_10668 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Data-Driven Abstractions for Control Systems via Random Exploration Coppola, Rudi Peruffo, Andrea Mazo Jr, Manuel Systems and Control Formal Languages and Automata Theory At the intersection of dynamical systems, control theory, and formal methods lies the construction of symbolic abstractions: these typically represent simpler, finite-state models whose behavior mimics that of an underlying concrete system but are easier to analyse. Building an abstraction usually requires an accurate knowledge of the underlying model: this knowledge may be costly to gather, especially in real-life applications. We aim to bridge this gap by building abstractions based on sampling finite length trajectories. To refine a controller built for the abstraction to one for the concrete system, we newly define a notion of probabilistic alternating simulation, and provide Probably Approximately Correct (PAC) guarantees that the constructed abstraction includes all behaviors of the concrete system and that it is suitable for control design, for arbitrarily long time horizons, leveraging scenario theory. Our method is then tested on several numerical benchmarks. |
| title | Data-Driven Abstractions for Control Systems via Random Exploration |
| topic | Systems and Control Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2402.10668 |