Technical Report No. 120 - Abstract

S. Edelkamp, F. Reffel
Deterministic State Space Planning with BDDs

The paper proposes a planner that uses BDDs to compactly represent blocks of propositionally represented states. Using this representation, accurate reachability analysis and backward chaining can apparently be carried out without necessarily encountering exponential representation explosion. The main objectives are the interest in optimal solutions, the generality and the conciseness of the approach. The algorithms are tested against the AIPS98 planning competition problems and lead to substantial improvements to existing solutions.