LTLf best-effort synthesis in nondeterministic planning domains
We study best-effort strategies (aka plans) in fully observable nondeterministic domains (FOND) for goals expressed in Linear Temporal Logic on Finite Traces (LTLf). The notion of best-effort strategy has been introduced to also deal with the scenario when no agent strategy exists that fulfills the...
| Principais autores: | , , |
|---|---|
| Formato: | Conference item |
| Idioma: | English |
| Publicado em: |
IOS Press
2023
|