A meta-CSP model for optimal planning

Gregory, Peter and Long, Derek and Fox, Maria; Ruml, W. and Miguel, I., eds. (2007) A meta-CSP model for optimal planning. In: Seventh Symposium on Abstraction, Reformulation and Approximation (SARA), 2007-07-18 - 2007-07-21.

Preview

Text. Filename: strathprints003423.pdf Accepted Author Manuscript Download (278kB)| Preview

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.

• Share and Export
  

  MPEG-21 DIDLASCII CitationHTML CitationRefWorksMETSSimple MetadataRDF+XMLMultiline CSVEndNoteEP3 XMLBibTeXRDF+N3AtomData Cite XMLMODSJSONOpenURL ContextObject in SpanRDF+N-TriplesDublin CoreReferOpenURL ContextObjectRIOXX2 XMLRIS (EndNote Online, Zotero, Ref manager, etc)
• Item metadata

  Item type:	Conference or Workshop Item(Paper)
  ID code:	3423
  Dates:	Date Event 2007 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Professor Maria Fox
  Date deposited:	20 Jun 2007
  Last modified:	11 Nov 2024 16:12
  Related URLs:	Event
  URI:	https://strathprints.strath.ac.uk/id/eprint/3423