ltl $$_f$$ Best-Effort Synthesis for Single and Multiple Goal and Planning Domain Specifications

We study best-effort strategies (aka plans) in fully observable nondeterministic domains (FOND) for goals expressed in Linear Temporal Logic on Finite Traces (ltl $$_f$$ ). The notion of best-effort strategy has been introduced to also deal with the scenario when no agent strategy exists that fulfills the goal against every possible nondeterministic environment reaction. Such strategies fulfill the goal if possible, and do their best to do so otherwise. We present a technique for synthesizing best-effort strategies and propose some possible extensions of best-effort synthesis for multiple goal and planning domain specifications.