LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains

Authors

  • Giuseppe de Giacomo University of Oxford University of Rome ''La Sapienza''
  • Gianmarco Parretti University of Rome ''La Sapienza''
  • Shufang Zhu University of Liverpool

DOI:

https://doi.org/10.1609/icaps.v35i1.36135

Abstract

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.

Downloads

Published

2025-09-16

How to Cite

de Giacomo, G., Parretti, G., & Zhu, S. (2025). LTLf Adaptive Synthesis for Multi-Tier Goals in Nondeterministic Domains. Proceedings of the International Conference on Automated Planning and Scheduling, 35(1), 334-342. https://doi.org/10.1609/icaps.v35i1.36135