To explore an unknown maze, the robot used gmapping to create the map while using a modified Dijkstra's algorithm to explore the map and the A* algorithm to find the most optimized paths. A dynamic c-space was used to stay at a safe distance from obstacles while remaining thorough to get every part of the map. A LAN cable was used here as the wifi was too slow and caused some performance issues with ROS. Once the robot has finished exploring, it navigated back to where it began.

Once the map was fully explored and saved, the robot was kidnapped to a random spot on the course, where then it was given a target location to go to. It first needed to re-localize itself which we achieved by having it spin in place while running AMCL with a particle filter.  It then use A* to plot the most efficient path to the goal while using a static c-space to avoid the obstacles.