Graph based RRT optimization for autonomous mobile robots

Abstract:

In this article, we present the application of Graph Theory in the development of an algorithm of path planning for mobile robots. The proposed system evaluates a RRT algorithm based on the individual cost of nodes and the optimized reconnection of the final path based on Dijkstra and Floyd criteria. Our proposal includes the comparisons between different RRT* algorithms and the simulation of the environments in different platforms. The results identify that these criteria must be considered in all the variations of RRT to achieve a definitive algorithm in mobile robotics.

Año de publicación:

2018

Keywords:

• Dijkstra Algorithm
• Floyd algorithm
• RRT*
• mobile robots
• PATH PLANNING

Fuente:

google

scopus