Commitment strategies in hierarchical task network planning

  • Authors:

  • Reiko Tsuneto;Kutluhan Erol;James Hendler;Dana Nau

  • Affiliations:

  • Dept. of Computer Science, University of Maryland, College Park, MD;Intelligent Automation, Inc., Rockville, MD;Dept. of Computer Science, University of Maryland, College Park, MD and Institute for Systems Research, University of Maryland, College Park, MD;Dept. of Computer Science, University of Maryland, College Park, MD and Institute for Systems Research, University of Maryland, College Park, MD

  • Venue:
  • AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper compares three commitment strategies for HTN planning: (1) a strategy that delays variable bindings as much as possible; (2) a strategy in which no non-primitive task is expanded until all variable constraints are committed; and (3) a strategy that chooses between expansion and variable instantiation based on the number of branches that will be created in the search tree. Our results show that while there exist planning domains in which the first two strategies do well, the third does well over a broader range of planning domains.