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.
منابع مشابه
A Rule-based Approach to Dynamic Constraint Satisfaction Problems
Dynamic Constraint Satisfaction Problems Armin Wolf GMD { German National Research Center for Information Technology GMD FIRST, Kekul estra e 7, D-12489 Berlin, Germany E-mail: [email protected] URL: http://www.first.gmd.de Abstract Practical constraint satisfaction problems (CSPs) are rarely statically xed. For instance, in job-shopscheduling express jobs have to be added, while already plann...
متن کاملDynamic Domain Splitting for Numeric CSPs
In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.
متن کاملDynamic Backtracking with Constraint Propagation Application to numeric csps
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local mod...
متن کاملSolving Methods for Conditional Constraint Satisfaction
Typical real world tasks such as configuration or design exhibit dynamic aspects which require extending the basic constraint satisfaction framework. In this paper we use the notion of conditional constraint satisfaction (CondCSP) as defined by [Mittal and Falkenhainer, 1990] to provide a framework in which these problems can be formulated and solved. It has been shown in [Soininen et al., 1999...
متن کاملExact phase transition of backtrack-free search with implications on the power of greedy algorithms
Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any dead-end during a backtracking search, implying that the instance is easy to solve. We prove an exact phase transition of backtrack-free search in some random CSPs, namely in Model RB and in Model RD. This is the firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006