Course: ENPM661 - Planning for Autonomous Robots
Python Libraries used - numpy, pygame, heapq, time
-
Run the single python file given
-
Input valid x,y coordinates of start and goal node -> Consider inputting in terms of index
-
Dijkstra algorithm is implemented and a pygame window will open up showing the nodes explored and optimal path
Clearance of 5 is given, however, input of 5 is considered since, pygame considers 0 to 4 as 5 units