Writing The Research Paper A Handbook (7th ed) - Ch 4 the thesis and outline
Outline of Ch 4
-
Upload
lars-martinez -
Category
Documents
-
view
41 -
download
2
description
Transcript of Outline of Ch 4
![Page 1: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/1.jpg)
1
![Page 2: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/2.jpg)
2
Outline of Ch 4Outline of Ch 4
• Best-first search• Greedy best-first search• A* search• Heuristics Functions• Local search algorithms• Hill-climbing search• Simulated annealing search• Local beam search• Genetic algorithms
![Page 3: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/3.jpg)
3
Questions?Questions?
• What further problems will we meet?– Constraints– Multi-agents– Uncertainty
![Page 4: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/4.jpg)
4
Chapter 5
Section 1 – 3
Constraint Satisfaction Constraint Satisfaction ProblemsProblems
![Page 5: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/5.jpg)
5
OutlineOutline
• Constraint Satisfaction Problems (CSP)Constraint Satisfaction Problems (CSP)
• Backtracking search for CSPsBacktracking search for CSPs
• Local search for CSPsLocal search for CSPs
![Page 6: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/6.jpg)
6
Constraint Satisfaction Problems (CSPs)Constraint Satisfaction Problems (CSPs)
Standard search problem:◦ state is a "black box“ – any data structure that supports successor function,
heuristic function, and goal test
CSP:◦ state is defined by variables Xi (i=1,…,n) with values from domain Di
◦ goal test is a set of constraints Ci (i=1,…,m) specifying allowable combinations of values for subsets of variables
Simple example of a formal representation language
Allows useful general-purpose algorithms with more power than standard search algorithms
![Page 7: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/7.jpg)
7
Example: Map-ColoringExample: 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, or (WA,NT) in {(red,green),(red,blue),(green,red),
(green,blue),(blue,red),(blue,green)}
![Page 8: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/8.jpg)
8
Example: Map-ColoringExample: Map-Coloring
Solutions are complete and consistent assignments, e.g., WA = red, NT = green,Q = red,NSW = green,V = red,SA = blue,T = green
•
![Page 9: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/9.jpg)
9
Constraint graphConstraint graph• Binary CSP: each constraint relates two variables
• Constraint graph: nodes are variables, arcs are constraints
![Page 10: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/10.jpg)
10
Varieties of CSPsVarieties of CSPsDiscrete variables
◦ finite domains: n variables, domain size d O(dn) complete assignments e.g., Boolean CSPs, incl.~Boolean satisfiability (NP-complete)
◦ infinite domains: integers, strings, etc. e.g., job scheduling, variables are start/end days for each job need a constraint language, e.g., StartJob1 + 5 ≤ StartJob3
Continuous variables◦ e.g., start/end times for Hubble Space Telescope observations◦ linear constraints solvable in polynomial time by linear
programming
![Page 11: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/11.jpg)
11
Varieties of constraintsVarieties of constraintsUnary constraints involve a single variable,
◦ e.g., SA ≠ green
Binary constraints involve pairs of variables,◦ e.g., SA ≠ WA
Higher-order constraints involve 3 or more variables,◦ e.g., cryptarithmetic column constraints
![Page 12: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/12.jpg)
12
Example: CryptarithmeticExample: Cryptarithmetic
• Variables: F T U W R O X1 X2 X3
• Domains: {0,1,2,3,4,5,6,7,8,9}
• Constraints: Alldiff (F,T,U,W,R,O)– O + O = R + 10 · X1
– X1 + W + W = U + 10 · X2
– X2 + T + T = O + 10 · X3
– X3 = F, T ≠ 0, F ≠ 0
![Page 13: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/13.jpg)
13
Real-world CSPsReal-world CSPs
Assignment problems◦ e.g., who teaches what class
Timetabling problems◦ e.g., which class is offered when and where?
Transportation scheduling
Factory scheduling
Notice that many real-world problems involve real-valued variables
![Page 14: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/14.jpg)
14
Standard search formulation (incremental)Standard search formulation (incremental)
States are defined by the values assigned so far Initial state: the empty assignment { } Successor function: assign a value to an unassigned variable
that does not conflict with current assignment fail if no legal assignments
Goal test: the current assignment is complete
1. This is the same for all CSPs2. Every solution appears at depth n with n variables
use depth-first search3. Path is irrelevant, so can also use complete-state formulation4. b = (n - l )d at depth l, hence n! · dn leaves
![Page 15: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/15.jpg)
15
Backtracking searchBacktracking search Variable assignments are commutative}, i.e.,[ WA = red then NT = green ] same as [ NT = green then WA =
red ] Only need to consider assignments to a single variable at each
node b = d and there are n! · dn leaves, dn possible complete assignments
Depth-first search for CSPs with single-variable assignments is called backtracking search
Backtracking search is the basic uninformed algorithm for CSPs
Can solve n-queens for n ≈ 25
–
![Page 16: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/16.jpg)
16
Backtracking searchBacktracking search
![Page 17: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/17.jpg)
17
Backtracking exampleBacktracking example
![Page 18: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/18.jpg)
18
Backtracking exampleBacktracking example
![Page 19: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/19.jpg)
19
Backtracking exampleBacktracking example
![Page 20: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/20.jpg)
20
Backtracking exampleBacktracking example
![Page 21: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/21.jpg)
21
Improving backtracking efficiencyImproving backtracking efficiency
• 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?
![Page 22: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/22.jpg)
22
Most constrained variableMost constrained variable
• Most constrained variable:choose the variable with the fewest legal values
• a.k.a. minimum remaining values (MRV) heuristic
•
–
![Page 23: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/23.jpg)
23
Most constraining variableMost constraining variable
• Tie-breaker among most constrained variables
• Most constraining variable:
– choose the variable with the most constraints on remaining variables
![Page 24: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/24.jpg)
24
Least constraining valueLeast constraining valueGiven a variable, choose the least constraining value:
◦ the one that rules out the fewest values in the remaining variables
Combining these heuristics makes 1000 queens feasible
![Page 25: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/25.jpg)
25
Forward checkingForward checking• Idea:
– Keep track of remaining legal values for unassigned variables
– Terminate search when any variable has no legal values
–
![Page 26: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/26.jpg)
26
Forward checkingForward checking• Idea:
– Keep track of remaining legal values for unassigned variables
– Terminate search when any variable has no legal values
–
![Page 27: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/27.jpg)
27
Forward checkingForward checking• Idea:
– Keep track of remaining legal values for unassigned variables
– Terminate search when any variable has no legal values
–
![Page 28: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/28.jpg)
28
Forward checkingForward checking• Idea:
– Keep track of remaining legal values for unassigned variables
– Terminate search when any variable has no legal values
–
![Page 29: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/29.jpg)
29
Constraint propagationConstraint propagation Forward checking propagates information from assigned to
unassigned variables, but doesn't provide early detection for all failures:
NT and SA cannot both be blue!
Constraint propagation repeatedly enforces constraints locally
![Page 30: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/30.jpg)
30
Arc consistencyArc consistency• Simplest form of propagation makes each arc consistent
• X Y is consistent ifffor every value x of X there is some allowed y
–
![Page 31: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/31.jpg)
31
Arc consistencyArc consistency• Simplest form of propagation makes each arc consistent
• X Y is consistent ifffor every value x of X there is some allowed y
–
•
![Page 32: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/32.jpg)
32
Arc consistencyArc consistency Simplest form of propagation makes each arc consistent X Y is consistent iff
for every value x of X there is some allowed y
If X loses a value, neighbors of X need to be rechecked
•
–
![Page 33: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/33.jpg)
33
Arc consistencyArc consistency Simplest form of propagation makes each arc consistent X Y is consistent iff
for every value x of X there is some allowed y
If X loses a value, neighbors of X need to be rechecked Arc consistency detects failure earlier than forward checking
Can be run as a preprocessor or after each assignment
–
![Page 34: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/34.jpg)
34
Arc consistency algorithm AC-3Arc consistency algorithm AC-3
• Time complexity: O(n2d3)
![Page 35: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/35.jpg)
35
Local search for CSPsLocal search for CSPsHill-climbing, simulated annealing typically work with
"complete" states, i.e., all variables assignedTo apply to CSPs:
◦ allow states with unsatisfied constraints
◦ operators reassign variable values
Variable selection: randomly select any conflicted variable
Value selection by min-conflicts heuristic:◦ choose value that violates the fewest constraints
◦ i.e., hill-climb with h(n) = total number of violated constraints
![Page 36: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/36.jpg)
36
Min-conflictsMin-conflicts
![Page 37: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/37.jpg)
37
Example: 4-QueensExample: 4-Queens StatesStates: 4 queens in 4 columns (4: 4 queens in 4 columns (444 = 256 states) = 256 states)
ActionsActions: move queen in column: move queen in column
Goal testGoal test: no attacks: no attacks
EvaluationEvaluation: : h(n) h(n) = number of attacks= number of attacks
Given random initial state, can solve Given random initial state, can solve nn-queens in almost constant -queens in almost constant time for arbitrary time for arbitrary nn with high probability with high probability
(e.g., (e.g., nn = 10,000,000) = 10,000,000)
![Page 38: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/38.jpg)
38
The structure of the problemThe structure of the problem• Decompose it into many subproblems(variable number cc)
– O( ddccn/c n/c ) vs. O( ddn n )
• Completely independent subproblems are delicious, then, but rare.– Any tree-structured CSP can be solved in time linear in the number of variables.
![Page 39: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/39.jpg)
39
Reduced to treesReduced to trees• The first approach involves assigning values to some
variables so that the remaining variables form a tree.
![Page 40: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/40.jpg)
40
Reduced to treesReduced to trees
• The second approach is based on constructing a tree decomposition of the constraint graph into a set of connected subproblems
![Page 41: Outline of Ch 4](https://reader035.fdocuments.in/reader035/viewer/2022062422/56813079550346895d965504/html5/thumbnails/41.jpg)
41
SummarySummary CSPs are a special kind of problem:
◦ states defined by values of a fixed set of variables◦ goal test defined by constraints on variable values
Backtracking = depth-first search with one variable assigned per node
Variable ordering and value selection heuristics help significantly
Forward checking prevents assignments that guarantee later failure
Constraint propagation (e.g., arc consistency) does additional work to constrain values and detect inconsistencies
Iterative min-conflicts is usually effective in practice