Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Exercise 6 . 5 Suppose you must solve planning problems for cleaning a house. Various rooms can be dusted ( making the room dust -

Exercise 6.5 Suppose you must solve planning problems for cleaning a house. Various rooms can be dusted (making the room dust-free) or swept (making the room have a clean floor), but the robot can only sweep or dust a room if it is in that room. Sweeping causes a room to become dusty (i.e., not dust-free). The robot can only dust a room if the dustcloth is clean; but dusting rooms that are extra-dusty, like the garage, cause the dustcloth to become dirty. The robot can move directly from any room to any other room.
Assume there are only two rooms, the garage - which, if it is dusty, is extradusty - and the living room - which is not extra-dusty. Assume the following features:
Lr_dusty is true when the living room is dusty.
Gar_dusty is true when the garage is dusty.
Lr_dirty floor is true when the living room floor is dirty.
Gar dirty_floor is true when the garage floor is dirty.
Dustcloth_clean is true when the dust cloth is clean.
Rob_loc is the location of the robot, with values garage, lr.
Suppose the robot can do one of the following actions at any time:
move: move to the other room
dust: dust the room the robot is in, as long as the room is dusty and the dustcloth is clean
sweep: sweep the floor the robot is in.
(a) Give the STRIPS representation for dust. [Hint: Because STRIPS cannot represent conditional effects, you may need to use two separate actions that depend on the robot's location.]
(b) Give the feature-based representation for lr dusty.
(c) Suppose that the initial state is that the robot is in the garage, both rooms are dusty but have clean floors and the goal is to have both rooms not dusty. Draw the first two levels (with two actions, so the root has children and grandchildren) of a forward planner with multiple-path pruning, showing the actions (but do not give the state descriptions). Show explicitly what nodes are pruned through multiple-path pruning.
(d) Pick two of the states at the second level (after two actions) and show what is true in those states.
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Administration The Complete Guide To Dba Practices And Procedures

Authors: Craig S. Mullins

2nd Edition

0321822943, 978-0321822949

More Books

Students also viewed these Databases questions

Question

Why do HCMSs exist? Do they change over time?

Answered: 1 week ago