Constraints Satisfaction Problem - PowerPoint PPT Presentation

Constraints Satisfaction Problem

1 / 59
Constraints Satisfaction Problem

Constraints Satisfaction Problem

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

1. Constraints Satisfaction Problem S.P.Vimal BITS-Pilani EA C461 Artificial Intelligence

2. To discuss • What is CSP? • Backtracking for CSP • Local search for CSP’s • Problem structure and decomposition EA C461 Artificial Intelligence

3. Constraint satisfaction problems • What is a CSP? • Finite set of variables V1, V2, …, Vn • Finite set of variables C1, C2, …, Cm • Nonemtpy domain of possible values for each variable DV1, DV2, … DVn • Each constraint Ci limits the values that variables can take, e.g., V1 ≠ V2 • A state is defined as an assignment of values to some or all variables. • Consistent assignment: assignment does not not violate the constraints. • An assignment is complete when every value is mentioned. • A solution to a CSP is a complete assignment that satisfies all constraints. • Some CSPs require a solution that maximizes an objective function. EA C461 Artificial Intelligence

4. CSP example: map coloring • Variables: WA, NT, Q, NSW, V, SA, T • Domains: Di={red,green,blue} • Constraints:adjacent regions must have different colors. • E.g. WA  NT (if the language allows this) • E.g. (WA,NT)  {(red,green),(red,blue),(green,red),…} EA C461 Artificial Intelligence

5. CSP example: map coloring • Solutions are assignments satisfying all constraints, e.g. {WA=red,NT=green,Q=red,NSW=green,V=red,SA=blue,T=green} EA C461 Artificial Intelligence

6. Constraint graph • CSP benefits • Standard representation pattern • Generic goal and successor functions • Generic heuristics (no domain specific expertise). • Constraint graph = nodes are variables, edges show constraints. • Graph can be used to simplify search. • e.g. Tasmania is an independent subproblem. EA C461 Artificial Intelligence

7. Example; cryptharithmetic EA C461 Artificial Intelligence

8. CSP as a standard search problem • A CSP can easily expressed as a standard search problem. • Incremental formulation • Initial State: the empty assignment {}. • Successor function: Assign value to unassigned variable provided that there is not conflict. • Goal test: the current assignment is complete. • Path cost: as constant cost for every step. • This is the same for all CSP’s !!! • Solution is found at depth n (if there are n variables). • Hence depth first search can be used. • Path is irrelevant, so complete state representation can also be used. • CSPs are commutative EA C461 Artificial Intelligence

9. Backtracking search • Chooses values for one variable at a time and backtracks when a variable has no legal values left to assign. • Uninformed algorithm • No good general performance function BACKTRACKING-SEARCH(csp) return a solution or failure returnRECURSIVE-BACKTRACKING({} , csp) EA C461 Artificial Intelligence

10. Backtracking search function RECURSIVE-BACKTRACKING(assignment, csp) returna solution or failure ifassignment is complete then returnassignment var SELECT-UNASSIGNED-VARIABLE(VARIABLES[csp],assignment,csp) for eachvalue inORDER-DOMAIN-VALUES(var, assignment, csp)do ifvalue is consistent with assignment according to CONSTRAINTS[csp] then add {var=value} to assignment result RECURSIVE-BACTRACKING (assignment, csp) if result  failure then return result remove {var=value} from assignment returnfailure EA C461 Artificial Intelligence

11. Backtracking example EA C461 Artificial Intelligence

12. Backtracking example EA C461 Artificial Intelligence

13. Backtracking example EA C461 Artificial Intelligence

14. Backtracking example EA C461 Artificial Intelligence

15. Improving backtracking efficiency • Previous improvements  introduce heuristics • General-purpose methods can give huge gains in speed: • Which variable should be assigned next? • In what order should its values be tried? • Can we detect inevitable failure early? • Can we take advantage of problem structure? EA C461 Artificial Intelligence

16. Minimum remaining values var SELECT-UNASSIGNED-VARIABLE (VARIABLES[csp], assignment, csp) • A.k.a. most constrained variable heuristic • Rule: choose variable with the fewest legal moves • Which variable shall we try first? EA C461 Artificial Intelligence

