English

FOND Planning for LTLf and PLTLf Goals

Artificial Intelligence 2020-04-16 v1

Abstract

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.

Keywords

Cite

@article{arxiv.2004.07027,
  title  = {FOND Planning for LTLf and PLTLf Goals},
  author = {Francesco Fuggitti},
  journal= {arXiv preprint arXiv:2004.07027},
  year   = {2020}
}

Comments

Extract of MSc Thesis, 35 pages

R2 v1 2026-06-23T14:52:06.325Z