Automated domain factoring, and planning methods that utilize them, have long been of interest to planning researchers. Recent work in this area yielded new theoretical insight and algorithms, but left many questions open: How to decompose a domain into factors? How to work with these factors? And whether and when decomposition-based methods are useful? This paper provides theoretical analysis that answers many of these questions: it proposes a novel approach to factored planning; proves its theoretical superiority over previous methods; provides insight into how to factor domains; and uses its novel complexity results to analyze when factored planning is likely to perform well, and when not. It also establishes the key role played by the domain's causal graph in the complexity analysis of planning algorithms.
|Number of pages||8|
|State||Published - 1 Dec 2006|
|Event||Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, ICAPS 2006 - Cumbria, United Kingdom|
Duration: 6 Jun 2006 → 10 Jun 2006
|Conference||Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, ICAPS 2006|
|Period||6/06/06 → 10/06/06|