DeepAI AI Chat
Log In Sign Up

Generalized Planning With Procedural Domain Control Knowledge

by   Javier Segovia-Aguas, et al.
Universitat Pompeu Fabra

Generalized planning is the task of generating a single solution that is valid for a set of planning problems. In this paper we show how to represent and compute generalized plans using procedural Domain Control Knowledge (DCK). We define a divide and conquer approach that first generates the procedural DCK solving a set of planning problems representative of certain subtasks and then compile it as callable procedures of the overall generalized planning problem. Our procedure calling mechanism allows nested and recursive procedure calls and is implemented in PDDL so that classical planners can compute and exploit procedural DCK. Experiments show that an off-the-shelf classical planner, using procedural DCK as callable procedures, can compute generalized plans in a wide range of domains including non-trivial ones, such as sorting variable-size lists or DFS traversal of binary trees with variable size.


page 1

page 2

page 3

page 4


Hierarchical Finite State Controllers for Generalized Planning

Finite State Controllers (FSCs) are an effective way to represent sequen...

Discovering State and Action Abstractions for Generalized Task and Motion Planning

Generalized planning accelerates classical planning by finding an algori...

A game-theoretic approach to timeline-based planning with uncertainty

In timeline-based planning, domains are described as sets of independent...

Representation and Synthesis of C++ Programs for Generalized Planning

The paper introduces a novel representation for Generalized Planning (GP...

Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains

Experience-based planning domains have been proposed to improve problem ...

Generalized Planning with Positive and Negative Examples

Generalized planning aims at computing an algorithm-like structure (gene...