2006 IEEE 14th Signal Processing and Communications Applications, Antalya, Türkiye, 17 - 19 Nisan 2006, cilt.2006
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 neigbor finding section of the method which promises to inrease the speed performance of the algorithm. © 2006 IEEE.