Encoding Domain Transitions for Constraint-Based Planning

We describe a constraint-based automated planner named Transition Constraints for Parallel Planning (TCPP). TCPP constructs its constraint model from a redefined version of the domain transition graphs (DTG) of a given planning problem. TCPP encodes state transitions in the redefined DTGs by using table constraints with cells containing don't cares or wild cards. TCPP uses Minion the constraint solver to solve the constraint model and returns a parallel plan. We empirically compare TCPP with the other state-of-the-art constraint-based parallel planner PaP2. PaP2 encodes action successions in the finite state automata (FSA) as table constraints with cells containing sets of values. PaP2 uses SICStus Prolog as its constraint solver. We also improve PaP2 by using don’t cares and mutex constraints. Our experiments on a number of standard classical planning benchmark domains demonstrate TCPP's efficiency over the original PaP2 running on SICStus Prolog and our reconstructed and enhanced versions of PaP2 running on Minion.

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

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

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

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

[5]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[6]  Stefan Edelkamp,et al.  Automated Planning: Theory and Practice , 2007, Künstliche Intell..

[7]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

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

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

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

[11]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

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

[13]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[14]  Peter van Beek,et al.  Constraint Programming Lessons Learned from Crossword Puzzles , 2001, Canadian Conference on AI.

[15]  Malik Ghallab,et al.  Representation and Control in IxTeT, a Temporal Planner , 1994, AIPS.

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

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

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

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

[20]  John N. Hooker,et al.  A Search-Infer-and-Relax Framework for Integrating Solution Methods , 2005, CPAIOR.

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

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

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

[24]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

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

[26]  Kostas Stergiou,et al.  Experimental Evaluation of Modern Variable Selection Strategies in Constraint Satisfaction Problems , 2008, RCRA.

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

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

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

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

[31]  Abdul Sattar,et al.  Transition Constraints for Parallel Planning , 2015, AAAI.

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