Metraipolis › archive › dc_f6ec63f97f58

Sufficient and Necessary Smooth Barrier-like Conditions for Continuous-Time Stochastic Reach-Avoid Verification — arXiv:2609.23981

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23981
License (as archived)
CC0-1.0
Archived
2026-10-10T00:55:29.061Z
SHA-256 of the archived text
93097902869477383f652d0830136fafdccdccd92cdea851ad82f4b8b6b68f82
Stable URL of this page
https://metraipolis.com/documento/dc_f6ec63f97f58

How to cite

Sufficient and Necessary Smooth Barrier-like Conditions for Continuous-Time Stochastic Reach-Avoid Verification — arXiv:2609.23981 — arXiv (en), https://arxiv.org/abs/2609.23981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f6ec63f97f58 (Metraipolis archive dc_f6ec63f97f58, sha256 93097902869477383f652d0830136fafdccdccd92cdea851ad82f4b8b6b68f82)
BibTeX
@misc{dcf6ec63f97f58,
  title = {Sufficient and Necessary Smooth Barrier-like Conditions for Continuous-Time Stochastic Reach-Avoid Verification — arXiv:2609.23981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f6ec63f97f58; sha256 93097902869477383f652d0830136fafdccdccd92cdea851ad82f4b8b6b68f82},
  year = {2026}
}

Archived text

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

In this paper, we study infinite-horizon reach-avoid verification for continuous-time stochastic systems modeled by stochastic differential equations (SDEs). We formulate this problem within a barrier-function-based framework, which transforms the verification problem into an existence problem for barrier functions satisfying barrier-like conditions expressed as functional inequalities. We provide sufficient and necessary barrier-like conditions in terms of polynomial barrier functions for infinite-horizon reach-avoid verification under suitable regularity and uniform ellipticity assumptions. We first construct a discounted value function that characterizes lower bounds on the reach-avoid probability. We then show that it is the unique classical solution of an associated elliptic Dirichlet problem. Based on this characterization, we further show that the barrier-like condition proposed in our previous work on finite-horizon reach-avoid verification is not only sufficient for infinite-horizon reach-avoid verification but also necessary whenever the reach-avoid probability is strictly larger than the specified threshold. In particular, whenever the reach-avoid probability is strictly larger than the specified threshold fro every state in the initial set, polynomial barrier functions satisfying this barrier-like condition exist. Furthermore, when the system dynamics are polynomial, we formulate the problem of finding polynomial barrier functions satisfying this barrier-like condition as sum-of-squares (SOS) programs, which are shown to be sound and complete. Finally, we demonstrate the theoretical results on two numerical examples.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in eess.SY).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.23981 — 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-09T23:57:37.629Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).