Efficient Shield Synthesis via State-Space Transformation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913630906220544 |
|---|---|
| author | Brorholt, Asger Horn Høeg-Petersen, Andreas Holck Larsen, Kim Guldstrand Schilling, Christian |
| author_facet | Brorholt, Asger Horn Høeg-Petersen, Andreas Holck Larsen, Kim Guldstrand Schilling, Christian |
| contents | We consider the problem of synthesizing safety strategies for control systems, also known as shields. Since the state space is infinite, shields are typically computed over a finite-state abstraction, with the most common abstraction being a rectangular grid. However, for many systems, such a grid does not align well with the safety property or the system dynamics. That is why a coarse grid is rarely sufficient, but a fine grid is typically computationally infeasible to obtain. In this paper, we show that appropriate state-space transformations can still allow to use a coarse grid at almost no computational overhead. We demonstrate in three case studies that our transformation-based synthesis outperforms a standard synthesis by several orders of magnitude. In the first two case studies, we use domain knowledge to select a suitable transformation. In the third case study, we instead report on results in engineering a transformation without domain knowledge. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19911 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Efficient Shield Synthesis via State-Space Transformation Brorholt, Asger Horn Høeg-Petersen, Andreas Holck Larsen, Kim Guldstrand Schilling, Christian Logic in Computer Science Artificial Intelligence Machine Learning Systems and Control We consider the problem of synthesizing safety strategies for control systems, also known as shields. Since the state space is infinite, shields are typically computed over a finite-state abstraction, with the most common abstraction being a rectangular grid. However, for many systems, such a grid does not align well with the safety property or the system dynamics. That is why a coarse grid is rarely sufficient, but a fine grid is typically computationally infeasible to obtain. In this paper, we show that appropriate state-space transformations can still allow to use a coarse grid at almost no computational overhead. We demonstrate in three case studies that our transformation-based synthesis outperforms a standard synthesis by several orders of magnitude. In the first two case studies, we use domain knowledge to select a suitable transformation. In the third case study, we instead report on results in engineering a transformation without domain knowledge. |
| title | Efficient Shield Synthesis via State-Space Transformation |
| topic | Logic in Computer Science Artificial Intelligence Machine Learning Systems and Control |
| url | https://arxiv.org/abs/2407.19911 |