Write a Java program to simulate the behaviour of a model-based agent for a vacuum cleaner environment based on the following conditions: The vacuum cleaner can move to one of 4 squares: A, B, C, or D as shown in Table 1. Table 1: vacuum cleaner environment A B C D The vacuum cleaner checks the status of all squares and takes action based on the following order: If all squares are clean, the vacuum cleaner stays in its current location. If the current location is not clean, the vacuum cleaner stays in its current location to clean it up. The vacuum cleaner can only move horizontally or vertically (cannot move diagonally). The vacuum cleaner moves only one square at a time. Horizontal moves have the highest priority over vertical moves. The vacuum cleaner moves to another square only when it needs to be cleaned up. If a diagonal square needs to be cleaned up, the vacuum cleaner moves to its neighbour vertical square first. The vacuum cleaner action is evaluated based on the current location and the status of all squares. The program evaluates only one action (one move) at each run. Inputs to the program: Current Location = {A, B, C, D} Status can be represented using Boolean datatype, Where: Clean -> true, and Not Clean -> false A-status = { true, false } B-status = { true, false } C-status = { true, false } D-status = { true, false } Output: Action = {A, B, C, D}
Write a Java
The vacuum cleaner can move to one of 4 squares: A, B, C, or D as shown in Table 1.
Table 1: vacuum cleaner environment
|
A |
B |
|
C |
D |
The vacuum cleaner checks the status of all squares and takes action based on the following order:
-
If all squares are clean, the vacuum cleaner stays in its current location.
-
If the current location is not clean, the vacuum cleaner stays in its current location to clean it up.
-
The vacuum cleaner can only move horizontally or vertically (cannot move diagonally).
-
The vacuum cleaner moves only one square at a time.
-
Horizontal moves have the highest priority over vertical moves.
-
The vacuum cleaner moves to another square only when it needs to be cleaned up. If a diagonal square needs to be cleaned up, the vacuum cleaner moves to its neighbour vertical square first.
-
The vacuum cleaner action is evaluated based on the current location and the status of all squares.
-
The program evaluates only one action (one move) at each run.
Inputs to the program:
-
Current Location = {A, B, C, D}
Status can be represented using Boolean datatype,
Where:
Clean -> true, and
Not Clean -> false
A-status = { true, false }
B-status = { true, false }
C-status = { true, false }
D-status = { true, false }
Output:
-
Action = {A, B, C, D}
![The program accepts five inputs as command line arguments and prints out the action. Please use the template below.
public class MyClass {
public static void main(String args[]) {
char current location = args[0].charAt(0);
// state: true -> clean, false -> not clean
boolean A_status = Boolean.parseBoolean(args[1]);
boolean B_status = Boolean.parseBoolean(args[2]);
boolean C_status =Boolean.parseBoolean(args[3]);
boolean D_status =Boolean.parseBoolean(args[4]);
System.out.println("Current Location = " + current location + "\n"+
"Square A status = "+A_status + "\n"+
"Square B status =" + B_status+ "\n"+
"Square C status =" + C_status+ "\n"+
"Square D status =" + D_status + "\n");
- Next Location = ");
}
System.out.println("\nAction](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3fd06d23-3f74-4635-9f62-11602a559fba%2Fbed906c0-7004-410f-b863-d5bb68388c23%2F535k8rn_processed.png&w=3840&q=75)
Step by step
Solved in 3 steps with 1 images
