Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms

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.

Süresiz Ambargo
Görüntülenme
41
17.03.2022 tarihinden bu yana
İndirme
2
17.03.2022 tarihinden bu yana
Son Erişim Tarihi
18 Mayıs 2024 16:47
Google Kontrol
Tıklayınız
Tam Metin
Süresiz Ambargo
Detaylı Görünüm
Eser Adı
(dc.title)
Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms
Yazar
(dc.contributor.author)
Mohammed Ahmed Shah
Yayın Yılı
(dc.date.issued)
2021
Tür
(dc.type)
Makale
Özet
(dc.description.abstract)
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.
Açık Erişim Tarihi
(dc.date.available)
2021-03-14
Yayıncı
(dc.publisher)
Sprınger London Ltd
Dil
(dc.language.iso)
En
Konu Başlıkları
(dc.subject)
Optimal path planning
Konu Başlıkları
(dc.subject)
Unmanned aerial vehicle
Konu Başlıkları
(dc.subject)
Autonomous mobile robot
Konu Başlıkları
(dc.subject)
Autonomous mobile robot
Konu Başlıkları
(dc.subject)
Metaheuristic algorithm
Tek Biçim Adres
(dc.identifier.uri)
https://hdl.handle.net/20.500.14081/1328
ISSN
(dc.identifier.issn)
0941-0643
Dergi
(dc.relation.journal)
Neural Computing & Applications
Dergi Sayısı
(dc.identifier.issue)
22
Esere Katkı Sağlayan
(dc.contributor.other)
Shah, M. Ahmed
Esere Katkı Sağlayan
(dc.contributor.other)
Basyildiz, Hasan
Esere Katkı Sağlayan
(dc.contributor.other)
Kiani, Farzad
Esere Katkı Sağlayan
(dc.contributor.other)
Gulle, Murat Ugur
Esere Katkı Sağlayan
(dc.contributor.other)
Aliyev, Royal
Esere Katkı Sağlayan
(dc.contributor.other)
Seyyedabbasi, Amir
DOI
(dc.identifier.doi)
10.1007/s00521-021-06179-0
Bitiş Sayfası
(dc.identifier.endpage)
15599
Başlangıç Sayfası
(dc.identifier.startpage)
15569
Dergi Cilt
(dc.identifier.volume)
33
wosquality
(dc.identifier.wosquality)
Q2
wosauthorid
(dc.contributor.wosauthorid)
GCK-6878-2022
Department
(dc.contributor.department)
Bilgisayar Mühendisliği
Wos No
(dc.identifier.wos)
WOS:000659898800002
Veritabanları
(dc.source.platform)
Wos
Veritabanları
(dc.source.platform)
Scopus
Analizler
Yayın Görüntülenme
Yayın Görüntülenme
Erişilen ülkeler
Erişilen şehirler
6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.
Tamam

creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms