This report describes a comparison study between the CUDD and BuDDy OBDD package. The performance of the two packages is evaluated on three sets of AI planning problems from the AIPS-98 and AIPS-00 planning competition. Our experiments indicate that CUDD has a slight implementation overhead compared to BuDDy. However, for some problems this overhead is overcome by the fact that CUDD can perform negation in constant time.

5 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by [email protected]