Planning

Question 1

Classical planning?

Answer 1

• Representational language for dealing with states, actions and plans. And to approach complexity by factoring the world into variables.
• State space = k-Boolean variables (2^k states)
• World state = complete assignment of k-Boolean variables
• Belief state = complete assignment of k-Boolean variables, partial assignment, arbitrary formula

Question 2

Solving a problem with classical planning progression search

Answer 2

• Start from the initial state to the goal state

Question 3

Solving a problem with classical planning regression search

Answer 3

• Start from the goal state to the initial state

Question 4

Situation calculus

Answer 4

• Using first order logic for planning

Question 5

What is a planning graph?

Answer 5

• A special data structure called a planning graph can be used to give better heuristic estimates.
• we can search for a solution over the space formed by the planning graph, using an algorithm called GRAPHPLAN.
• The planning graph can’t answer definitively whether G is reachable from S0, but it can estimate how many steps it takes to reach G. T