ITCS XXXXXXXXXXSpring XXXXXXXXXXHW 02.docxITCS 3153 – Intro to AIProgramming Assignment 02ITCS 3153 – Spring 2023IntroductionThis assignment provides practice on the use and implementation...

I have a programming assignment needed to be completed. It needs to be completed by 7:00pm. The main idea of the assignment is to implement a A star program that gets from the start to the goal.


ITCS 3153 - Spring 2023 - HW 02.docx ITCS 3153 – Intro to AI Programming Assignment 02 ITCS 3153 – Spring 2023 Introduction This assignment provides practice on the use and implementation of AI Search algorithms. Objectives After completing this exercise, students should be able to: ● Implement Java code that utilizes an AI search algorithm. ● Use search to solve a path finding problem. ● Implement code that calculates heuristics. ● Implement the A* search algorithm. What to Submit When you have completed all the programs in an assignment you will create a single zip file that includes your source code for each program. The zip file should only include the .java files. You will upload and submit your zip file to Canvas in the corresponding assignment, in this case Programming Assignment 02. Make sure to use the zip format for your submission. Archive files in any other format (rar for example) do not meet this criterion. You may use a different Java IDE (e.g. NetBeans) to write your code, but you need to make sure that your code runs correctly in eclipse Neon (or later) and Java 1.8 Part 1: Program Requirements In this assignment, you need to write a medium-sized program that implements the A* algorithm to find a path from any two given nodes. In a fully-observable environment where there are both navigable (not blocked) and blocked nodes, an agent needs to find the best path from its starting node to the goal node. Copyright © 2019-2023, Julio C. Bahamón and Brandon Beckwith, UNC Charlotte All Rights Reserved. ITCS 3153 – Intro to AI Your implementation needs to meet the following requirements. 1. This is an individual assignment. You need do your own work. 2. Skeleton code is provided on GitHub along with the accompanying documentation. a. Code: https://github.com/bbeckwi2/AStar b. You should fork / clone the repository to get some practice with Git. If that fails you can download the zip from there. c. Make sure you DO NOT MAKE YOUR CODE PUBLICALLY ACCESSIBLE. This means don’t push to a public repository or post it online. 3. The agent is designed to use the A* algorithm to determine its path. Your code needs to use the Manhattan distance method for calculating the heuristic. Remember: Your heuristic function is a representation of how good or close you are to the goal state. 4. The agent environment is a 15x15 tile-based world that randomly generates nodes that are not navigable (blocked) in 10% of the nodes. Part 2: Creating a Zip File for Assignment Submission 1. In the Eclipse Package Explorer view, expand the Assignment04 Project 2. Select all the java source files and right click on them. 3. From the context menu select Export. 3. From the Export window expand General, select Archive File, and press Next. 4. In the To archive file text field specify H:\ITCS_3153\ITCS_3153_Assignment02_numeric-id.zip as the archive filename. Replace numeric-id with your UNC Charlotte Student ID (800#), e.g. 800123456. Please do not use your name or user/login ID. Copyright © 2019-2023, Julio C. Bahamón and Brandon Beckwith, UNC Charlotte All Rights Reserved. https://github.com/bbeckwi2/AStar ITCS 3153 – Intro to AI 5. In the options section make sure you have selected the following options: Save in zip format Compress the contents of the file Create only selected directories. 6. Press Finish 7. Locate the exported zip file on the file system and submit this file to Canvas. Part 3: Grading Rubric The rubric below will be used to grade your work. Partial points may be awarded for each category. Category Points The program is free of syntax and runtime errors 10 The program uses A* and successfully finds a solution 40 The program utilizes an appropriate heuristic (Manhattan method) 5 Implementing another search algorithm besides A* 15 (bonus) Total Points for a Perfect Score 55 Reminder: you need to do your own work. No external resources can be used, any code that you submit must be your own creation. All cases of cheating will be taken very seriously and could result in you failing the course and in disciplinary action. Examples: ▪ Excessive collaboration. ▪ Code from the Internet. ▪ Code copied from others or from the AIMA book web site. ▪ Code inspired by the AIMA book web site, but used without an appropriate citation. ▪ Code written by others and submitted as yours. ▪ etc. Copyright © 2019-2023, Julio C. Bahamón and Brandon Beckwith, UNC Charlotte All Rights Reserved.