EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

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

Heru Suwoyo, Ahmad 'Athif Mohd Faudzi, Andi Adriansyah, Yudhi Gunardi, Julpri Andika, Yinzhong Tian

Bulletin of Electrical Engineering and Informatics · 01.06.2026 · 15 (3) · 2089-2103

DOI: 10.11591/eei.v15i3.11859 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of Electrical Engineering and Informatics, online erschienen am 01.06.2026. Verfasst von Heru Suwoyo und 5 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Suwoyo, H., Faudzi, A. A. M., Adriansyah, A., Gunardi, Y., Andika, J., & Tian, Y. (2026). Adaptive bidirectional heuristic rapidly exploring random tree* for efficient path planning. Bulletin of Electrical Engineering and Informatics, 15(3), 2089-2103. https://doi.org/10.11591/eei.v15i3.11859

Vancouver

Suwoyo H, Faudzi AAM, Adriansyah A, Gunardi Y, Andika J, Tian Y. Adaptive bidirectional heuristic rapidly exploring random tree* for efficient path planning. Bulletin of Electrical Engineering and Informatics. 2026;15(3):2089-2103. doi:10.11591/eei.v15i3.11859

BibTeX
@article{Suwoyo2026,
  author = {Suwoyo, Heru and Faudzi, Ahmad 'Athif Mohd and Adriansyah, Andi and Gunardi, Yudhi and Andika, Julpri and Tian, Yinzhong},
  title = {Adaptive bidirectional heuristic rapidly exploring random tree* for efficient path planning},
  journal = {Bulletin of Electrical Engineering and Informatics},
  year = {2026},
  volume = {15},
  number = {3},
  pages = {2089--2103},
  doi = {10.11591/eei.v15i3.11859}
}
Kostenlos starten →