17. Degree heuristic • Use degree heuristic • Rule: select variable that is involved in the largest number of constraints on other unassigned variables. • Degree heuristic is very useful as a tie breaker. • In what order should its values be tried? EA C461 Artificial Intelligence

18. Least constraining value • Least constraining value heuristic • Rule: given a variable choose the least constraining value i.e. the one that leaves the maximum flexibility for subsequent variable assignments. EA C461 Artificial Intelligence

19. Forward checking • Can we detect inevitable failure early? • And avoid it later? • Forward checking idea: keep track of remaining legal values for unassigned variables. • Terminate search when any variable has no legal values. EA C461 Artificial Intelligence

20. Forward checking • Assign {WA=red} • Effects on other variables connected by constraints with WA • NT can no longer be red • SA can no longer be red EA C461 Artificial Intelligence

21. Forward checking • Assign {Q=green} • Effects on other variables connected by constraints with WA • NT can no longer be green • NSW can no longer be green • SA can no longer be green • MRV heuristic will automatically select NT and SA next, why? EA C461 Artificial Intelligence

22. Forward checking • If V is assigned blue • Effects on other variables connected by constraints with WA • SA is empty • NSW can no longer be blue • FC has detected that partial assignment is inconsistent with the constraints and backtracking can occur. EA C461 Artificial Intelligence

23. Constraint propagation • Solving CSPs with combination of heuristics plus forward checking is more efficient than either approach alone. • FC checking propagates information from assigned to unassigned variables but does not provide detection for all failures. • NT and SA cannot be blue! • Constraint propagation repeatedly enforces constraints locally EA C461 Artificial Intelligence

24. Arc consistency • X  Y is consistent iff for every value x of X there is some allowed y • SA  NSW is consistent iff SA=blue and NSW=red EA C461 Artificial Intelligence

25. Arc consistency • X  Y is consistent iff for every value x of X there is some allowed y • NSW  SA is consistent iff NSW=red and SA=blue NSW=blue and SA=??? Arc can be made consistent by removing blue from NSW EA C461 Artificial Intelligence

26. Arc consistency • Arc can be made consistent by removing blue from NSW • RECHECK neighbours !! • Remove red from V EA C461 Artificial Intelligence

27. Arc consistency • Arc can be made consistent by removing blue from NSW • RECHECK neighbours !! • Remove red from V • Arc consistency detects failure earlier than FC • Can be run as a preprocessor or after each assignment. • Repeated until no inconsistency remains EA C461 Artificial Intelligence

28. Arc consistency algorithm function AC-3(csp) return the CSP, possibly with reduced domains inputs: csp, a binary csp with variables {X1, X2, …, Xn} local variables: queue, a queue of arcs initially the arcs in csp while queue is not empty do (Xi, Xj)  REMOVE-FIRST(queue) if REMOVE-INCONSISTENT-VALUES(Xi, Xj)then for each Xkin NEIGHBORS[Xi] do add (Xi, Xj) to queue function REMOVE-INCONSISTENT-VALUES(Xi, Xj) returntrue iff we remove a value removed false for eachxin DOMAIN[Xi] do if no value y inDOMAIN[Xi]allows (x,y) to satisfy the constraints between Xi and Xj then delete x from DOMAIN[Xi]; removed true return removed EA C461 Artificial Intelligence

29. K-consistency • Arc consistency does not detect all inconsistencies: • Partial assignment {WA=red, NSW=red} is inconsistent. • Stronger forms of propagation can be defined using the notion of k-consistency. • A CSP is k-consistent if for any set of k-1 variables and for any consistent assignment to those variables, a consistent value can always be assigned to any kth variable. • E.g. 1-consistency or node-consistency • E.g. 2-consistency or arc-consistency • E.g. 3-consistency or path-consistency EA C461 Artificial Intelligence

30. K-consistency • A graph is strongly k-consistent if • It is k-consistent and • Is also (k-1) consistent, (k-2) consistent, … all the way down to 1-consistent. • This is ideal since a solution can be found in time O(nd) instead of O(n2d3) • YET no free lunch: any algorithm for establishing n-consistency must take time exponential in n, in the worst case. EA C461 Artificial Intelligence

