• Corpus ID: 701265

A Novel Transition Based Encoding Scheme for Planning as Satisfiability

@inproceedings{Huang2010ANT,
  title={A Novel Transition Based Encoding Scheme for Planning as Satisfiability},
  author={Ruoyun Huang and Yixin Chen and Weixiong Zhang},
  booktitle={AAAI},
  year={2010}
}
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… 

Figures and Tables from this paper

REINFORCED ENCODING FOR PLANNING AS SAT
TLDR
A new encoding scheme is proposed, called Reinforced Encoding, which encodes a planning problem represented in the SAS+ formalism into SAT, which is a combination of the transition-based SASE encoding with the classical propositional encoding.
PASAR - Planning as Satisfiability with Abstraction Refinement
TLDR
This paper presents a further improvement to SAT-based planning by introducing a new algorithm named PASAR based on the principles of counterexample guided abstraction refinement (CEGAR), and finds that combining PASar with forward state-space search techniques leads to promising results.
Accelerating SAT Based Planning with Incremental SAT Solving
TLDR
This work employs incremental SAT solving to increase the capabilities of several modern encodings for SAT based planning to outperform the state-of-the-art SAT based plans system Madagascar in the number of solved instances.
Relaxing the Relaxed Exist-Step Parallel Planning Semantics
  • Tomás Balyo
  • Computer Science
    2013 IEEE 25th International Conference on Tools with Artificial Intelligence
  • 2013
TLDR
A new encoding scheme is proposed which encodes a planning problem represented in the SAS+ formalism using a relaxed Exist-Step semantics of parallel actions and can outperform other state-of-the-art encodings in the number of solved problems within a given limit as well as in thenumber of SAT solver calls needed to find a plan.
A hybrid bit-encoding for SAT planning based on clique-partitioning
TLDR
A novel bit-encoding is presented that reduces the number of bits required to represent actions in a SAT-based automated planning problem and compares the new encodings obtained over some standard planning problems.
Incremental SAT Solving for SAT Based Planning
One of the most successful approaches to automated planning is the translation to propositional satis ability (SAT). This thesis evaluates incremental SAT solving for several modern encodings for SAT
No One SATPlan Encoding To Rule Them All
TLDR
This paper takes recently developed specialized encoding schemes and design a method to automatically select the proper encoding for a given planning problem instance and examines ranking heuristics for the Relaxed Relaxed Exists-Step encoding, which plays an important role in the algorithm.
Modelling and Solving Problems Using SAT Techniques
TLDR
This thesis describes several ways of encoding a planning problem represented in the SAS+ formalism into SAT and proposes a SAT encoding for the problem of plan redundancy which together with MaxSAT solvers allows us to solve the issue of action elimination optimally.
On Propositional Encodings of Cooperative Path-Finding
  • Pavel Surynek
  • Computer Science
    2012 IEEE 24th International Conference on Tools with Artificial Intelligence
  • 2012
TLDR
It is shown that the new domain-dependent encoding enables finding of optimal or near optimal solutions to CPFs in certain hard set-ups where A*-based techniques such as WHCA* fail to do so and that the ALL-DIFFERENT encoding can be solved faster than the existent encoding.
Application of propositional satisfiability to special cases of cooperative path-planning
  • Pavel Surynek
  • Computer Science
    2012 International Conference on Machine Learning and Cybernetics
  • 2012
TLDR
Two new encodings of the problem as SAT are proposed and evaluated and constitute a state-of-the-art method for cooperative path-planning in highly occupied environments.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Automatic SAT-Compilation of Planning Problems
TLDR
A fully-implemented compiler is described that can generate eight major encodings and a number of subsidiary ones, and the compiler is tested on a suite of STRIPS planning problems in order to determine whichencodings have the best properties.
Unifying SAT-based and Graph-based Planning
TLDR
It is shown that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systematic solvers and that polynomialtime SAT simplification algorithms applied to the encoded problem instances are a powerful complement to the "mutex" propagation algorithm that works directly on the plan graph.
SAT Encodings of State-Space Reachability Problems in Numeric Domains
TLDR
This work proposes a method for translating state-space reachability problems into propositional SAT, based on an approximation of reachable variable domains, and shows that it typically outperforms translation to SMT almost up to the point where the formulas don't fit into memory any longer.
SAT-Based Parallel Planning Using a Split Representation of Actions
TLDR
Each action and each parallel execution of actions is represented uniquely as a conjunct of variables in SAT encodings of parallel step-optimal problems, and this encoding yields a much more efficient and scalable planning procedure over the state-of-the-art in a large set of planning benchmarks.
Landmarks Revisited
TLDR
This work proposes a novel approach for using landmarks in planning by deriving a pseudo-heuristic and combining it with other heuristics in a search framework and shows how additional landmarks and orderings can be found using the information present in multi-valued state variable representations of planning tasks.
Planning as satisfiability: parallel plans and algorithms for plan search
Fast Planning Through Planning Graph Analysis
The Fast Downward Planning System
  • M. Helmert
  • Computer Science
    J. Artif. Intell. Res.
  • 2006
TLDR
A full account of Fast Downward's approach to solving multivalued planning tasks is given and a new non-heuristic search algorithm called focused iterative-broadening search, which utilizes the information encoded in causal graphs in a novel way is presented.
COMPLEXITY RESULTS FOR SAS+ PLANNING
TLDR
This article provides a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions and proves that the SAS+‐PUS problem is the maximal tractable problem under the restrictions.
...
1
2
...