Limits and Possibilities of BDDs in State Space Search

This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential lower bounds on the number of BDD nodes for characteristic benchmark problems are derived and validated. In order to optimize the variable ordering, causal graph dependencies are exploited.

• Type: Conference
• Year: 2008
• Where: AAAI
• Authors: Stefan Edelkamp, Peter Kissmann
• Keywords: AAAI 2008, Binary Decision Diagrams, Characteristic Benchmark Problems, Exponential Lower Bounds, Intelligent Agents