Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

A meta-CSP model for optimal planning

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

PDF (strathprints003423.pdf)
Download (353Kb) | Preview


    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
    Notes: Requires Template change to Chapter in Book/Report/Conference proceeding › Conference contribution: Proceedings of SARA 2007
    Keywords: meta-CSP, optimal planning, maxplan, blackbox, Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
    Depositing user: Professor Maria Fox
    Date Deposited: 20 Jun 2007
    Last modified: 20 Jul 2013 21:49

    Actions (login required)

    View Item

    Fulltext Downloads: