Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms
Gulle, Murat Ugur
Shah, Mohammad Ahmed
MetadataShow full item record
CitationKiani, F., Seyyedabbasi, A., Aliyev, R., Gulle, M. U., Basyildiz, H., & Shah, M. A. (2021). Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms. Neural Computing and Applications, 1-31.
Three-dimensional path planning for autonomous robots is a prevalent problem in mobile robotics. This paper presents three novel versions of a hybrid method designed to assist in planning such paths for these robots. In this paper, an improvement on Rapidly exploring Random Tree (RRT) algorithm, namely Adapted-RRT, is presented that uses three well-known metaheuristic algorithms, namely Grey Wolf Optimization (GWO), Incremental Grey Wolf Optimization (I-GWO), and Expanded Grey Wolf Optimization (Ex-GWO)). RRT variants, using these algorithms, are named Adapted-RRTGWO, Adapted-RRTI-GWO, and Adapted-RRTEx-GWO. The most significant shortcoming of the methods in the original sampling-based algorithm is their inability in finding the optimal paths. On the other hand, the metaheuristic-based algorithms are disadvantaged as they demand a predetermined knowledge of intermediate stations. This study is novel in that it uses the advantages of sampling and metaheuristic methods while eliminating their shortcomings. In these methods, two important operations (length and direction of each movement) are defined that play an important role in selecting the next stations and generating an optimal path. They try to find solutions close to the optima without collision, while providing comparatively efficient execution time and space complexities. The proposed methods have been simulated employing four different maps for three unmanned aerial vehicles, with diverse sets of starting and ending points. The results have been compared among a total of 11 algorithms. The comparison of results shows that the proposed path planning methods generally outperform various algorithms, namely BPIB-RRT*, tGSRT, GWO, I-GWO, Ex-GWO, PSO, Improved BA, and WOA. The simulation results are analysed in terms of optimal path costs, execution time, and convergence rate.