hw3 - CS 440: Introduction to AI Homework 3 (not collected,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 440: Introduction to AI Homework 3 (not collected, not graded) September 30, 2010 For problems 1 and 2 refer to Figure 10.14 in our text (this is Figure 11.17 in the second edition). It shows a robot (Shakey), four boxes, five rooms (1-4 and a corridor), and four doors connecting some of the rooms. Ignore the light switches. Shakey is quite strong and can carry up to two boxes at a time. 1 Planning States Call the initial state illustrated in the figure, S0. Use the relations ROOM(x), ROBOT(x), BOX(x), DOOR(x), IN ROOM(x,y) [meaning x is in room y], IS CARRYING(x,y) [box y is being carried by x], CONNECTS(x,y,z) [door x connects rooms y to z]. You may invent other relations only if you justify why they are required. 1. Give a situation calculus specification for S0 noting which elements must necessarily be treated as fluents. 2. Give a Strips specification for S0 noting which elements must necessarily be treated as fluents.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/30/2011 for the course ECE 448 taught by Professor Levinson during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 2

hw3 - CS 440: Introduction to AI Homework 3 (not collected,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online