Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.20983 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916713005580288 |
|---|---|
| author | De Giacomo, Giuseppe Parretti, Gianmarco Zhu, Shufang |
| author_facet | De Giacomo, Giuseppe Parretti, Gianmarco Zhu, Shufang |
| contents | We study a variant of LTLf synthesis that synthesizes adaptive strategies for achieving a multi-tier goal, consisting of multiple increasingly challenging LTLf objectives in nondeterministic planning domains. Adaptive strategies are strategies that at any point of their execution (i) enforce the satisfaction of as many objectives as possible in the multi-tier goal, and (ii) exploit possible cooperation from the environment to satisfy as many as possible of the remaining ones. This happens dynamically: if the environment cooperates (ii) and an objective becomes enforceable (i), then our strategies will enforce it. We provide a game-theoretic technique to compute adaptive strategies that is sound and complete. Notably, our technique is polynomial, in fact quadratic, in the number of objectives. In other words, it handles multi-tier goals with only a minor overhead compared to standard LTLf synthesis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_20983 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains De Giacomo, Giuseppe Parretti, Gianmarco Zhu, Shufang Artificial Intelligence We study a variant of LTLf synthesis that synthesizes adaptive strategies for achieving a multi-tier goal, consisting of multiple increasingly challenging LTLf objectives in nondeterministic planning domains. Adaptive strategies are strategies that at any point of their execution (i) enforce the satisfaction of as many objectives as possible in the multi-tier goal, and (ii) exploit possible cooperation from the environment to satisfy as many as possible of the remaining ones. This happens dynamically: if the environment cooperates (ii) and an objective becomes enforceable (i), then our strategies will enforce it. We provide a game-theoretic technique to compute adaptive strategies that is sound and complete. Notably, our technique is polynomial, in fact quadratic, in the number of objectives. In other words, it handles multi-tier goals with only a minor overhead compared to standard LTLf synthesis. |
| title | LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2504.20983 |