Planning as Search
Search: can easily implement a planner using the standard search code/algorithms
But we would like to
- have a declarative representation for states and actions
- ease in specification (move generator, goal checker)
- could support explanation and learning tasks
- exploit the goal better using a regression algorithm
- we believe fan-out is worse than fan-in
- further exploit the nature of the goal
- goal is a conjunction of subgoals
- common solution technique is “divide and conquer”
- to solve G = G1^G2^..., solve the Gi subgoals separately, and merge the solutions