Sciweavers

Share
AAAI
2008

Limits and Possibilities of BDDs in State Space Search

11 years 3 months ago
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.
Stefan Edelkamp, Peter Kissmann
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AAAI
Authors Stefan Edelkamp, Peter Kissmann
Comments (0)
books