Transition Constraints for Parallel Planning

We present a planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs a new constraint model from domain transition graphs (DTG) of a given planning problem. TCPP encodes the constraint model by using table constraints that allow don't cares or wild cards as cell values. TCPP uses Minion the constraint solver to solve the constraint model and returns the parallel plan. Empirical results exhibit the efficiency of our planning system over state-of-the-art constraint-based planners.

[1]  Amedeo Cesta,et al.  The Timeline Representation Framework as a Planning and Scheduling Software Development Environment , 2008 .

[2]  Roman Barták,et al.  Revisiting Constraint Models for Planning Problems , 2009, ISMIS.

[3]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[4]  Roman Barták,et al.  On Constraint Models for Parallel Planning: The Novel Transition Scheme , 2011, SCAI.

[5]  Maria Fox,et al.  Constraint Based Planning with Composable Substate Graphs , 2010, ECAI.

[6]  Roman Barták,et al.  Enhancing Constraint Models for Planning Problems , 2009, FLAIRS.

[7]  Yixin Chen,et al.  A Novel Transition Based Encoding Scheme for Planning as Satisfiability , 2010, AAAI.

[8]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[9]  Peter Nightingale,et al.  Extending Simple Tabular Reduction with Short Supports , 2013, IJCAI.

[10]  Roman Barták,et al.  Reformulating Constraint Models for Classical Planning , 2008, FLAIRS Conference.

[11]  Fahiem Bacchus,et al.  Generalizing GraphPlan by Formulating Planning as a CSP , 2003, IJCAI.

[12]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[13]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

[14]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[15]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[16]  Ian P. Gent,et al.  Minion: A Fast Scalable Constraint Solver , 2006, ECAI.

[17]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[18]  Roman Barták.  A Novel Constraint Model for Parallel Planning , 2011, FLAIRS Conference.

[19]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[20]  Mark Judge.  Heuristically guided constraint satisfaction for AI planning , 2015 .

[21]  Cédric Pralet,et al.  How to model planning and scheduling problems using constraint networks on timelines , 2010, Knowl. Eng. Rev..

[22]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[23]  Malte Helmert,et al.  Concise finite-domain representations for PDDL planning tasks , 2009, Artif. Intell..

[24]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.