Metraipolis › archive › dc_c83b7afeb433

Computing Invariant Reachable Sets through Sum-of-Squares Programming — arXiv:2611.04325

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04325
License (as archived)
CC0-1.0
Archived
2026-11-04T21:56:09.646Z
SHA-256 of the archived text
c99e39f798eb6e324116f81f44d2c30e1fc6457fd4a9d14938fdae885ec0c66f
Stable URL of this page
https://metraipolis.com/documento/dc_c83b7afeb433

How to cite

Computing Invariant Reachable Sets through Sum-of-Squares Programming — arXiv:2611.04325 — arXiv (en), https://arxiv.org/abs/2611.04325 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c83b7afeb433 (Metraipolis archive dc_c83b7afeb433, sha256 c99e39f798eb6e324116f81f44d2c30e1fc6457fd4a9d14938fdae885ec0c66f)
BibTeX
@misc{dcc83b7afeb433,
  title = {Computing Invariant Reachable Sets through Sum-of-Squares Programming — arXiv:2611.04325},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04325},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c83b7afeb433; sha256 c99e39f798eb6e324116f81f44d2c30e1fc6457fd4a9d14938fdae885ec0c66f},
  year = {2026}
}

Archived text

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

Funnels, time-varying invariant sets around nominal trajectories, certify that a closed-loop system tracks its plan, and can be composed into verified motion plans. Their computation by sum-of-squares (SOS) programming is well established in formulation but not in practice: the result depends on implementation choices such as the initial guess, Lyapunov function normalization, and termination rule, which the literature documents only briefly. This paper presents a self-contained treatment of SOS-based funnel computation, implemented in the open-source package computeSOSFunnels. We propose a minimum-volume formulation with inlet and outlet constraints under which funnels with coinciding nominal endpoints compose by construction. Numerical experiments on a unicycle, with timing studies on a cart-pole and a 12-state quadrotor, characterize the pipeline: infeasible initial guesses are partly decidable before solving, the certificate shows no violations among 39,000 boundary samples per funnel under the true dynamics, and constructing the semidefinite program, not solving it, dominates computation time.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY) ; Robotics (cs.RO); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.04325 — 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-04T21:40:34.552Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).