31. Further improvements • Checking special constraints • Checking Alldif(…) constraint • E.g. {WA=red, NSW=red} • Checking Atmost(…) constraint • Bounds propagation for larger value domains EA C461 Artificial Intelligence

32. Intelligent Backtracking EA C461 Artificial Intelligence

33. Intelligent Backtracking EA C461 Artificial Intelligence

34. Intelligent Backtracking EA C461 Artificial Intelligence

35. Intelligent Backtracking EA C461 Artificial Intelligence

36. Intelligent Backtracking ? EA C461 Artificial Intelligence

37. Intelligent Backtracking • Standard form is chronological backtracking i.e. try different value for preceding variable. • More intelligent, backtrack to conflict set. • Set of variables that caused the failure or set of previously assigned variables that are connected to X by constraints. • Backjumping moves back to most recent element of the conflict set. EA C461 Artificial Intelligence

38. Intelligent Backtracking • Standard form is chronological backtracking i.e. try different value for preceding variable. • More intelligent, backtrack to conflict set. • Set of variables that caused the failure or set of previously assigned variables that are connected to X by constraints. • Backjumping moves back to most recent element of the conflict set. • Every branch pruned by backjumping is also pruned by forward checking EA C461 Artificial Intelligence

39. Intelligent Backtracking WA – NSW - EA C461 Artificial Intelligence

40. Intelligent Backtracking WA – NSW - T -- EA C461 Artificial Intelligence

41. Intelligent Backtracking WA – NSW - T – ??? EA C461 Artificial Intelligence

42. Intelligent Backtracking WA – NSW - T – SA – Q – NT & V?? EA C461 Artificial Intelligence

43. Intelligent Backtracking Conflict Set {WA,SA, Q}  {WA,SA, NSW}  { WA, NSW} WA – NSW - T – SA – Q – NT EA C461 Artificial Intelligence

44. Intelligent Backtracking Conflict Set {WA,SA, Q}  {WA,SA, NSW}  { WA, NSW} Conflict Directed Back Jumping : Let Xj be the current variable, and let conf(Xj) be it’s conflict set. If for every possible value for Xj fails, backjump to the most recent variable Xi in conf(Xj) Now the conf(Xi)= conf(Xj)U conf(Xi)- {Xi} Brings us to the right point in the search tree WA – NSW - T – SA – Q – NT EA C461 Artificial Intelligence

45. Local search for CSP • Use complete-state representation • For CSPs • allow states with unsatisfied constraints • operators reassign variable values • Variable selection: randomly select any conflicted variable • Value selection: min-conflicts heuristic • Select new value that results in a minimum number of conflicts with the other variables EA C461 Artificial Intelligence

46. Local search for CSP function MIN-CONFLICTS(csp, max_steps) return solution or failure inputs: csp, a constraint satisfaction problem max_steps, the number of steps allowed before giving up current an initial complete assignment for csp for i= 1 to max_stepsdo ifcurrent is a solution for csp then return current var a randomly chosen, conflicted variable from VARIABLES[csp] value the value v for var that minimize CONFLICTS(var,v,current,csp) set var = value in current return failure EA C461 Artificial Intelligence

47. Min-conflicts example • A two-step solution for an 8-queens problem using min-conflicts heuristic. • At each stage a queen is chosen for reassignment in its column. • The algorithm moves the queen to the min-conflict square breaking ties randomly. EA C461 Artificial Intelligence

48. Advantages of local search • The runtime of min-conflicts is roughly independent of problem size. • Solving the millions-queen problem in roughly 50 steps. • Local search can be used in an online setting. • Backtrack search requires more time EA C461 Artificial Intelligence

49. Problem structure • How can the problem structure help to find a solution quickly? • Subproblem identification is important: • Coloring Tasmania and mainland are independent subproblems • Identifiable as connected components of constrained graph. • Improves performance EA C461 Artificial Intelligence

50. Problem structure • Suppose each problem has c variables out of a total of n. • Worst case solution cost is O(n/c dc), i.e. linear in n • Instead of O(d n), exponential in n • E.g. n= 80, c= 20, d=2 • 280 = 4 billion years at 1 million nodes/sec. • 4 * 220= .4 second at 1 million nodes/sec EA C461 Artificial Intelligence
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}