Download presentation

Presentation is loading. Please wait.

Published byEstevan Daley Modified over 2 years ago

1
1 Finite Constraint Domains

2
2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized consistency u Optimization for arithmetic CSPs

3
3 Finite Constraint Domains u An important class of constraint domains u Use to model constraint problems involving choice: e.G. Scheduling, routing and timetabling u The greatest industrial impact of constraint programming has been on these problems

4
4 Constraint Satisfaction Problems u A constraint satisfaction problem (CSP) consists of: u A constraint C over variables x1,..., Xn u A domain D which maps each variable xi to a set of possible values d(xi) u It is understood as the constraint

5
5 Map Colouring A classic CSP is the problem of coloring a map so that no adjacent regions have the same color Can the map of Australia be colored with 3 colors ?

6
6 4-queens Place 4 queens on a 4 x 4 chessboard so that none can take another. Q1Q2Q3Q4 1 2 3 4 Four variables Q1, Q2, Q3, Q4 representing the row of the queen in each column. Domain of each variable is {1,2,3,4} One solution! -->

7
7 4-queens The constraints: Not on the same row Not diagonally up Not diagonally down

8
8 Smugglers Knapsack Smuggler with knapsack with capacity 9, who needs to choose items to smuggle to make profit at least 30 What should be the domains of the variables?

9
9 Systematic Search Methods u exploring the solution space u complete and sound u efficiency issues u Backtracking (BT) u Generate & Test (GT) exploring individual assignments exploring subspace X Z Y

10
10 Generate & Test u probably the most general problem solving method u Algorithm: generate labelling test satisfaction Drawbacks: Improvements: blind generatorsmart generator --> local search late discovery oftesting within generator inconsistencies--> backtracking

11
11 Backtracking (BT) u incrementally extends a partial solution towards a complete solution u Algorithm: assign value to variable check consistency until all variables labelled u Drawbacks: u thrashing u redundant work u late detection of conflict A C B 1 1 1 1 2 2 A = D, B D, A+C < 4 1 2 D 2 1 1

12
12 GT & BT - Example u Problem: X::{1,2}, Y::{1,2}, Z::{1,2} X = Y, X Z, Y > Z generate & test backtracking

13
13 Simple Backtracking Solver u The simplest way to solve CSPs is to enumerate the possible solutions u The backtracking solver: u Enumerates values for one variable at a time u Checks that no prim. Constraint is false at each stage u Assume satisfiable(c) returns false when primitive constraint c with no variables is unsatisfiable

14
14 Partial Satisfiable u Check whether a constraint is unsatisfiable because of a prim. Constraint with no vars u Partial_satisfiable u Partial_satisfiable(c) u For each primitive constraint c in C u If vars(c) is empty u If satisfiable(c) = false return false u Return true

