Skip to content Skip to navigation

Constraint Propagation in Planning

TitleConstraint Propagation in Planning
Publication TypeTechnical Report
Year of Publication1991
AuthorsLe Pape, C
IssueTR029
Date Published01/1991
PublisherCIFE
Publication Languageeng
KeywordsCenter for Integrated Facility Engineering, CIFE, Constraint Propagation, Incremental Problem-Solving, Planning, Predictive Problem-Solving, Reactive Problem-Solving, Scheduling, Stanford University
AbstractConstraint propagation is a deductive activity performed by a constraint propagation system for a problem-solver. It enables the problem-solver to decompose a problem without neglecting interactions between subproblems, determine which subproblems are the most constrained and focus attention accordingly. Constraint propagation techniques are often used to solve planning and scheduling problems. Experiments reported in the past have shown the interest of these techniques in the planning and scheduling domain. In this report, we review various constraint propagation techniques and provide experimental results allowing to compare them on a variety of problems. We conclude that current constraint propagation systems do not enable a human problem-solver to make his (or her) own applications as efficient as possible without the help of a specialist. An interesting avenue of research is to make the adaptation of a generic constraint propagation system manageable by its users. Another is to provide the system with the ability to learn from its experience and adapt itself to the type of planning and scheduling problems it encounters.
URLhttps://purl.stanford.edu/rx233qx1158
PDF Linkhttps://stacks.stanford.edu/file/druid:rx233qx1158/TR029.pdf
Citation Key1078