Papers
Topics
Authors
Recent
Search
2000 character limit reached

FOND Planning for LTLf and PLTLf Goals

Published 15 Apr 2020 in cs.AI | (2004.07027v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.