Constraint Satisfaction Problems
Identification Problem: problems in which we must simply identify whether a state is a goal state or not, with no regard to how we arrive at that goal.
-
Variables
-
Domain
-
Constraints
- Unary
- Binary
- Higher-order
Backtracking Search
CSPs -> Search Problem by partial assignments
Filtering
-
Forward Checking -> arc consistency -> AC-3 Algorithm
K-consistency
Strong k-consistency
Ordering
-
Minimum Remaining Values
-
Least Constraining Value
Structure
Tree Structure
O ( d N ) O(d^N) O(dN) -> O ( n d 2 ) O(nd^2) O(nd2)
-
Forming a tree structure
cutset conditioning
-
Perform a backwards pass of arc consistency
-
Perform a forward assignment
Local Search
both incomplete and suboptimal
min-conflicts heuristic
-
Hill-Climbing Search
-
Random-restart Hill-Climbing Search
-
Simulated Annealing Search
-
Genetic Algorithm