EUVIMEDEUVIMED entdecken
Crossref

KBQ‐RRT*: A Smoothness‐Enhanced Kinematic Bidirectional Quick‐RRT* Via Dual‐Tree Optimization for Autonomous Navigation in Complex Orchards

Lei Ye, Jin Li, Lei Yin, Junfeng Gao, Yunchao Tang

Journal of Field Robotics · 2026-05 · 43 (3) · 1823-1843

DOI: 10.1002/rob.70131 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Field Robotics, online erschienen am 03.12.2025. Verfasst von Lei Ye und 4 weiteren Autor:innen. Die Arbeit wurde bisher 25-mal zitiert (Crossref) und nennt 28 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The autonomous navigation of mobile robots in orchards faces significant challenges due to the unstructured nature of these environments, characterized by complex obstacles and narrow feasible areas. To address these challenges, this paper presents a novel kinematic‐constraint bidirectional quick (KBQ)‐RRT* path planning algorithm specifically designed for complex orchard environments. The algorithm innovatively integrates three key improvements: (i) a lightweight smooth‐expansion cost that penalizes waypoint heading changes under kinematic constraints, (ii) an efficient branch pruning strategy during iteration, and (iii) a dual‐tree smooth optimal connection strategy that removes T/V‐shaped junctions at bidirectional merges. The KBQ‐RRT* algorithm was extensively validated through experiments conducted in four orchard environments. The ancestor search depth was set to 3, the expansion step size to 0.2 m, and the optimization range to 3 m. The results of these experiments demonstrate that the KBQ‐RRT* algorithm improves performance, particularly in terms of computational efficiency. Compared with Quick‐RRT*, KBQ‐RRT* reduces the computational time by 1.41 s in four experimental scenarios, improves the path smoothness by 16.14%, and maintains a similar path length; relative to Bi‐RRT*, it increases the computational time by 0.094 s in four scenarios at a negligible computational cost, and improves the path smoothness by 23.46% while reducing the path length by 5.04%. The algorithm's practical effectiveness is further validated through extensive mobile robot path following experiments, confirming the excellent executability of the planned paths in real‐world orchard scenarios.

Zitieren

APA

Ye, L., Li, J., Yin, L., Gao, J., & Tang, Y. (2026). KBQ‐RRT*: A Smoothness‐Enhanced Kinematic Bidirectional Quick‐RRT* Via Dual‐Tree Optimization for Autonomous Navigation in Complex Orchards. Journal of Field Robotics, 43(3), 1823-1843. https://doi.org/10.1002/rob.70131

Vancouver

Ye L, Li J, Yin L, Gao J, Tang Y. KBQ‐RRT*: A Smoothness‐Enhanced Kinematic Bidirectional Quick‐RRT* Via Dual‐Tree Optimization for Autonomous Navigation in Complex Orchards. Journal of Field Robotics. 2026;43(3):1823-1843. doi:10.1002/rob.70131

BibTeX
@article{Ye2026,
  author = {Ye, Lei and Li, Jin and Yin, Lei and Gao, Junfeng and Tang, Yunchao},
  title = {KBQ‐RRT*: A Smoothness‐Enhanced Kinematic Bidirectional Quick‐RRT* Via Dual‐Tree Optimization for Autonomous Navigation in Complex Orchards},
  journal = {Journal of Field Robotics},
  year = {2026},
  volume = {43},
  number = {3},
  pages = {1823--1843},
  doi = {10.1002/rob.70131}
}
Kostenlos starten →