Reachability Analysis Using Hybrid Zonotopes and Functional Decomposition
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910341133238272 |
|---|---|
| author | Siefert, Jacob A. Bird, Trevor J. Thompson, Andrew F. Glunt, Jonah J. Koeln, Justin P. Jain, Neera Pangborn, Herschel C. |
| author_facet | Siefert, Jacob A. Bird, Trevor J. Thompson, Andrew F. Glunt, Jonah J. Koeln, Justin P. Jain, Neera Pangborn, Herschel C. |
| contents | This paper proposes methods for reachability analysis of nonlinear systems in both open loop and closed loop with advanced controllers. The methods combine hybrid zonotopes, a construct called a state-update set, functional decomposition, and special ordered set approximations to enable linear growth in reachable set memory complexity with time and linear scaling in computational complexity with the system dimension. Facilitating this combination are new identities for constructing nonconvex sets that contain nonlinear functions and for efficiently converting a collection of polytopes from vertex representation to hybrid zonotope representation. Benchmark numerical examples from the literature demonstrate the proposed methods and provide comparison to state-of-the-art techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_06827 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Reachability Analysis Using Hybrid Zonotopes and Functional Decomposition Siefert, Jacob A. Bird, Trevor J. Thompson, Andrew F. Glunt, Jonah J. Koeln, Justin P. Jain, Neera Pangborn, Herschel C. Systems and Control This paper proposes methods for reachability analysis of nonlinear systems in both open loop and closed loop with advanced controllers. The methods combine hybrid zonotopes, a construct called a state-update set, functional decomposition, and special ordered set approximations to enable linear growth in reachable set memory complexity with time and linear scaling in computational complexity with the system dimension. Facilitating this combination are new identities for constructing nonconvex sets that contain nonlinear functions and for efficiently converting a collection of polytopes from vertex representation to hybrid zonotope representation. Benchmark numerical examples from the literature demonstrate the proposed methods and provide comparison to state-of-the-art techniques. |
| title | Reachability Analysis Using Hybrid Zonotopes and Functional Decomposition |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2304.06827 |