An Experimental Comparison of Three Modified DeltaBlue Algorithms

摘要

We present an experimental comparison of three modified DeltaBlue algorithms for local-propagation-based constraint solving. Our three modified methods are respectively called DeltaDown method, DeltaUp method and DeltaCost method. These methods were designed to speed up the planning phase or the evaluation phase of the original DeltaBlue method using additional cost functions to break a tie of the walkabout strength. Our cost functions are respectively called up cost and down cost. These cost functions can give us information about the upstream and the downstream constraints. Our experiments show that DeltaUp method brings us a considerable improvement of the total per-formance of DeltaBlue method using a small overhead of keeping the cost function.