You need to have JavaScript enabled in order to access this site.

Project 2: A* Search: CS 5013

Due No Due Date
Points 100
Submitting a file upload
File Types pdf

Before starting to work on this assignment, please view the Project Module (Links to an external site.).

Once you have looked over the project module, please utilize the Project 2 (Links to an external site.)

This project will take 6-10 hours to complete (you should be familiar with the code base from the previous assignment and you can build on your previous code, potentially making it shorter). Note, as with the last project, graduate students have additional requirements.

By the end of this project, you will have accomplished the following objectives.

Create an agent that moves around the board in a near-optimal manner using A*
Implement A* search in a real-world environment
Become familiar with implementing agents in an existing codebase
Compete on the class-wide competition ladder

Rubric

Title:

Keep in mind that 19 students have already been assessed using this rubric. Changing it will affect their evaluations.

Project 2: A*: CS 5013

Project 2: A*: CS 5013
Criteria	Ratings	Pts
Astar _5434 threshold: pts Edit criterion description	30 to >25.0 pts Full Marks Correctly implementing A∗. A correct player will have an admissible heuristic and will move to the target beacons efficiently. The ship will rarely run into obstacles, other ships, or bullets. It should collect a fair number of beacons by the end of the game. Sample projects and point distributions are given below. Full credit requires FULL code documentation explaining what each function does. The top of each java file should also contain a 2-3 sentence description of everything that java file does. blank 25 to >20.0 pts Minor mistake one minor mistake. An example of a minor mistake would be having off-by one errors (where you miss a search node). You can also lose 5 points for not documenting your code well (but at least somewhat). _2841 20 to >17.0 pts Several minor mistakes _986 17 to >15.0 pts Major error _9126 15 to >8.0 pts Several major errors _3356 8 to >5.0 pts Search but not A* a search other than A∗ that at least moves the agent around the environment in an intelligent manner. _436 5 to >0.0 pts Non-random movements an agent that at least does something other than random movements. _478 0 to >0 pts No marks blank_2 This area will be used by the assessor to leave comments related to this criterion.	pts / 30 pts --
Graphics 14868_9424 threshold: pts Edit criterion description	10 to >7.0 pts Full Marks Correctly drawing graphics that enable you to debug your A* search and that help us to grade it. This means you should display your graph either all at once (if you initialize it that way) or step-by-step as it is built. You should also show the optimal path found by A* that your ship will traverse 14868_8335 7 to >3.0 pts Some useful graphics 14868_7940 3 to >0.0 pts Buggy graphics 14868_3132 0 to >0 pts No Marks 14868_6625 This area will be used by the assessor to leave comments related to this criterion.	pts / 10 pts --
Admissible and Consistent Heuristic 14868_1704 threshold: pts Edit criterion description	8 to >6.0 pts Full Marks Designing, correctly implementing, and documenting an admissible and consistent heuristic 14868_1063 6 to >4.0 pts Minor mistake 14868_834 4 to >0.0 pts Several minor mistakes or a major mistake 14868_4061 0 to >0 pts No Marks 14868_2642 This area will be used by the assessor to leave comments related to this criterion.	pts / 8 pts --
Replanning 14868_4036 threshold: pts Edit criterion description	7 to >3.0 pts Full Marks Dynamically replanning as needed in an efficient manner. This CANNOT be replanning every time step 14868_4194 3 to >0.0 pts Replanning at target only 14868_6815 0 to >0 pts No Marks 14868_1226 This area will be used by the assessor to leave comments related to this criterion.	pts / 7 pts --
Comparison to other methods 14868_3308 CS 5013 students only: comparison to uninformed search methods: Using your solution to Project 1, you will need to collect data about your informed and uninformed search methods. Collect at least 20 examples from your ships using your chosen alternative method and another 20 from your ships using your A* implementation. An example is the full set of actions from when you choose to go to a goal and when you reach (or fail to reach) the goal. So 20 attempts to collect an asteroid or 20 attempts to hunt a ship, etc. Put a graph in your writeup comparing the two implementations in terms of how they accomplish the goal of navigation CS 4013: Do not need to do this part threshold: pts Edit criterion description	20 to >15.0 pts Full Marks Fully implemented and correct second search method from BFS, DFS, hill climbing or GBFS 14868_9826 15 to >10.0 pts Implementing the search but it is lacking documentation or has minor errors or the graph is missing in the writeup 14868_651 10 to >5.0 pts Implementing the search correctly but failing to test it and discuss it in the writeup 14868_6747 5 to >0.0 pts Major errors 14868_1566 0 to >0 pts No Marks 14868_5816 This area will be used by the assessor to leave comments related to this criterion.	pts / 20 pts --
Good coding practices 14868_1486 We will randomly choose from one of the following good coding practices to grade for these 10 points. Note that this will be included on every project. Are your files well commented? Are your variable names descriptive (or are they all i, j, and k)? Do you make good use of classes and methods or is the entire project in one big flat file? threshold: pts Edit criterion description	12 to >8.0 pts Full Marks 14868_7782 8 to >0.0 pts partially commented code, semi-descriptive variable names, or partial use of classes and methods 14868_2846 0 to >0 pts No Marks 14868_5499 This area will be used by the assessor to leave comments related to this criterion.	pts / 12 pts --
Writeup part 1: A* 14868_3540 Describe what form of A* you implemented, and how you dealt with the dynamics of the environment threshold: pts Edit criterion description	8 to >0.0 pts Full Marks 14868_612 0 to >0 pts No Marks 14868_6512 This area will be used by the assessor to leave comments related to this criterion.	pts / 8 pts --
Writeup part 2: Heuristic 14868_6600 Describe your heuristic and why it is admissible and consistent threshold: pts Edit criterion description	3 to >0.0 pts Full Marks 14868_1439 0 to >0 pts No Marks 14868_2018 This area will be used by the assessor to leave comments related to this criterion.	pts / 3 pts --
Writeup part 3: Why 14868_6083 Why did you choose the cooperative or competitive path? A sentence or two is sufficient here threshold: pts Edit criterion description	2 to >0.0 pts Full Marks 14868_5968 0 to >0 pts No Marks 14868_2545 This area will be used by the assessor to leave comments related to this criterion.	pts / 2 pts --
Description of criterion threshold: 5 pts Edit criterion description Delete criterion row	5 to >0 pts Full Marks blank 0 to >0 pts No Marks blank_2 This area will be used by the assessor to leave comments related to this criterion.	pts / 5 pts --

Rubric

Title:

Find a Rubric

Title

Title
Criteria	Ratings	Pts
Description of criterion threshold: 5 pts Edit criterion description Delete criterion row	5 to >0 pts Full Marks blank 0 to >0 pts No Marks blank_2 This area will be used by the assessor to leave comments related to this criterion.	pts / 5 pts --