The planning problem
The most basic fully deterministic version of the planning problem is:
Given:
- A set of (possibly) applicable actions
- A starting state
- A goal constraint
Find:
What is a plan (sequence of actions) which leads from the starting state to the goals?
Typically, an optimal or near optimal plan is desired.
Many extensions of the planning problem (into nondeterministic domains for example) exist and are
being worked on.
In general, the planning problem is extremely hard.