Classical Planning

Backward Search [Wic11]
1 Backward-search(O, s0, g)
1 π ← the empty plan
2 loop
Planning Methods State Space
1 if s0 |= g then return π
2 A ← {a|a is a ground instance of an operator ∈ O
and γ −1 (g, a) is defined }
3 if A == ∅ then return FAILURE
4 nondeterministically choose an action a ∈ A
5 π ← a.π
6 g ← γ −1 (s, a)
Radek Maˇrík (marikr@felk.cvut.cz) Classical Planning 15. dubna 2013 52 / 71