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 (strathprints003423)
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.
Item type: Conference or Workshop Item(Paper) ID code: 3423 Dates: DateEvent2007PublishedKeywords: meta-CSP, optimal planning, maxplan, blackbox, Electronic computers. Computer science, Artificial Intelligence 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: 04 Feb 2021 02:42 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/3423
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)