EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Adaptive RRT* Algorithm for Narrow Passage Path Planning

Xingmin Wang, Hongyu Wang, Qian Li, Yang Wu, Zhumadil Baigunchekov

IEEE Access · 2026 · 14 · 62871-62882

DOI: 10.1109/access.2026.3681865 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Xingmin Wang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Key Research and Development Project of Shandong Province, Natural Science Foundation of Shandong Province, Major Innovation Project of Qilu University of Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In recent years, the rapidly exploring random tree star (RRT*) algorithm has continued to attract significant research attention in the field of path planning due to its simple implementation and asymptotic optimality. However, RRT* still suffers from limitations such as slow convergence speed and insufficient adaptability to complex environments. Its efficiency significantly decreases when navigating environments containing narrow passages. To address these limitations, this paper proposes an adaptive RRT* algorithm (A-RRT*) that achieves faster convergence and superior environmental adaptability than the standard RRT*. Firstly, we introduce the expansion superposition method to accurately detect narrow passages, enhancing the algorithm’s ability to handle them. This method facilitates swift traversal through the strategic placement of subtree root nodes within these identified regions. Furthermore, these subtrees are dynamically activated or deactivated based on spatial distance, effectively mitigating the computational explosion associated with maintaining multiple trees. After obtaining an initial solution, we design a circular sampling region and a specific node connection strategy to improve sampling efficiency and reduce the computational complexity of achieving path optimality. Comparative simulation experiments against the standard RRT* demonstrate the superiority of the proposed algorithm in terms of convergence speed, environmental adaptability, and computational efficiency.

Förderung

  • Key Research and Development Project of Shandong Province
  • Natural Science Foundation of Shandong Province
  • Major Innovation Project of Qilu University of Technology

Zitieren

APA

Wang, X., Wang, H., Li, Q., Wu, Y., & Baigunchekov, Z. (2026). An Adaptive RRT* Algorithm for Narrow Passage Path Planning. IEEE Access, 14, 62871-62882. https://doi.org/10.1109/access.2026.3681865

Vancouver

Wang X, Wang H, Li Q, Wu Y, Baigunchekov Z. An Adaptive RRT* Algorithm for Narrow Passage Path Planning. IEEE Access. 2026;14:62871-62882. doi:10.1109/access.2026.3681865

BibTeX
@article{Wang2026,
  author = {Wang, Xingmin and Wang, Hongyu and Li, Qian and Wu, Yang and Baigunchekov, Zhumadil},
  title = {An Adaptive RRT* Algorithm for Narrow Passage Path Planning},
  journal = {IEEE Access},
  year = {2026},
  volume = {14},
  pages = {62871--62882},
  doi = {10.1109/access.2026.3681865}
}
Kostenlos starten →