FOND Planning for LTLf and PLTLf Goals
This work addresses planning under uncertainty for temporal logic goals, which is incremental as it builds on existing FOND and LTLf frameworks.
The authors tackled the problem of non-deterministic planning for extended temporal goals by reducing it to a fully observable non-deterministic (FOND) planning problem using the LTLfToDFA tool, and they presented results from applying this solution.
In this report, we will define a new approach to the problem of non deterministic planning for extended temporal goals. In particular, we will give a solution to this problem reducing it to a fully observable non deterministic (FOND) planning problem and taking advantage of the LTLfToDFA tool. First of all, we will introduce the main idea and motivations supporting our approach. Then, we will give some preliminaries explaining the Planning Domain Definition Language (PDDL) language and the FOND planning problem formally. After that, we will illustrate our FOND4LTLfPLTLf (also available online) approach with the encoding of temporal goals into a PDDL domain and problem. Finally, we will present some of the results obtained through the application of the proposed solution.