The role of macros in tractable planning

Authors:
Anders Jonsson
Affiliations:
Dept. of Information and Communication Technologies, Universitat Pompeu Fabra, Barcelona, Spain
Venue:
Journal of Artificial Intelligence Research
Year:
2009

Citing 20
Cited 6

Planning for conjunctive goals

Artificial Intelligence
Planning as search: a quantitative approach

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
Automatically generating abstractions for planning

Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Special volume on planning and scheduling
State-variable planning under structural restrictions: algorithms and complexity

Artificial Intelligence
Tractable plan existence does not imply tractable plan generation

Annals of Mathematics and Artificial Intelligence
Factored planning: how, when, and when not

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A reactive planner for a model-based executive

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Structure and complexity in planning with unary operators

Journal of Artificial Intelligence Research
Macro-FF: improving AI planning with automatically learned macro-operators

Journal of Artificial Intelligence Research
The fast downward planning system

Journal of Artificial Intelligence Research
The complexity of planning problems with simple causal graphs

Journal of Artificial Intelligence Research
New Islands of tractability of cost-optimal planning

Journal of Artificial Intelligence Research
Planning over chain causal graphs for variables with domains of size 5 Is NP-hard

Journal of Artificial Intelligence Research
Selectively generalizing plans for problem-solving

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Fast planning with iterative macros

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The role of macros in tractable planning over causal graphs

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Factored planning using decomposition trees

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Factored planning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Analyzing search topology without running any search: on the connection between causal graphs and h+

Journal of Artificial Intelligence Research
The influence of k-dependence on the complexity of planning

Artificial Intelligence
Bounded intention planning

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Algorithms and limits for compact plan representations

Journal of Artificial Intelligence Research
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond

Journal of Artificial Intelligence Research
Limitations of acyclic causal graphs for planning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents several new tractability results for planning based on macros. We describe an algorithm that optimally solves planning problems in a class that we call inverted tree reducible, and is provably tractable for several subclasses of this class. By using macros to store partial plans that recur frequently in the solution, the algorithm is polynomial in time and space even for exponentially long plans. We generalize the inverted tree reducible class in several ways and describe modifications of the algorithm to deal with these new classes. Theoretical results are validated in experiments.