Alejandrol

• Project Name: Robot path planner using visibility graphs.
• Authors: Alejandro López and Jose María Cañas Plaza (jmplaza [at] gsyc [dot] es)

• Academic Year: 2004-2005

• Degree: Undergrad

• Jde Version: jde-4.2.1

• SVN Repository: source code

• Tags: robot, visibility graph, map.

• Technology: c, c++, jde suite, xforms

• State: Finished

• Source License: GPLv3

• Document License: Creative Commons Attribution-Share Alike 3.0 Unported License

• Documentation:

Master Thesis: PDF (latex code) 

• Presentation:

This project uses visibility graphs to find a path that allow the robot move in a path that there isn't obstacles. The Dijkstra algorithm help us to choose the shortest path on wich the robot will move between two targets.

This first picture is the interface for this schema and shows a simple map with this visibility graph generated.

In this picture you can see a path found with Dijkstra's algorithm.

• Videos:

This video is an example execution of this navigation method using visibility graph and the Dijkstra's algorithm.