Planning Flashcards
1
Q
Classical planning?
A
- 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
2
Q
Solving a problem with classical planning progression search
A
- Start from the initial state to the goal state
3
Q
Solving a problem with classical planning regression search
A
- Start from the goal state to the initial state
4
Q
Situation calculus
A
- Using first order logic for planning
5
Q
What is a planning graph?
A
- 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