Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Totally and Partially Ordered Hierarchical Planners in PDDL4J Library (2011.13297v1)

Published 26 Nov 2020 in cs.AI

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Damien Pellier (28 papers)
  2. Humbert Fiorino (21 papers)
Citations (9)