Scribd
Upload
33 views2 pages

AI Assignment

This document provides instructions for an AI assignment to design a robot navigation agent that can find a path from a start to goal state in a maze. The maze is represented as a 2x2 grid with obstacles. The agent must output the path found, sequence of actions, total cost of the path, and a representation of the path on the grid. It must implement greedy best first search, A* search, and IDA* and submit the working code and a one page report describing the node representation, best search for the problem, and instructions to run the program.

Uploaded by

f180226 Usama Mahmood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views2 pages

AI Assignment

This document provides instructions for an AI assignment to design a robot navigation agent that can find a path from a start to goal state in a maze. The maze is represented as a 2x2 grid with obstacles. The agent must output the path found, sequence of actions, total cost of the path, and a representation of the path on the grid. It must implement greedy best first search, A* search, and IDA* and submit the working code and a one page report describing the node representation, best search for the problem, and instructions to run the program.

Uploaded by

f180226 Usama Mahmood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CS 461/401: Artificial

Intelligence ASSIGNMENT 2
Due: 29 April, 2021 (03:00pm)
You can do this in a group of two people or individually [Not more the two].

PROBLEM
Design a robot navigation Agent, which can conduct blind searches to find its path from start to goal
state. As input, the system will take a description of the maize stored as a text file. The maize is a 2x2
grid with obstacles inside it. An example of such a maize is given below:

GOAL

START

The obstacles are filled rectangles of unknown dimensions and can be found anywhere in the maize.
The robot cannot be in those cells. There are 3 actions allowed. Up one cell (cost is 1), right one cell
(cost is 3), diagonally up towards the right (cost is 2). The system should output:
1. The complete path if goal is found otherwise show path’s followed by algorithm to search for
goal
2. The sequence of actions performed to reach the goal from start
3. The total cost of the path
4. A grid which shows the path followed. You do not need graphics for this output. The grid can
be made textually using 1 for obstacles, 0 for empty cells and ‘#’ for path followed
FORMAT OF INPUT FILE
dimensions of the grid (line one TotalCols x TotalRows)
start coordinates (line two)
goal coordinates (line three)
the grid itself (one line per row). There will be a zero for no obstacle and one for an obstacle. As an
example of the above grid please see grid.txt. The (0,0) coordinate is the bottom left cell.
You need to follow this format of text file as your code will be tested with similar grid files.
ALGORITHMS TO IMPLEMENT
1. Greedy Best First Search
2. A* Search
3. IDA*
YOU HAVE TO SUBMIT
1. Working system and code. You can implement this using any programming language. If it is c++
or java code make sure you include the .exe or class file with instructions(readme file) on
running the code WITHOUT a recompilation
2. A printed one page report that has your name and roll number. The report should describe the
following:
a. The data structure you used to represent a node
b. Which search did you find was best for this problem
c. Instructions on running the program
Submit the software on Slate and slip the report to your course instructor. Printed version of the report is
a must if you want your assignment graded.

You might also like