A New Approach to Increase Performance of Rapidly-Exploring Random Trees (RRT) in Mobile Robotics

Significant recent advances have been achieved in the mobile robotics area partly due to technological advances in low power computational resources, new power storage technologies and biologically inspired principles in robotics. Despite these advances, primary problems of robotics are still open for contribution. One of these problems is path planning/finding for mobile robots. There are a number of different methods proposed for path planning. One of the recent alternatives is the rapidly-exploring random trees (RRT). In this study, we propose a new approach to the nearest neighbor finding section of the method which promises to increase the speed performance of the algorithm