Your objective for the final project is to develop a set of MATLAB codes to experiment with pathfinding on a fully-customizable 2-D grid using the A* algorithm. Although there are only a few simple calculations being carried out at each step, this algorithm is able to reliably find the best route for everything from simple grids to the most complicated labyrinths.
Every node in your grid should have at least the following properties:
ID Number 1, 2, 3, . . . , numNodes
Position A 1x2 vector, [x, y]
Connected Neighbors A vector containing the ID’s of all connected nodes
g The actual distance traveled from the starting point to reach this node
h The straight-line distance separating this node and the goal node
f The total estimated cost, f = g + w*h, where w is a weight constant
State +1 = Open, 0 = Neither, -1 = Closed
Parent ID of node visited immediately prior to this node
A significant portion of your project grade rests in how you present your results, so spend some time making things look nice! At a minimum, your visualization must: (a) show the location of each node, (b) clearly denote both the starting and goal nodes, and (c) clearly represent the path found by your algorithm.
I have a lot interest of your project because I know about A*. I have a lot of experience with algorithm. So I think I can complete the project well. Please contact me to discuss your project. Thank you.