-
Notifications
You must be signed in to change notification settings - Fork 0
ni9elf/RobotNavigationSystem
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
/* Authors: Rishabh Manoj, Anirudh Ravi, Penmetsa Murali Krishnam Raju, Samyak Upadhyay, Tadigadapa Abhiram and Nigel Steven Fernandez Email IDs: Rishabh.Manoj@iiitb.org, Anirudh.Ravi@iiitb.org, raju.pmk@iiitb.org, Samyak.Upadhyay@iiitb.org, Abhiram.Tadigadapa@iiitb.org and NigelSteven.Fernandez@iiitb.org Revision Number: 1 Date Modified: 22-12-2013 */ 1. Move into the directory named the_road_not_taken 2. To build the_road_not_taken executable, run the command: make 3. To run the_road_not_taken executable, run the command: ./the_road_not_taken Sample input to run the_road_not_taken executable with: initial point : 50 225 final point : 320 430 obstacle point : 112 50 obstacle point : 160 122 obstacle point : 225 225 obstacle point : 320 240 obstacle point : 360 60 obstacle point : 90 395 obstacle point : 145 310 obstacle point : 310 320 obstacle point : 345 410 5. To uninstall the_road_not_taken executable, run the command: make clean 6. To exit the program, either perform a CONTROL + C or close the GUI.
About
The safest, shortest path between two points in an obstacle plane is computed using Voronoi diagrams and Dijkstra’s algorithm for robot navigation.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published