Data-Driven Nonconvex Reachability Analysis using Exact Multiplication

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhang, Zhen, Niazi, M. Umar B., Chong, Michelle S., Johansson, Karl H., Alanwar, Amr
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911328621297664
author Zhang, Zhen
Niazi, M. Umar B.
Chong, Michelle S.
Johansson, Karl H.
Alanwar, Amr
author_facet Zhang, Zhen
Niazi, M. Umar B.
Chong, Michelle S.
Johansson, Karl H.
Alanwar, Amr
contents This paper addresses a fundamental challenge in data-driven reachability analysis: accurately representing and propagating non-convex reachable sets. We propose a novel approach using constrained polynomial zonotopes to describe reachable sets for unknown LTI systems. Unlike constrained zonotopes commonly used in existing literature, constrained polynomial zonotopes are closed under multiplication with constrained matrix zonotopes. We leverage this property to develop an exact multiplication method that preserves the non-convex geometry of reachable sets without resorting to approximations. We demonstrate that our approach provides tighter over-approximations of reachable sets for LTI systems compared to conventional methods.
format Preprint
id arxiv_https___arxiv_org_abs_2504_02147
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Data-Driven Nonconvex Reachability Analysis using Exact Multiplication
Zhang, Zhen
Niazi, M. Umar B.
Chong, Michelle S.
Johansson, Karl H.
Alanwar, Amr
Systems and Control
This paper addresses a fundamental challenge in data-driven reachability analysis: accurately representing and propagating non-convex reachable sets. We propose a novel approach using constrained polynomial zonotopes to describe reachable sets for unknown LTI systems. Unlike constrained zonotopes commonly used in existing literature, constrained polynomial zonotopes are closed under multiplication with constrained matrix zonotopes. We leverage this property to develop an exact multiplication method that preserves the non-convex geometry of reachable sets without resorting to approximations. We demonstrate that our approach provides tighter over-approximations of reachable sets for LTI systems compared to conventional methods.
title Data-Driven Nonconvex Reachability Analysis using Exact Multiplication
topic Systems and Control
url https://arxiv.org/abs/2504.02147