To do: Receive a grade
Submissions opened: Thursday, 17 April 2025, 12:05 AM
Submissions close: Wednesday, 23 April 2025, 11:55 PM
Assessments open: Thursday, 24 April 2025, 12:05 AM
Assessments close: Wednesday, 30 April 2025, 11:55 PM
Add submission
Submission phase
Setup phase Submission phase Assessment phase Grading evaluation phase Closed
Current phase
Submit your work Open for assessment
Open for submissions from Thursday, 24
from Thursday, 17 April 2025, 12:05 AM (3
April 2025, 12:05 AM (4 days left)
days ago) Assessment deadline:
Submissions deadline: Wednesday, 30 April
Wednesday, 23 April 2025, 11:55 PM (10
2025, 11:55 PM (3 days days left)
left)
Instructions for submission
In this assignment, you will be designing a Rational Agent which cleans a room with minimum possible actions and the
goal is the entire environment is clean and agent back to home (starting location A)
Part A
In Part A, you need to identify the PEAS (Performance Measure, Environment, Actuators, and Sensors)
Part B
You are required to write pseudo-code in Java or Python to implement this Rational Agent
Your pseudo-code must represent the following:
1. Implementation of the static environment. You need to define array or some other data structure which will
represent the location (A to P)
2. A function/method to determine what action to take. Decision should be Move (Which direction), suck dirt, or Go
back Home.
3. A function/method to determine which direction to go
4. A function/method to identify the route and navigate to home from the current location.
5. A function/method to test if the desired goal is achieved or not.
Part C
Here, you are required to write 1-page minimum summary focusing on the following thoughts:
Your lessons learned from doing this assignment
Do you think your algorithm should be able to reach the goal with given energy points (100)?
What changes do you need to make if your static location gets bigger?
The real world is absurdly complex, for a smart home vacuum cleaner need to consider obstacles like furniture,
human or pet. What changes you need to make to handle these obstacles.
A B D
C
E F G H
I J K L
M N O P
Fig 1: A vacuum-cleaner world with 16 locations (A to P); some locations with dirt and some are not.
Percept Sequence Action
[A, Clean] Move East
[A, Dirty] Suck
[D, Dirty] Suck
[D, Clean] Move South
Fig 2: Partial tabulation of a simple agent function for the vacuum-cleaner world problem.
Prior Knowledge:
1. The entire environment is divided by 4 by 4 square location.
2. The agent (vacuum cleaner) has an initial energy of 100 points.
3. The agent can move only North, South, East, or West. It can’t move diagonally.
4. Each action cost 1 energy point. For example, each move cost 1 energy, each suck cost 1 energy.
5. The agent has a bag that collects dirt. The maximum capacity is 10
6. After each suck, the agent needs to check its bag, if full then go back to Home (location A) and self-empty the bag
and start vacuuming again.
You will be graded on the following:
1. Part A, the PEAS is defined correctly for a Vacuum cleaner agent? (20 points)
2. Part B, the data structure is appropriate for such an environment? (10 points)
3. Part B, the pseudo-code is clearly defined for what action to take in different scenarios? (30 points)
4. Part B, the pseudo-code is clearly defined for whether the agent knows a goal state is achieved or not? (10 points)
5. Part B, the calculation for energy and bag capacity (full yet?) is done correctly? For example, does the agent know
when to head back home for self-empty the bag? (10 points)
6. Part C, all of the questions clearly answered in a minimum 1-page summary? (20 points)
Your submission
You have not submitted your work yet
