AI Chat AI Image Generator AI Video Text to Speech

Totally and Partially Ordered Hierarchical Planners in PDDL4J Library

11/26/2020

∙

by Damien Pellier, et al.

∙

∙

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.

Damien Pellier
26 publications
Humbert Fiorino
19 publications

page 1

page 2

research

∙ 10/19/2012

A possibilistic handling of partially ordered information

In a standard possibilistic logic, prioritized information are encoded b...

0 Salem Benferhat, et al. ∙

research

∙ 05/25/2023

A Fast Algorithm for Consistency Checking Partially Ordered Time

Partially ordered models of time occur naturally in applications where a...

0 Leif Eriksson, et al. ∙

research

∙ 08/10/2021

Multi-Valued Cognitive Maps: Calculations with Linguistic Variables without Using Numbers

A concept of multi-valued cognitive maps is introduced in this paper. Th...

0 Dmitry Maximov, et al. ∙

research

∙ 03/19/2021

Learning Task Decomposition with Ordered Memory Policy Network

Many complex real-world tasks are composed of several levels of sub-task...

35 Yuchen Lu, et al. ∙

research

∙ 02/06/2018

Causal Linearizability: Compositionality for Partially Ordered Executions

In the interleaving model of concurrency, where events are totally order...

0 Simon Doherty, et al. ∙

research

∙ 07/21/2019

Logical Classification of Partially Ordered Data

Issues concerning intelligent data analysis occurring in machine learnin...

0 Elena V. Djukova, et al. ∙

research

∙ 12/20/2017

Sheaf-Theoretic Stratification Learning

In this paper, we investigate a sheaf-theoretic interpretation of strati...

0 Adam Brown, et al. ∙