Metraipolis › archive › dc_9a6790f960a1

Real-Time Synthesis of Robust Controlled Invariant Sets for Monotone Systems — arXiv:2609.14115

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14115
License (as archived)
CC0-1.0
Archived
2026-10-15T22:50:53.558Z
SHA-256 of the archived text
8dd9b4d74ab651808e828dafb474c2dc3a0afbf2fb47e444cc24a0ff8101f603
Stable URL of this page
https://metraipolis.com/documento/dc_9a6790f960a1

How to cite

Real-Time Synthesis of Robust Controlled Invariant Sets for Monotone Systems — arXiv:2609.14115 — arXiv (en), https://arxiv.org/abs/2609.14115 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9a6790f960a1 (Metraipolis archive dc_9a6790f960a1, sha256 8dd9b4d74ab651808e828dafb474c2dc3a0afbf2fb47e444cc24a0ff8101f603)
BibTeX
@misc{dc9a6790f960a1,
  title = {Real-Time Synthesis of Robust Controlled Invariant Sets for Monotone Systems — arXiv:2609.14115},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14115},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9a6790f960a1; sha256 8dd9b4d74ab651808e828dafb474c2dc3a0afbf2fb47e444cc24a0ff8101f603},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14115. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Safety-critical control of autonomous systems requires formal safety certificates, such as controlled invariant sets, that must be computed online as conditions change. Although standard synthesis algorithms scale poorly with state dimension, monotone dynamical systems with lower-closed safety specifications allow for accelerated computation of controlled invariant sets. In particular, lazy fixed-point algorithms exploit monotonicity and track only the antichain basis of the set. However, membership tests and redundancy checks against an evolving basis remain major bottlenecks. We introduce a threshold-function reformulation in which a lower-closed set on a d-dimensional grid is represented by its column heights along a designated axis. This reformulates the greatest-fixed-point iteration as independent one-dimensional binary searches, one per grid column, yielding an embarrassingly parallel iteration with asymptotically lower computational complexity than the lazy fixed-point algorithm. Experiments synthesize invariant sets on 3D grids with 10^9 cells in under 50 ms and 10^14 cells in under two minutes. We further demonstrate online re-synthesis in a safety-informed model predictive controller example.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.AI).
Categorie arXiv: Systems and Control (eess.SY) ; Artificial Intelligence (cs.AI); Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.14115 — 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-10-15T22:29:03.622Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).