Metraipolis › archive › dc_7e250cfd1244
Integer-Free Control Synthesis for Signal Temporal Logic via Ranked Implicants — arXiv:2610.20969
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20969
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:53:51.511Z
- SHA-256 of the archived text
70b6a4e74c39ff904969e8904c4a5b07038fb2b8aa0423ef60e6e7f93c1274f8- Stable URL of this page
https://metraipolis.com/documento/dc_7e250cfd1244
How to cite
Integer-Free Control Synthesis for Signal Temporal Logic via Ranked Implicants — arXiv:2610.20969 — arXiv (en), https://arxiv.org/abs/2610.20969 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e250cfd1244 (Metraipolis archive dc_7e250cfd1244, sha256 70b6a4e74c39ff904969e8904c4a5b07038fb2b8aa0423ef60e6e7f93c1274f8)
BibTeX
@misc{dc7e250cfd1244,
title = {Integer-Free Control Synthesis for Signal Temporal Logic via Ranked Implicants — arXiv:2610.20969},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20969},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e250cfd1244; sha256 70b6a4e74c39ff904969e8904c4a5b07038fb2b8aa0423ef60e6e7f93c1274f8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20969. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper proposes an integer-free method for control synthesis of nonlinear discrete-time systems under finite-horizon Signal Temporal Logic (STL) constraints. Instead of introducing integer variables, we consider the discrete choices of the specification in a ranked order and solve a standard nonlinear program for each selected choice until a satisfying trajectory is found. We first define implicants as sets of timed atomic constraints whose joint satisfaction is sufficient to satisfy the specification. A reference trajectory obtained from a smooth approximation of the STL robustness is used to rank these implicants. Fixing one implicant turns the problem into a standard nonlinear program with no auxiliary weights or bilinear terms. If the solution does not satisfy the specification, the next implicant will be considered. We prove soundness and completeness of our method relative to the nonlinear programming solver. Numerical evaluation on nonlinear multi-agent systems shows that our proposed method identifies satisfying trajectories where the exact continuous reformulation fails, and moreover, it is faster than a mixed-integer formulation of the same specification. 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/2610.20969 — 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-16T09:01:52.478Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).