CPSC 322 - Lecture 32

Limitations of the Simple STRIPS Planner

I.  Limitations of the simple STRIPS planner

We began today's lecture with a quick look back at some of
the things we learned about knowledge representation, and
discussed whether the knowledge representation chosen for
STRIPS had the "desriable attributes" of a knowledge 
representation scheme.  We also discussed whether this
knowledge representation approach made for an easier 
solution to the blocks-world planning problem.  Then
we introduced a more difficult blocks-world problem
in which three blocks rested on a table, and our planner's
goal was to stack the blocks on top of each other in a
specified order.

More specifically, our planner was given three blocks,
A, B, and C, on a table top, and was told to build a
tower with A on B, B on C, and C on the table.  The 
simple STRIPS planner from the previous lecture was
unable to solve the problem, for a couple of reasons.
We'll explain next time.