Path Planning

A* Readme.

The A*, A star, algorithm is a path planning algorithm that involves searching. The basic steps to this method are as follows:

- Make a list of all of the points on the map that you are able to go on

- Make a list of all of the points on the mat that you are not able to go on

- Look at each block around you and look at the cost it will be for you to go to that block and then go to the end, assuming that there are no obstructions.

- Go on the block with the least cost.

- If you get stuck in a wall that block gets turn into a portion of the map that you are not able to go on.

- These steps will be repeated until you reach your final destination.

To test the program please extract the file ‘CS_511_Daniel_Lofaro_Astar.zip’ to it’s own directory. Then open Matlab, and make the working directory the directory you have just extracted the contents of ‘CS_511_Daniel_Lofaro_Astar.zip’. After you have done this run the file Astar_Run_Me.m. This can be done by typing the following in the Matlab command line.

>> Astar_Run_Me

Download: CS_511_Daniel_Lofaro_Astar.zip

----------------------------------------------------------------------------------------------

Wavefront Readme

To test the program please extract the file ‘CS_511_Daniel_Lofaro_Wavefront.zip’ to it’s own directory. Then open Matlab, and make the working directory the directory you have just extracted the contents of ‘CS_511_Daniel_Lofaro_Wavefront.zip’. After you have done this run the file Wavefront_Run_Me.m. This can be done by typing the following in the Matlab command line.

>> Wavefront_Run_Me

Download: CS_511_Daniel_Lofaro_Wavefront.zip