Benchmark Analysis of Sampling Methods for RRT Path Planning
Open Access
- 27 May 2024
- journal article
- Published by Peneliti Teknologi Teknik Indonesia in Control Systems and Optimization Letters
- Vol. 2 (2) , 217-233
Abstract
Path planning is a crucial aspect of mobile robot navigation, ensuring that robots can safely travel from their initial position to the goal. In real-world applications, path planning is essential for autonomous vehicles, drones, warehouse robots, and rescue robots to navigate complex environments efficiently and safely. One effective method for path planning is the Rapidly-exploring Random Tree (RRT) algorithm, which is particularly practical in maze-like environments. The performance of RRT depends on the sampling methods used to explore the maze. Sampling methods are important because they determine how the algorithm explores the search space, affecting the efficiency and success of finding an optimal path. Poor sampling can lead to suboptimal or infeasible paths. In this study, we investigate different sampling strategies for RRT, specifically focusing on uniform sampling, Gaussian sampling, and the Motion Planning Network (MPNet) sampling. MPNet leverages a neural network trained on past environments, allowing it to predict promising regions of the search space quickly, unlike traditional methods like RRT that rely on random exploration without prior knowledge. This makes MPNet much faster and more efficient, especially in complex or high-dimensional spaces. Through a benchmarking analysis, we compare these methods in terms of their effectiveness in generating feasible paths. The results indicate that while all three methods are effective, MPNet sampling outperforms uniform and Gaussian sampling, particularly in terms of path length. The mean path length generated, based on a sample size of 30, is 13.115 meters for MPNet, which is shorter compared to uniform and Gaussian sampling, which are 18.27 meters and 18.088 meters, respectively. These findings highlight the potential to enhance path planning algorithms using learning-based sampling methods.Keywords
This publication has 32 references indexed in Scilit:
- Adaptive Informed RRT*: Asymptotically Optimal Path Planning With Elliptical Sampling Pools in Narrow PassagesInternational Journal of Control, Automation, and Systems, 2024
- Approximate spectral decomposition of Fisher information matrix for simple ReLU networksNeural Networks, 2023
- UAV Trajectory Planning for Complex Open Storage Environments Based on an Improved RRT AlgorithmIEEE Access, 2023
- Time-Critical Maritime UAV Mission Planning Using a Neural Network: An Operational ViewIEEE Access, 2022
- Improved RRT Algorithms to Solve Path Planning of Multi-Glider in Time-Varying Ocean CurrentsIEEE Access, 2021
- Optimizing Mobility of Robotic Arms in Collision-free Motion PlanningJournal of Intelligent & Robotic Systems, 2021
- Variants of the Sliding Mode Control in Presence of External Disturbance for QuadrotorIEEE Access, 2020
- Hybrid RRT: A Semi-Dual-Tree RRT-Based Motion PlannerIEEE Access, 2020
- Systematic Literature Review of Sampling Process in Rapidly-Exploring Random TreesIEEE Access, 2019
- Path Planning of Industrial Robot Based on Improved RRT Algorithm in Complex EnvironmentsIEEE Access, 2018