Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Adaptive bidirectional heuristic rapidly exploring random tree* for efficient path planning

Bulletin of Electrical Engineering and Informatics · Vol. 15 No. 3 (2026) · hlm. 2089–2103

DOI
10.11591/eei.v15i3.11859
ISSN
2089-3191, 2302-9285
Terbit
2026-06-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Sampling-based path planning algorithms such as rapidly exploring random tree* (RRT*) are widely used for autonomous navigation in complex environments. However, many RRT variants suffer from slow initial exploration, suboptimal convergence, and search inefficiency in dense spaces. Based on this, adaptive bidirectional heuristic-RRT* (ABH-RRT*) is proposed. It is a novel method introduced as a unified path planner. ABHRRT* integrates bidirectional tree growth, heuristic-based parent selection, fast-informed hybrid sampling, and adaptive reordering to improve exploration efficiency and path optimality. The algorithm speeds up the initial path recovery caused by the presence of dual tree expansion and fast sampling. In addition, the algorithm also refines the solution using informed sampling and adaptive reordering to improve convergence toward near-optimal paths. The performance of ABH-RRT* is evaluated in four environments with different complexity levels and compared with RRT, RRT*, Fast-RRT*, Smart-RRT*, and Informed-RRT*. Experimental results show that ABH-RRT* consistently produces shorter paths and faster convergence, reduces path cost by 2–24% and increases convergence speed by 40–58% in dense and constrained environments. These results show that ABH-RRT* is a better and adaptive solution for path planning in complex scenarios.

Kata kunci

Jaringan kolaborasi para penulis

40 penulis · 114 tautan kepenulisan bersama · 52 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Mercu Buana University
  • University of Technology Malaysia
  • Universiti Teknikal Malaysia Melaka
  • Tun Hussein Onn University of Malaysia
  • Bandung Institute of Technology
  • Shanghai University
  • Indonesia University of Education
  • Organisasi lain
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Muhammad Hafizd Ibnu HajarMercu Buana University7
Abu Ubaidah ShamsudinTun Hussein Onn University of Malaysia5
Fina SupeginaMercu Buana University5
Achmad BurhanudinMercu Buana University5
Khairuddin OsmanUniversiti Teknikal Malaysia Melaka4
Mohd Fua’ad RahmatUniversity of Technology Malaysia3
Sy Najib Sy SalimUniversiti Teknikal Malaysia Melaka2
Abdulrahman A.A. EmhemedUniversity of Technology Malaysia2
Rosbi MamatUniversity of Technology Malaysia2
Mohd Ridzuan JoharyUniversity of Technology Malaysia2
Sharatul Izah SamsudinUniversiti Teknikal Malaysia Melaka2
Dirman HanafiTun Hussein Onn University of Malaysia2
Dafit FeriyantoMercu Buana University2
Hadi PranotoMercu Buana University2
Abdi WahabMercu Buana University2
January Dwidasa WiniyogaMercu Buana University2
Shamsudin H. M. AminUniversity of Technology Malaysia1
Zool Hilmi IsmailUniversity of Technology Malaysia1
Noorhazirah SunarUniversity of Technology Malaysia1
Shamsul Anuar SamsudinUniversiti Teknikal Malaysia Melaka1
Siti Fatimaah SulaimanAfiliasi tidak diketahui1
A. R. AziraUniversiti Teknikal Malaysia Melaka1
Amar Faiz Zainal AbidinUniversiti Teknikal Malaysia Melaka1
Siti Fatimah SulaimanUniversiti Teknikal Malaysia Melaka1
Noor Asyikin SulaimanUniversiti Teknikal Malaysia Melaka1
Muchamad Rizky NugrahaAfiliasi tidak diketahui1
Arif BasukiMercu Buana University1
Jaja KustijaIndonesia University of Education1
Diki FahrizalBandung Institute of Technology1
Muhamad NasirNational Research and Innovation Agency1
Muhammad Husni MuttaqinBandung Institute of Technology1
Kamal Khairi KamaruddinTun Hussein Onn University of Malaysia1
Hisyam Bin Abdul RahmanTun Hussein Onn University of Malaysia1
Mirzanu Rizki GMAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Adaptive bidirectional heuristic rapidly exploring random tree* for efficient path planning</dc:title><dc:creator>Heru Suwoyo</dc:creator><dc:creator>Ahmad Athif Mohd Faudzi</dc:creator><dc:creator>Andi Adriansyah</dc:creator><dc:creator>Yudhi Gunardi</dc:creator><dc:creator>Julpri Andika</dc:creator><dc:creator>Yingzhong Tian</dc:creator><dc:subject>rapidly-exploring random tree</dc:subject><dc:subject>adaptive heuristics</dc:subject><dc:subject>informed sampling</dc:subject><dc:subject>parent selection</dc:subject><dc:subject>sampling-based path planning</dc:subject><dc:subject>autonomous navigation</dc:subject><dc:subject>path optimization</dc:subject><dc:subject>convergence rate</dc:subject><dc:description xml:lang="en">Sampling-based path planning algorithms such as rapidly exploring random tree* (RRT*) are widely used for autonomous navigation in complex environments. However, many RRT variants suffer from slow initial exploration, suboptimal convergence, and search inefficiency in dense spaces. Based on this, adaptive bidirectional heuristic-RRT* (ABH-RRT*) is proposed. It is a novel method introduced as a unified path planner. ABHRRT* integrates bidirectional tree growth, heuristic-based parent selection, fast-informed hybrid sampling, and adaptive reordering to improve exploration efficiency and path optimality. The algorithm speeds up the initial path recovery caused by the presence of dual tree expansion and fast sampling. In addition, the algorithm also refines the solution using informed sampling and adaptive reordering to improve convergence toward near-optimal paths. The performance of ABH-RRT* is evaluated in four environments with different complexity levels and compared with RRT, RRT*, Fast-RRT*, Smart-RRT*, and Informed-RRT*. Experimental results show that ABH-RRT* consistently produces shorter paths and faster convergence, reduces path cost by 2–24% and increases convergence speed by 40–58% in dense and constrained environments. These results show that ABH-RRT* is a better and adaptive solution for path planning in complex scenarios.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2026-06-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v15i3.11859</dc:identifier><dc:identifier>10.11591/eei.v15i3.11859</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 15 No 3 (2026); 2089-2103</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/11859/4760</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>