Extending Dynamic Backtracking to Solve Weighted Conditional CSPs

Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of constraint satisfaction to solve these types of problems, many dynamic and flexible CSP variants have been proposed. One such variant is the Weighted Conditional CSP (WCCSP). So far, however, little work has been done to extend the full suite of CSP search algorithms to solve these CSP variants. In this paper, we extend Dynamic Backtracking and similar backjumpingbased CSP search algorithms to solve WCCSPs by utilizing activity constraints and soft constraints in order to quickly prune infeasible and suboptimal regions of the search space. We provide experimental results on randomly generated WCCSP instances to prove these claims.

• Type: Conference
• Year: 2006
• Where: AAAI
• Authors: Robert T. Effinger, Brian C. Williams
• Keywords: AAAI 2006, CSP Search Algorithms, CSP Variants, Intelligent Agents, Weighted Conditional CSP