On Constraint Models for Parallel Planning: The Novel Transition Scheme

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

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

[3]  Cédric Pralet,et al.  Forward Constraint-Based Algorithms for Anytime Planning , 2009, ICAPS.

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

[5]  Andrea Rendl,et al.  A constraint model for the settlers planning domain , 2008 .

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

[7]  Stéphane Grandcolas,et al.  Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning , 2007, AAAI.

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

[9]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

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

[11]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

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

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

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

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

[16]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.