Pathfinding Algorithm - Cost Search - IT Assignment Help

Assignment Task:

Your tasks 

Solve pathfinding using Breadth-First Search (BFS), Uniform-Cost Search (UCS) and A* Search. You should base your program on the pseudocode GRAPH-SEARCH in the lecture slides and carefully think about the appropriate data structures to use. For A* Search, you must implement two heuristics: 

• Euclidean distance between the current position and end position. 

• Manhattan distance between the current position and end position. 

For the map in Page 1 with start position (1,1) and end position (10,10), your program should help you answer these questions: 

1. Are the paths returned by the three methods different? 

2. What about the optimality of the returned paths? 

3. Which method is the most computationally and memory efficient? 

4. Do the two heuristics for A* Search provide different solutions? 

5. Does checking for repeated states matter in this problem?

Deliverables 

Write your pathfinding program in C/C++, Java or Python. 

In the case of C/C++, you must supply a makefile (named exactly as ‘Makefile’) with a rule called pathfinder to compile your program into a Linux executable binary named pathfinder.bin. Your program must be able to be compiled and run as follows: 

$ make pathfinder

$ ./pathfinder.bin [map] [algorithm] [heuristic] 

In the case of Java, write your program in the file pathfinder.java. Your program must be able to be compiled and run as follows: 

$ javac pathfinder.java $ java pathfinder [map] [algorithm] [heuristic] 

In the case of Python, write your program in the file pathfinder.py. Your program must be able to be run as follows: 

$ python pathfinder.py [map] [algorithm] [heuristic] 

This IT Assignment has been solved by our IT Experts at My Uni Papers. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our experts are well trained to follow all marking rubrics & referencing style.

Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.