The past five years have seen dramatic advances in planning algorithms, with an emphasis
on propositional methods such as GRAPHPLAN and compilers that convert planning …

We describe and evaluate the algorithmic techniques that are used in the FF planning
system. Like the HSP system, FF relies on forward state space search, using a heuristic that …

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 …

Over the years increasingly sophisticated planning algorithms have been developed. These
have made for more efficient planners, but unfortunately these planners still suffer from …

Introduction Page 1 Journal of Artificial Intelligence Research 22 (2004) 215-278 Submitted
05/04; published 11/04 Ordered Landmarks in Planning Jiorg Hoffmann г б вв бд Йз Кбд К …

The Blackbox planning system unifies the planning as satisfiability framework (Kautz and
Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

We present some techniques for planning in domains specified with the recent standard
language PDDL2. 1, supporting'durative actions' and numerical quantities. These …

This paper reviews the connections between Graphplan's planning-graph and the dynamic
constraint satisfaction problem and motivates the need for adapting CSP search techniques …

The widespread use of GUIs for interacting with software is leading to the construction of
more and more complex GUIs. With the growing complexity come challenges in testing the …