Introduction to AI - Worksheet 9 EXERCISE: 1 1. Let the initial state and goal state be given as follows: [strips-fig.jpg] Formalise the problem in Strips and show in detail how Strips solves this problem. Assume optimal choices. 2. 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? 3. In Strips the initial state must be given completely, while the goal state may be described incompletely. Why is this so? EXERCISE: 2 1. Describe similarities and dissimilarities between GraphPlan and Strips. 2. Generate a plan with GraphPlan for the following problem in the blocks world: [graphplan-blocks.jpg] 3. 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 [1]http://www.cs.bham.ac.uk/~mmk/Teaching/AI/ References 1. http://www.cs.bham.ac.uk/~mmk/Teaching/AI/