Search Results for author:
Found 2 papers, 0 papers with code
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).
Symbolic LTLf Best-Effort Synthesis
We consider an agent acting to fulfil tasks in a nondeterministic environment.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
