D. Nau | Semantic Scholar

T. AuO. Ilghami F. Yaman
Business
J. Artif. Intell. Res.
1 December 2003

The features of SHOP2 which enabled it to excel in the competition are described, especially those aspects of SHop2 that deal with temporal and metric planning domains.

View PDF on arXiv

Automated planning - theory and practice

This chapter discusses Classical Planning and its Applications, as well as Neoclassical and Neo-Classical Techniques, and discusses search procedures and Computational Complexity.

SHOP: Simple Hierarchical Ordered Planner

D. NauYue CaoA. LotemHector Muñoz-Avila
Business
IJCAI
31 July 1999

In the authors' 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.

View Paper

HTN planning for Web Service composition using SHOP2

E. SirinB. ParsiaDan WuJ. HendlerD. Nau
Computer Science
J. Web Semant.
1 October 2004

View via Publisher

Automated Planning: Theory & Practice

HTN Planning: Complexity and Expressivity

K. ErolJ. HendlerD. Nau
Computer Science
AAAI
1 August 1994

How the complexity of HTN planning varies with various conditions on the task networks is described.

View Paper

Automated Planning and Acting

M. GhallabD. NauP. Traverso
Computer Science
9 August 2016

This book presents a comprehensive paradigm of planning and acting using the most recent and advanced automated-planning techniques, and explains the computational deliberation capabilities that allow an actor to reason about its actions, choose them, organize them purposefully, and act deliberately to achieve an objective.

View via Publisher

Complexity results for HTN planning

K. ErolJ. HendlerD. Nau
Computer Science
Annals of Mathematics and Artificial Intelligence
1 May 1994

How the complexity of HTN planning varies with various conditions on the task networks, and how it compares to STRIPS-style planning is described.

View on Springer

On the Complexity of Blocks-World Planning

N. GuptaD. Nau
Computer Science
Artif. Intell.
1 August 1992

View via Publisher

UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning

K. ErolJ. HendlerD. Nau
Computer Science
AIPS
13 June 1994

This paper presents a formal syntax and semantics for HTn planning and is able to define an algorithm for HTN planning and prove it sound and complete.

View Paper