Searching for a Solution
For each goal G at time t
- For each action A making G true @t
- If A isn’t mutex with a previously chosen action, select it
- If no actions work, backup to last G (breadth first search)
Recurse on preconditions of actions selected, t-1