Abstract

Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well-known planners such as HSP and FF, Fast Downward is a progression planner, searching the space of world states of a planning task in the forward direction. However, unlike other PDDL planning systems, Fast Downward does not use the propositional PDDL representation of a planning task directly. Instead, the input is first translated into an alternative representation called multivalued planning tasks, which makes many of the implicit constraints of a propositional planning task explicit. Exploiting this alternative representation, Fast Downward uses hierarchical decompositions of planning tasks for computing its heuristic function, called the causal graph heuristic, which is very different from traditional HSP-like heuristics based on ignoring negative interactions of operators. In this article, we give a full account of Fast Downward’s approach to solving multi-valued planning tasks. We extend our earlier discussion of the causal graph heuristic to tasks involving

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
2959	Artificial Intelligence: a Modern Approach - Russell, Norvig - 1995
463	The FF planning system: fast plan generation through heuristic search - Hoffmann, Nebel
411	Planning in a hierarchy of abstraction spaces - Sacerdoti - 1974
347	PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains - Long, Fox
263	Planning as heuristic search - Bonet, Geffner - 2001
258	Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae - Dowling, Gallier - 1984
246	The computational complexity of propositional STRIPS planning - Bylander - 1994
200	GPS: A program that simulates human thought - Newell, Simon - 1963
188	Planning as Search: A Quantitative Approach - Korf - 1987
156	Automatically generating abstractions for planning - Knoblock - 1994
115	Complexity results for SAS+ planning - Bäckström, Nebel - 1995
90	Planning through stochastic local search and temporal action graphs - Gerevini, Saetti, et al.
70	A planning heuristic based on causal graph analysis - Helmert
60	Iterative broadening - Ginsberg, Harvey - 1992
57	PDDL 2.2 – the language for the classical part of the 4th international planning competition - Edelkamp, Hoffmann
56	A reactive planner for a model-based executive - Williams, Nayak - 1997
51	Downward refinement and the efficiency of hierarchical problem solving - Bacchus, Yang - 1993
47	Abstraction in planning - Tenenberg - 1988
46	Local search topology in planning benchmarks: A theoretical analysis - Hoffmann - 2002
44	The deterministic part of IPC-4: An overview - Hoffmann, Edelkamp
42	Exhibiting knowledge in planning problems to minimize state encoding length - Edelkamp, Helmert - 1999
40	The Harpy Speech Recognition System - Lowerre - 1976
32	Structure and complexity of planning with unary operators - Brafman, Domshlak
30	State-variable planning under structural restrictions: Algorithms and complexity - Jonsson, Bäckström - 1998
29	Where ‘ignoring delete lists’ works: Local search topology in planning benchmarks - Hoffmann - 2005
18	Reviving integer programming approaches for AI planning: A branch-and-cut framework - Briel, Vossen, et al. - 2005
17	Incremental planning - JONSSON, BACKSTROM - 1995
13	Multi-Agent Off-line Coordination: Structure and Complexity - Domshlak, Dinitz - 2001
12	Tractable plan existence does not imply tractable plan generation - Jonsson, Backstrom - 1998
12	A theoretical analysis of conjunctive-goal problems - Joslin, Roach - 1989