SHOP: simple hierarchical ordered planner

  • Authors:
  • Dana Nau;Yue Cao;Amnon Lotem;Hector Munoz-Avila

  • Affiliations:
  • Department of Computer Science and Institute for Systems Research, University of Maryland, College Park, MD;Department of Computer Science and Institute for Systems Research, University of Maryland, College Park, MD;Department of Computer Science and Institute for Systems Research, University of Maryland, College Park, MD;Department of Computer Science and Institute for Systems Research, University of Maryland, College Park, MD

  • Venue:
  • IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

SHOP (Simple Hierarchical Ordered Planner) is a domain-independent HTN planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goal-interaction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planning process, it can use highly expressive domain representations. For example, it can do planning problems that require complex numeric computations. • In our tests, SHOP was several orders of magnitude faster man Blackbox and several times faster than TLpian, even though SHOP is coded in Lisp and the other planners are coded in C.