Computing and Library Services - delivering an inspiring information environment

Constraint Based Planning with Composable Substate Graphs.

Gregory, Peter, Long, Derek and Fox, Maria (2010) Constraint Based Planning with Composable Substate Graphs. In: ECAI 2010 - 19th European Conference on Artificial Intelligence. IOS Press, Amsterdam, The Netherlands, pp. 453-458. ISBN 978-1-60750-605-8

PDF - Published Version
Download (225kB) | Preview


    Constraint satisfaction techniques provide powerful inference algorithms
    that can prune choices during search. Constraint-based approaches
    provide a useful complement to heuristic search optimal
    planners.We develop a constraint-based model for cost-optimal planning
    that uses global constraints to improve the inference in planning.
    The key novelty in our approach is in a transformation of the
    SAS+ input that adds a form of macro-action to fully connect chains
    of composable operators. This translation leads to the development
    of a natural dominance constraint on the new problem which we add
    to our constraint model.
    We provide empirical results to show that our planner, Constance,
    solves more instances than the current best constraint-based planners.
    We also demonstrate the power of our new dominance constraints in
    this representation.

    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 > Informatics Research Group > Knowledge Engineering and Intelligent Interfaces
    Related URLs:
    Depositing User: Peter Gregory
    Date Deposited: 10 Jan 2012 10:35
    Last Modified: 04 Jun 2013 11:43

    Document Downloads

    Downloader Countries

    More statistics for this item...

    Item control for Repository Staff only:

    View Item

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