A goal- and dependency-directed algorithm for learning hierarchical task networks

  • Authors:

  • Negin Nejati;Tolga Könik;Ugur Kuter

  • Affiliations:

  • Stanford University, Stanford, CA, USA;Stanford University, Stanford, CA, USA;University of Maryland, College Park, MD, USA

  • Venue:
  • Proceedings of the fifth international conference on Knowledge capture
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a system for learning domain-dependent knowledge in the form of goal-indexed Hierarchical Task Networks (HTNs). DLIGHT is a goal-directed incremental learning algorithm which observes solution traces and generates rules for solving problems. One of the main challenges in learning this kind of knowledge is determining a good level of generality. Analytical methods, such as explanation-based macro-operator learning, construct very specific structures that guarantee a successful execution when applicable but generalize poorly to new problems. Previous goal-directed learning approaches produce hierarchical rules with more relaxed preconditions, but the learned knowledge suffers from over-generality. Our approach builds on one such approach but it strikes a better balance between generality and specificity. This is done by carrying out a goal-dependency analysis to determine the structure of the hierarchy and precondition of each rule to follow the successful solutions more closely while maintaining generality. We hypothesize that this algorithm produces HTNs that generalize well and can solve problems efficiently. We evaluate the system's behavior experimentally in several planning scenarios and conclude with related work and future research paths.