Search:
Computing and Library Services - delivering an inspiring information environment

A Meta-CSP Model for Optimal Planning

Gregory, Peter, Long, Derek and Fox, Maria (2007) A Meta-CSP Model for Optimal Planning. In: Abstraction, Reformulation, and Approximation, 7th International Symposium, SARA 2007. Lecture Notes in Computer Science, 4612 . Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 200-214. ISBN 978-3-540-73579-3

[img] PDF - Accepted Version
Download (306kB)

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: Book Chapter
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
Related URLs:
Depositing User: Peter Gregory
Date Deposited: 10 Jan 2012 10:20
Last Modified: 13 Nov 2015 17:43
URI: http://eprints.hud.ac.uk/id/eprint/12217

Downloads

Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©