Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

@article{Do2001PlanningAC,
  title={Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP},
  author={M. Do and S. Kambhampati},
  journal={Artif. Intell.},
  year={2001},
  volume={132},
  pages={151-182}
}
The idea of synthesizing bounded length plans by compiling planning problems into a combinatorial substrate, and solving the resulting encodings has become quite popular in recent years. Most work to-date has however concentrated on compilation to satisfiability (SAT) theories and integer linear programming (ILP). In this paper we will show that CSP is a better substrate for the compilation approach, compared to both SAT and ILP. We describe GP-CSP, a system that does planning by automatically… Expand
Generalizing GraphPlan by Formulating Planning as a CSP
TLDR
This work presents a simple CSP encoding for planning problems and then a set of transformations that can be used to eliminate variables and add new constraints to the encoding, and demonstrates that this approach can be more easily lifted to more complex types of planning than can planning graphs. Expand
Planning as CSP : A Transition Based Encoding
Domain independent automated planning is hard. It has been shown that classical planning is PSPACE complete (Bylander 1994). But the bounded planning problem is in NP. Here bounded means restrictingExpand
Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-15)
TLDR
The design choices and features of RANTANPLAN are described and it is demonstrated that with SMT one can elegantly handle numeric reasoning inside any PDDL domain, thanks to the integration of various background theories with a SAT solver. Expand
Planning as satisfiability with IPC simple preferences and action costs
TLDR
This paper reduces the IPC planning problems with soft goals from IPC-5 and/or action costs from I PC-6 to optimization problems extending SAT and implements these ideas in SATPLAN, and runs a wide experimental analysis on planning problems from I PCs, taking as references state-of-the-art planners on these competitions and the previous SAT-based approach. Expand
Planning as SAT-and QBF-Based reasoning Participating Units :
  • 2006
Planning is a traditional research area in AI. The last decade has witnessed a large body of work in the development of languages and algorithms for planning, up to the point where complex, realisticExpand
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
TLDR
This paper presents a framework for solving this class of propositional CSPs using local search in planning graphs, and shows that LPG is significantly faster than Blackbox and other planners based on planning graphs. Expand
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optimal planners in theExpand
Planning As CSP : A Transition Based Encoding Student : Debdeep
Domain independent automated planning is hard. It has been shown that classical planning is PSPACE complete (Bylander 1994). But the bounded planning problem is in NP. Here bounded means restrictingExpand
A generate-and-test approach for computing “ optimal ” plans in SAT-based planning
Planning as Satisfiability (SAT) is the best approach for optimally (wrt makespan) solving classical planning problems. SAT-based planners, likeSATPLAN, can thus return plans having minimal makespanExpand
A constraint programming formulation for planning: from plan scheduling to plan generation
TLDR
This work is based on the original model of CPT, an optimal temporal planner, and it extends the CPT’s formulation to deal with more expressive constraints, and shows that the general formulation can be used for planning and/or scheduling. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Encoding Plans in Propositional Logic
TLDR
A novel encoding based on the theory of causal planning, that exploits the notion of “lifting” from the theorem-proving community is introduced, which strictly dominates the others in terms of asymptotic complexity. Expand
On the Use of Integer Programming Models in AI Planning
TLDR
The main objective is to show that a carefully chosen IP formulation significantly improves the "strength" of the LP relaxation, and that the resultant LPs are useful in solving the IP and the associated planning problems. Expand
Unifying SAT-based and Graph-based Planning
TLDR
It is shown that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systematic solvers and that polynomialtime SAT simplification algorithms applied to the encoded problem instances are a powerful complement to the "mutex" propagation algorithm that works directly on the plan graph. Expand
On the utility of Plan-space (Causal) Encodings
TLDR
This paper points out the connection between the different ways of proving the correctness of a plan, and the spectrum of possible SAT encodings, and characterize the dimensions along which causal proofs, and consequently, plan-space encodments, can vary, and demonstrates that the relative encoding sizes are indeed correlated with the hardness of solving them. Expand
Automatic SAT-Compilation of Planning Problems
TLDR
A fully-implemented compiler is described that can generate eight major encodings and a number of subsidiary ones, and the compiler is tested on a suite of STRIPS planning problems in order to determine whichencodings have the best properties. Expand
On Reformulating Planning as Dynamic Constraint Satisfaction (extended Abstract)
In recent years, researchers have reformulated STRIPS planning problems as SAT problems or CSPs. In this paper, we discuss the Constraint-Based Interval Planning (CBIP) paradigm, which can representExpand
State-space Planning by Integer Optimization
TLDR
ILP-PLAN can find better quality solutions for a set of hard benchmark logistics planning problems than had been found by any earlier system. Expand
On Reformulating Planning as Dynamic Constraint Satisfaction
TLDR
It is shown that reformulations involving dynamic variable domains restrict the algorithms which can be used to solve the resulting DCSP, and presented an alternative formulation which does not employ dynamic domains, and the relative merits of the different reformulations are described. Expand
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
TLDR
Two types of constraints that can be propagated in backward direction, and carry relevance information are developed: Backward mutex (bmutex) and Bmutex constraints, which attempt to capture the idea that two actions (or propositions) are never relevant together. Expand
CPlan: A Constraint Programming Approach to Planning
TLDR
Evidence is presented that a constraint programming approach to planning does indeed work well and has the advantage in terms of time and space efficiency over the current state-of-the-art planners. Expand
...
1
2
3
4
5
...