Totally and Partially Ordered Hierarchical Planners in PDDL4J Library
Damien Pellier, Humbert Fiorino
TL;DR
This paper presents the implementation of two hierarchical planners, TFD and PFD, based on forward-chaining and compact grounding, which participated in the 2020 HTN IPC competition, advancing planning techniques in PDDL4J.
Contribution
It introduces the implementation of TFD and PFD planners within PDDL4J, demonstrating their participation in the HTN IPC competition and showcasing their approach based on forward-chaining and compact grounding.
Findings
Participated in the 2020 HTN IPC competition.
Implemented TFD and PFD planners in PDDL4J.
Utilized forward-chaining task decomposition with compact grounding.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning · Model-Driven Software Engineering Techniques · Semantic Web and Ontologies