Introduction to AI - Worksheet 9
EXERCISE: 1
- Let the initial state and goal state be given as follows:
Formalise
the problem in Strips and show in detail how Strips solves
this problem.
Assume optimal choices.
- If you don't assume optimal choices, in which way way could
Strips generate a non-optimal plan for the problem? How can
Strips be extended to avoid non-optimal plans?
- In Strips the initial state must be given completely, while
the goal state may be described incompletely. Why is this so?
EXERCISE: 2
- Describe similarities and dissimilarities between GraphPlan and
Strips.
- Generate a plan with GraphPlan for the following problem in the
blocks world:
- How can GraphPlan detect whether no plan exists of a particular
length? Which mechanism is used in GraphPlan to make it
efficient?
© Noel Welsh & Manfred Kerber, 2004, Introduction to AI
23.11.2004
The URL of this page is ftp://ftp.cs.bham.ac.uk/pub/authors/M.Kerber/Teaching/AI/e9.html.
URL of module http://www.cs.bham.ac.uk/~mmk/Teaching/AI/