Metraipolis › archive › dc_84f79eba0519
A Geometric Decision Procedure for STL Feasibility and Repair — arXiv:2610.00199
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.00199
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T12:30:27.458Z
- SHA-256 of the archived text
445242c313bffe2cbce3c9335bdc4ac1b39e97d1606edfdf9532e1d0019abf5f- Stable URL of this page
https://metraipolis.com/documento/dc_84f79eba0519
How to cite
A Geometric Decision Procedure for STL Feasibility and Repair — arXiv:2610.00199 — arXiv (en), https://arxiv.org/abs/2610.00199 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84f79eba0519 (Metraipolis archive dc_84f79eba0519, sha256 445242c313bffe2cbce3c9335bdc4ac1b39e97d1606edfdf9532e1d0019abf5f)
BibTeX
@misc{dc84f79eba0519,
title = {A Geometric Decision Procedure for STL Feasibility and Repair — arXiv:2610.00199},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.00199},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84f79eba0519; sha256 445242c313bffe2cbce3c9335bdc4ac1b39e97d1606edfdf9532e1d0019abf5f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00199. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Signal Temporal Logic control synthesis frequently encounters physical infeasibility due to actuator limits or flawed task deadlines. Standard optimization methods model time by discretizing the horizon, which leads to exponential computational growth and prevents the extraction of continuous temporal adjustments. This paper presents a geometric decision procedure that evaluates physical feasibility completely independently of the temporal horizon length. The method operates by transforming explicit temporal logic constraints into continuous spatial backward reachable sets evaluated at time zero. It analytically inverts the Bhat-Bernstein settling-time integral to map temporal windows into continuous spatial boundaries, reducing the feasibility check to a local matrix and vector inclusion evaluation. When a specification is infeasible, the procedure extracts a Farkas dual certificate to isolate conflicting constraints and identifies the maximum geometric spatial gap. It then analytically inverts the system's dynamic expansion to map this largest geometric gap into an exact, closed-form temporal delay, precisely fixing the boundary deficit to restore physical realizability. We formally prove the strict soundness, mathematically bounded completeness, and horizon-independent scalability of this procedure. Experimental evaluations on six-dimensional drone kinematics demonstrate sub-millisecond execution times, massive speedups over state-of-the-art optimization encodings, and computational immunity to deeply nested logical formulas. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-02 in eess.SY). Categorie arXiv: Systems and Control (eess.SY) ; Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.00199 — 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-07T12:03:07.597Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).