论文信息 - A Novel Transition Based Encoding Scheme for Planning as Satisfiability

A Novel Transition Based Encoding Scheme for Planning as Satisfiability

Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number of clauses by up to 50 fold. Our results show that this encoding scheme improves upon the STRIPS-based encoding, in terms of both time and memory efficiency.

Yixin Chen | Weixiong Zhang | Ruoyun Huang

[1] Yixin Chen,et al. An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization , 2009, ICAPS.

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

[3] Yixin Chen,et al. Long-distance mutual exclusion for planning , 2009, Artif. Intell..

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

[5] Malte Helmert,et al. Landmarks Revisited , 2008, AAAI.

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

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

[8] Abdul Sattar,et al. SAT-Based Parallel Planning Using a Split Representation of Actions , 2009, ICAPS.

[9] Armando Tacchella,et al. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..

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

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

[12] Jörg Hoffmann,et al. SAT Encodings of State-Space Reachability Problems in Numeric Domains , 2007, IJCAI.