Solving Planning-Graph by Compiling It into CSP

Snow is dumped into a portable compressor which compresses the snow by hydraulic power through three stages into blocks of great density which require much less space than the original show and can hence be carried away with greater economy, or piled up with less commandeering of usable space. Hydraulic strokes are controlled by limit switches. When sufficient density is achieved in the final stage, the hydraulic pressure trips a switch which opens a gate so that continued cycling of the compacting apparatus ejects a highly compacted block of snow. When far enough out, it trips a switch to cause the gate to close, shearing off the projecting block, and dropping the block onto a conveyor. The combination of a swinging guard and pusher plate jointly forming one wall of the hopper permits handling huge quantities of snow.

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

[2]  Maria Fox,et al.  The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.

[3]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[4]  Subbarao Kambhampati,et al.  On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning , 1998, Artif. Intell..

[5]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[6]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[7]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[8]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[9]  Subbarao Kambhampati,et al.  Understanding and Extending Graphplan , 1997, ECP.

[10]  David E. Smith,et al.  Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.

[11]  Rina Dechter,et al.  Dead-End Driven Learning , 1994, AAAI.

[12]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[13]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[14]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[15]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[16]  Subbarao Kambhampati,et al.  Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning , 1999, AIPS.

[17]  Subbarao Kambhampati,et al.  Exploiting Symmetry in the Planning graph via Explanation-Guided Search , 1999, AAAI/IAAI.

[18]  Biplav Srivastava,et al.  RealPlan: Decoupling Causal and Resource Reasoning in Planning , 2000, AAAI/IAAI.

[19]  Alexander Bockmayr,et al.  Mixed Integer Programming Models for Planning Problems , 1998 .

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

[21]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[22]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[23]  Subbarao Kambhampati,et al.  Improving Graphplan's Search with EBL & DDB Techniques , 1999, IJCAI.

[24]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[25]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..

[26]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[27]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[28]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.

[29]  Henry Kautz,et al.  Blackbox: Unifying sat-based and graph-based planning , 1999, International Joint Conference on Artificial Intelligence.