15
15 Backtrack Solve u Back_solve u Back_solve(c,d) partial_satisfiable u If vars(c) is empty return partial_satisfiable(c) u Choose x in vars(c) u For each value d in d(x) u Let C1 be C with x replaced by d partial_satisfiable( u If partial_satisfiable(c1) then back_solve u If back_solve(c1,d) then return true u Return false

16
16 Backtracking Solve Choose var X domain {1,2} Choose var Y domain {1,2} partial_satisfiable partial_satisfiable false Choose var Z domain {1,2} No variables, and false Variable X domain {1,2} Choose var Y domain {1,2}

17
17 Consistency Techniques u removing inconsistent values from variables’ domains u graph representation of the CSP u binary and unary constraints only (no problem!) u nodes = variables u edges = constraints u node consistency (NC) u arc consistency (AC) u path consistency (PC) u (strong) k-consistency A B C A>5 ABAB A

18
18 Node and Arc Consistency u Basic idea: find an equivalent CSP to the original one with smaller domains of vars u Key: examine 1 prim.Constraint c at a time u Node consistency: (vars(c)={x}) remove any values from domain of x that falsify c u Arc consistency: (vars(c)={x,y}) remove any values from d(x) for which there is no value in d(y) that satisfies c and vice versa

19
19 Node Consistency u Primitive constraint c is node consistent with domain D if |vars(c)| /=1 or u If vars(c) = {x} then for each d in d(x) u X assigned d is a solution of c u A CSP is node consistent if each prim. Constraint in it is node consistent

20
20 Node Consistency Examples Example CSP is not node consistent (see Z) This CSP is node consistent The map coloring and 4-queens CSPs are node consistent. Why?

21
21 Achieving Node Consistency u Node_consistent u Node_consistent(c,d) u For each prim. Constraint c in C node_consistent_primitive u D := node_consistent_primitive(c, D) u Return D u Node_consistent_primitive u Node_consistent_primitive(c, D) u If |vars(c)| =1 then u Let {x} = vars(c) u Return D

22
22 Arc Consistency u A primitive constraint c is arc consistent with domain D if |vars{c}| != 2 or u Vars(c) = {x,y} and for each d in d(x) there exists e in d(y) such that u And similarly for y u A CSP is arc consistent if each prim. Constraint in it is arc consistent

23
23 Arc Consistency Examples This CSP is node consistent but not arc consistent For example the value 4 for X and X < Y. The following equivalent CSP is arc consistent The map coloring and 4-queens CSPs are also arc consistent.

24
24 Achieving Arc Consistency u Arc_consistent_primitive u Arc_consistent_primitive(c, D) u If |vars(c)| = 2 then u Return D u Removes values which are not arc consistent with c

25
25 Achieving Arc Consistency u Arc_consistent u Arc_consistent(c,d) u Repeat u W := d u For each prim. Constraint c in C arc_consistent_primitive u D := arc_consistent_primitive(c,d) u Until W = D u Return D u A very naive version (there are much better)

26
26 Using Node and Arc Cons. u We can build constraint solvers using the consistency methods u Two important kinds of domain u False domain: some variable has empty domain u Valuation domain: each variable has a singleton domain u Extend satisfiable to CSP with val. Domain

27
27 Node and Arc Cons. Solver node_consistent u D := node_consistent(C,D) arc_consistent u D := arc_consistent(C,D) u if D is a false domain u return false u if D is a valuation domain u return satisfiable(C,D) u return unknown

28
28 Node and Arc Solver Example Colouring Australia: with constraints WA NT SA Q NSW V T Node consistency

29
29 Node and Arc Solver Example Colouring Australia: with constraints WA NT SA Q NSW V T Arc consistency

30
30 Node and Arc Solver Example Colouring Australia: with constraints WA NT SA Q NSW V T Arc consistency

31
31 Node and Arc Solver Example Colouring Australia: with constraints WA NT SA Q NSW V T Arc consistency Answer: unknown

32
32 Backtracking Cons. Solver u We can combine consistency with the backtracking solver u Apply node and arc consistency before starting the backtracking solver and after each variable is given a value

33
33 Back. Cons Solver Example There is no possible value for variable Q3! Q1Q2Q3Q4 1 2 3 4 No value can be assigned to Q3 in this case! Therefore, we need to choose another value for Q2.

34
34 Back. Cons Solver Example Q1Q2Q3Q4 1 2 3 4 We cannot find any possible value for Q4 in this case! Backtracking… Find another value for Q3? No! backtracking, Find another value of Q2? No! backtracking, Find another value of Q1? Yes, Q1 = 2

35
35 Back. Cons Solver Example Q1Q2Q3Q4 1 2 3 4

36
36 Back. Cons Solver Example Q1Q2Q3Q4 1 2 3 4

37
37 Node and Arc Solver Example Colouring Australia: with constraints WA NT SA Q NSW V T Backtracking enumeration Select a variable with domain of more than 1, T Add constraintApply consistency Answer: true

38
38 Is AC enough? u empty domain => no solution u cardinality of all domains is 1 => solution u Problem: X::{1,2}, Y::{1,2}, Z::{1,2} X Y, X Z, Y Z 1212 1212 1212 X Y Z

39
39 Path Consistency (PC) u Path (V0 … Vn) is path consistent iff for each pair of compatible values x in D(V0) and y in D(Vn) there exists an instantiation of the variables V1..Vn-1 such that all the constraint (Vi,Vi+1) are satisfied u CSP is path consistent iff each path is path consistent u consistency along the path only V0V0 V1V1 V3V3 V2V2 V4V4 V5V5 ???

40
40 Path Consistency (PC) u checking paths of length 2 is enough u Plus/Minus + detects more inconsistencies than AC - extensional representation of constraints (01 matrix), huge memory consumption - changes in graph connectivity V0V0 V1V1 V3V3 V2V2 V4V4 V5V5 ???

41
41 K -consistency u K-consistency u consistent valuation o (K-1) variables can be extended to K-th variable u strong K-consistency J-consistency for each J K

42
42 Is k-consistency enough ? u If all the domains have cardinality 1=> solution u If any domain is empty => no solution u Otherwise ? u strongly k-consistent constraint graph with k nodes => completeness u for some special kind of graphs weaker forms of consistency are enough

43
43 Consistency Completeness u strongly N-consistent constraint graph with N nodes => solution u strongly K-consistent constraint graph with N nodes (K ??? path consistent but no solution u Special graph structures u tree structured graph => (D)AC is enough A B C D {1,2,3 }

44
44 hyper-arc consistency u A primitive constraint c is hyper-arc consistent with domain D if u for each variable x in c and for each d in d(x) the valuation x-->d can be extended to a solution of c u A CSP is hyper-arc consistent if each prim. Constraint in it is hyper-arc consistent u NC hyper-arc consistency for constraint with 1 var u AC hyper-arc consistency for constraint with 2 var

45
45 Non binary constraints u What about prim. constraints with more than 2 variables? u Each CSP can be transformed into an equivalent binary CSP (dual encoding) u k-consitncy u hyper-arc consistency

46
46 Dual encoding u Each CSP can be transformed into an equivalent binary CSP by ``dual encoding’’: u k-ary constraint c is converted to a dual variable vc with the domain consisting of compatible tuples u for each pair of constraint c,c’ sharing some variable there is a binary constraint between vc and vc’ restricting the dual variables to tuples in which the original shared variables take the same value

47
47 Hyper-arc consistency u hyper-arc consistency: extending arc consistency to arbitrary number of variables u (better than binary representation) u Unfortunately determining hyper-arc consistency is NP-hard (as expensive as determinining if a CSP is satisfiable). u Solution?

48
48 Bounds Consistency u arithmetic CSP: domains = integers u range: [l..u] represents the set of integers {l, l+1,..., u} u idea use real number consistency and only examine the endpoints (upper and lower bounds) of the domain of each variable u Define min(D,x) as minimum element in domain of x, similarly for max(D,x)

49
49 Bounds Consistency u A prim. constraint c is bounds consistent with domain D if for each var x in vars(c) u exist real numbers d1,..., dk for remaining vars x1,..., xk such that min(D,xj),= dj<= max(D,xj) and is a solution of c u and similarly for u An arithmetic CSP is bounds consistent if all its primitive constraints are

50
50 Bounds Consistency Examples Not bounds consistent, consider Z=2, then X-3Y=10 But the domain below is bounds consistent Compare with the hyper-arc consistent domain

51
51 Achieving Bounds Consistency u Given a current domain D we wish to modify the endpoints of domains so the result is bounds consistent u propagation rules do this

52
52 Achieving Bounds Consistency Consider the primitive constraint X = Y + Z which is equivalent to the three forms Reasoning about minimum and maximum values: Propagation rules for the constraint X = Y + Z

53
53 Achieving Bounds Consistency The propagation rules determine that: Hence the domains can be reduced to

54
54 More propagation rules Given initial domain: We determine that new domain:

55
55 Disequations Disequations give weak propagation rules, only when one side takes a fixed value that equals the minimum or maximum of the other is there propagation

56
56 Multiplication If all variables are positive its simple enough But what if variables can be 0 or negative? Example: becomes:

57
57 Multiplication Calculate X bounds by examining extreme values Similarly for upper bound on X using maximum BUT this does not work for Y and Z? As long as min(D,Z) 0 there is no bounds restriction on Y Recall we are using real numbers (e.g. 4/d)

58
58 Multiplication We can wait until the range of Z is non-negative or non-positive and then use rules like division by 0:

59
59 Bounds Consistency Algm u Repeatedly apply the propagation rules for each primitive constraint until there is no change in the domain u We do not need to examine a primitive constraint until the domains of the variables involve are modified

60
60 Bounds Consistency Example Smugglers knapsack problem (no whiskey available) Continuing there is no further change Note how we had to reexamine the profit constraint

61
61 Bounds consistency solver bounds_consistent u D := bounds_consistent(C,D) u if D is a false domain u return false u if D is a valuation domain u return satisfiable(C,D) u return unknown

62
62 Back. Bounds Cons. Solver u Apply bounds consistency before starting the backtracking solver and after each variable is given a value

63
63 Back. Bounds Solver Example Smugglers knapsack problem (whiskey available) Current domain: Initial bounds consistency W = 0 P = 1 (0,1,3) Solution Found: return true

64
64 Back. Bounds Solver Example Smugglers knapsack problem (whiskey available) Current domain: Initial bounds consistencyBacktrack P = 2 false Backtrack P = 3 W = 0 P = 1 (0,1,3) (0,3,0) W = 1 (1,1,1) W = 2 (2,0,0) No more solutions

65
65 Generalized Consistency u Can use any consistency method with any other communicating through the domain, u node consistency : prim constraints with 1 var u arc consistency: prim constraints with 2 vars u bounds consistency: other prim. constraints u Sometimes we can get more information by using complex constraints and special consistency methods

66
66 Alldifferent u alldifferent({V1,...,Vn}) holds when each variable V1,..,Vn takes a different value u alldifferent({X, Y, Z}) is equivalent to u Arc consistent with domain u BUT there is no solution! specialized consistency for alldifferent can find it

67
67 Alldifferent Consistency u let c be of the form alldifferent(V) u while exists v in V where D(v) = {d} u V := V - {v} u for each v’ in V u D(v’) := D(v’) - {d} u DV := union of all D(v) for v in V u if |DV| < |V| then return false domain u return D

68
68 Alldifferent Examples DV = {1,2}, V={X,Y,Z} hence detect unsatisfiability DV = {1,2,3,4,5}, V={X,Y,Z,T} don’t detect unsat. Maximal matching based consistency could

69
69 Other Complex Constraints u schedule n tasks with start times Si and durations Di needing resources Ri where L resources are available at each moment u array access if I = i, then X = Vi and if X != Vi then I != i

70
70 Optimization for CSPs u Because domains are finite can use a solver to build a straightforward optimizer u retry_int_opt u retry_int_opt(C, D, f, best) int_solv u D2 := int_solv(C,D) u if D2 is a false domain then return best u let sol be the solution corresponding to D2 retry_int_opt u return retry_int_opt(C /\ f < sol(f), D, f, sol)

71
71 Retry Optimization Example Smugglers knapsack problem (optimize profit) First solution found: Corresponding solution Next solution found:No next solution! Return best solution

72
72 Backtracking Optimization u Since the solver may use backtrack search anyway combine it with the optimization u At each step in backtracking search, if best is the best solution so far add the constraint f < best(f)

73
73 Back. Optimization Example Smugglers knapsack problem (whiskey available) Current domain: Initial bounds consistency W = 0 P = 1 (0,1,3) Solution Found: add constraint Smugglers knapsack problem (whiskey available)

74
74 Back. Optimization Example Initial bounds consistency P = 2 false P = 3 false W = 1 (1,1,1) Modify constraint W = 0 P = 1 (0,1,3) Smugglers knapsack problem (whiskey available) W = 2 false Return last sol (1,1,1)

75
75 Branch and Bound Opt. u The previous methods,unlike simplex don't use the objective function to direct search u branch and bound optimization for (C,f) u use simplex to find a real optimal, u if solution is integer stop u otherwise choose a var x with non-integer opt value d and examine the problems u use the current best solution to constrain prob.

76
76 Branch and Bound Example Smugglers knapsack problem Solution (2,0,0) = 30 false Solution (1,1,1) = 32 Worse than best sol false

77
77 Finite Constraint Domains Summary u CSPs form an important class of problems u Solving of CSPs is essentially based on backtracking search u Reduce the search using consistency methods u node, arc, bound, generalized u Optimization is based on repeated solving or using a real optimizer to guide the search

Similar presentations

OK

Constraint Satisfaction Problems Russell and Norvig: Chapter 5.1-3.

Constraint Satisfaction Problems Russell and Norvig: Chapter 5.1-3.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on management by objectives drucker Ppt on vodafone company profile Ppt on domain name server Slides for ppt on android Ppt on world book day games Ppt on peak load pricing marginal cost Ppt on bond length and strength Ppt on chapter 3 atoms and molecules worksheet Ppt on high power transmission Ppt on blue eyes topic