Information Technology Reference
In-Depth Information
3. Climb on the box.
4. Grab the bananas.
This is not the only way to get the bananas, but it is the most direct.
9.1.3 States and operators
In general, the planning problems in this chapter are characterized by their states and
operators, as follows:
The states of a planning problem are snapshots of the world that are passed
through while solving the problem. For the two examples, the states are
the sides of the three coins that are showing;
the location of the monkey, the box, and the bananas.
The operators (or moves or actions ) of a planning problem are the ways of going
from one state to another. For the two examples, the operators are
turning over one of the three coins;
climbing on the box (among others).
The initial state of a planning problem is the state of the problem at the outset.
For the two examples, the initial states are
HHT ;
as shown in figure 9.2.
The goal state of a planning problem is the desired state (or states) of the problem
at the end. For the two examples, the goal states are
HHH or TTT ;
any state where the monkey has the bananas.
The planning problems considered in this chapter are always the same: find a way
of going from the initial state of the problem to a goal state by applying a sequence
of operators.
The solution to a planning problem is a plan : a sequence of moves performed in
order, starting from an initial state, and ending at a goal state. In any state along the
way it must be possible to apply the current move legally , that is, without violating
any of the given provisos for the move.
 
 
Search WWH ::




Custom Search