Factored planning: How, when, and when not

Ronen I. Brafman, Carmel Domshlak

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Pages7-14
Number of pages8
StatePublished - 1 Dec 2006
Externally publishedYes
EventWorkshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, ICAPS 2006 - Cumbria, United Kingdom
Duration: 6 Jun 200610 Jun 2006

Conference

ConferenceWorkshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, ICAPS 2006
Country/TerritoryUnited Kingdom
CityCumbria
Period6/06/0610/06/06

ASJC Scopus subject areas

  • Artificial Intelligence
  • Management Science and Operations Research
  • Applied Mathematics
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Factored planning: How, when, and when not'. Together they form a unique fingerprint.

Cite this