Rapidly exploring random trees

Results show that the proposed algorithm yields superior results as compared to the commonly used algorithm in terms of computational speed, form of path and robustness of searching ability, which potentially make it suitable for the real-time intraoperative planning in clinical operations.

8p praishy2 27-02-2019 13 1   Download

This paper is devoted to the design of improved path finding algorithm that will find the near optimal path in a short time. The improved iterative RRT with path smoothing algorithm is developed and implemented in RoboCup Small Size robots. Through simulation it was shown that this algorithm can efficiently find desirable and near optimal solutions in short time.

5p praishy2 27-02-2019 14 1   Download