Metraipolis › archive › dc_ae3f0aa20fbc
Algebraic Characterization of Time-Varying Set Invariance — arXiv:2611.03346
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03346
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:54:53.393Z
- SHA-256 of the archived text
50d08294358ca1749bb700fecf3ec431fbcaac0d08bd9d37ba55bd5146163c5b- Stable URL of this page
https://metraipolis.com/documento/dc_ae3f0aa20fbc
How to cite
Algebraic Characterization of Time-Varying Set Invariance — arXiv:2611.03346 — arXiv (en), https://arxiv.org/abs/2611.03346 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ae3f0aa20fbc (Metraipolis archive dc_ae3f0aa20fbc, sha256 50d08294358ca1749bb700fecf3ec431fbcaac0d08bd9d37ba55bd5146163c5b)
BibTeX
@misc{dcae3f0aa20fbc,
title = {Algebraic Characterization of Time-Varying Set Invariance — arXiv:2611.03346},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03346},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ae3f0aa20fbc; sha256 50d08294358ca1749bb700fecf3ec431fbcaac0d08bd9d37ba55bd5146163c5b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03346. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The verification of temporal forward invariance for dynamical systems subject to time-varying constraints is a foundational problem in the analysis of safety-critical systems. Existing methodologies rely on restrictive geometric assumptions, such as the Linear Independence Constraint Qualification (LICQ), or suffer from exponential computational complexity when applied to time-varying polytopes. This paper establishes a rigorous, unified, and computationally tractable framework for temporal safety verification. First, utilizing tools from nonsmooth analysis, we prove that a Nagumo-type geometric inclusion evaluated strictly on the boundary of the augmented graph is both necessary and sufficient for temporal forward invariance. Second, we provide an algebraic characterization of this condition requiring only the weaker Abadie Constraint Qualification (ACQ), generalizing standard Control Barrier Function (CBF) boundary conditions to non-smooth, multi-constraint domains. Finally, for the practical class of Linear Time-Invariant (LTI) systems with time-varying polytopic constraints, we deploy Farkas' Lemma to eliminate exponential vertex enumeration. By introducing a Lipschitz-bounded time-discretization scheme, we reduce the infinite-dimensional continuous-time verification problem to a finite, highly tractable set of decoupled Linear Programs (LPs). Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.03346 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:15:22.689Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).