Planning: The “Neutral” Problem Description
Inputs
- a set of states S = {s1, s2, ..., sn}
- a set of actions A={a1, a2, ..., am}
- each action is a partial function ai: S ? S
- a unique initial state si
- a goal region G ? S
Output
- a sequence of actions <b1, b2, ..., bk> such that
bk( ... b3(b2(b1(si))...) ? G