A meta-CSP model for optimal planning

Peter Gregory, Derek Long, Maria Fox, W. Ruml (Editor), I. Miguel (Editor)

Research output: Contribution to conferencePaperpeer-review

5 Citations (Scopus)
11 Downloads (Pure)

Abstract

One approach to optimal planning is to first start with a sub-optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an increase in the size of the model to be solved.We introduce a reformulation of the planning problem in which the problem is described as a meta-CSP, which controls the search of an underlying SAT solver. Our results show that this approach solves a greater number of problems than both Maxplan and Blackbox, and our analysis discusses the advantages and disadvantages of searching in the backwards direction.
Original languageEnglish
Pages200-214
Number of pages14
Publication statusPublished - 2007
EventSeventh Symposium on Abstraction, Reformulation and Approximation (SARA) - Whistler, Canada
Duration: 18 Jul 200721 Jul 2007

Conference

ConferenceSeventh Symposium on Abstraction, Reformulation and Approximation (SARA)
CityWhistler, Canada
Period18/07/0721/07/07

Keywords

  • meta-CSP
  • optimal planning
  • maxplan
  • blackbox

Fingerprint Dive into the research topics of 'A meta-CSP model for optimal planning'. Together they form a unique fingerprint.

Cite this