Homework Help is Here – Start Your Trial Now!
Engineering
AI and Machine Learning
Write a Java program to simulate the behavior 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 neighbor 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. Example: Current Location A-status B-status C-status D-status Action (Stay in or Move to) A Clean Clean Clean Clean A B Not Clean Clean Clean Clean A B Not Clean Clean Clean Not Clean A 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 in the image

Write a Java program to simulate the behavior 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 neighbor 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. Example: Current Location A-status B-status C-status D-status Action (Stay in or Move to) A Clean Clean Clean Clean A B Not Clean Clean Clean Clean A B Not Clean Clean Clean Not Clean A 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 in the image

icon
Related questions
Question

Write a Java program to simulate the behavior of a model-based agent for a vacuum cleaner environment based on the following conditions:

  1. 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

  2. The vacuum cleaner checks the status of all squares and takes action based on the following order:

    1. If all squares are clean, the vacuum cleaner stays in its current location.

    2. If the current location is not clean, the vacuum cleaner stays in its current location to clean it up.

    3. The vacuum cleaner can only move horizontally or vertically (cannot move diagonally).

    4. The vacuum cleaner moves only one square at a time.

    5. Horizontal moves have the highest priority over vertical moves.

    6. 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 neighbor vertical square first.

    7. The vacuum cleaner action is evaluated based on the current location and the status of all squares.

    8. The program evaluates only one action (one move) at each run.

Example:

Current Location

A-status

B-status

C-status

D-status

Action (Stay in or Move to)

A

Clean

Clean

Clean

Clean

A

B

Not Clean

Clean

Clean

Clean

A

B

Not Clean

Clean

Clean

Not Clean

A

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 in the image

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"); } } 11 // Model-based Agent Function // function here System.out.println("\nAction - Next Location = ");
Transcribed Image Text: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"); } } 11 // Model-based Agent Function // function here System.out.println("\nAction - Next Location = ");
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer