AINov 26, 2020

Totally and Partially Ordered Hierarchical Planners in PDDL4J Library

arXiv:2011.13297v19 citations
AI Analysis

This work provides an implementation of hierarchical planners for the PDDL4J library, which is relevant for researchers and practitioners working with HTN planning.

This paper outlines the implementation of the TFD and PFD hierarchical planners, which are based on forward-chaining task decomposition and compact grounding of planning elements. These planners participated in the 2020 HTN IPC competition.

In this paper, we outline the implementation of the TFD (Totally Ordered Fast Downward) and the PFD (Partially ordered Fast Downward) hierarchical planners that participated in the first HTN IPC competition in 2020. These two planners are based on forward-chaining task decomposition coupled with a compact grounding of actions, methods, tasks and HTN problems.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes