• Search problems can be divided into two classes:
– Solution is a path from initial state to goal state (Planning)
– Solution is an assignment of variables satisfying certain
constraints (Constraint Satisfaction)
• Local search is a special method for constraint satisfaction
problems
• There are special methods for Planning:
– Search often proceeds through plan space rather than state
space (though first we will talk about state‐space planners)
– Subgoals can be planned independently, reducing the
complexity of the planning problem
9