Automatically Learning HTN Methods from Landmarks

Ruoxi Li, Dana Nau, Mark Roberts, Morgan Fine-Morris
4/9/2024
cs.AI

No confident code implementation found for this paper.

Abstract

Hierarchical Task Network (HTN) planning usually requires a domain engineer to provide manual input about how to decompose a planning problem. Even HTN-MAKER, a well-known method-learning algorithm, requires a domain engineer to annotate the tasks with information about what to learn. We introduce CURRICULAMA, an HTN method learning algorithm that completely automates the learning process. It uses landmark analysis to compose annotated tasks and leverages curriculum learning to order the learning of methods from simpler to more complex. This eliminates the need for manual input, resolving a core issue with HTN-MAKER. We prove CURRICULAMA's soundness, and show experimentally that it has a substantially similar convergence rate in learning a complete set of methods to HTN-MAKER.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2024automatically,
  title  = {Automatically Learning HTN Methods from Landmarks},
  author = {Ruoxi Li and Dana Nau and Mark Roberts and Morgan Fine-Morris},
  year   = {2024},
  eprint = {2404.06325},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.06325v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.06325.svg)](https://codeofpaper.com/paper/2404.06325)

Discussion