RRT-Connect is a bidirectional variant of the Rapidly Exploring Random Tree algorithm that accelerates path convergence by simultaneously growing two trees from the initial and goal configurations and connecting them through a steering step upon node proximity.
31
Publications
1.5K
Citations
114
Authors
47
Institutions
Publications per year
2017–2026
22
Publications
31
RRT*-Connect: Faster, asymptotically optimal motion planning
Sebastian Klemm, Jan Oberlander, A. M. Hermann et al. · 2015 · 201 citations
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
Jin-Gu Kang, Dong‐Woo Lim, Yong-Sik Choi et al. · Sensors · 2021 · 120 citations · Full text
Bidirectional Potential Guided RRT* for Motion Planning
Li Xiaojuan, Jiadong Song, Rui Wang · IEEE Access · 2019 · 96 citations · Full text
1–5 of 31
Authors
114
- DB
3
h-index
- JK
2
h-index
- JJ
2
h-index
- JY
1
h-index
- PD
1
h-index
1–5 of 114
Institutions
47
Poznań University of Technology
Poznan, Poland
3 h-index
7 publications
200 citations
Dongguk University
Seoul, South Korea
2 h-index
8 publications
651 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
5 publications
169 citations
Fuzhou University
Fuzhou, China
1 h-index
5 publications
105 citations
FZI Research Center for Information Technology
Karlsruhe, Germany
1 h-index
6 publications
1.2K citations
Aerospace Technology Institute
Cranfield, United Kingdom
1 h-index
3 publications
141 citations
University of Ferrara
Ferrara, Italy
1 h-index
2 publications
34 citations
University of California, Santa Barbara
Santa Barbara, United States
1 h-index
2 publications
46 citations
1–8 of 47
Venues
- IEEE Access
6 publications · 402 citations
5
h-index
- Sensors
2 publications · 137 citations
2
h-index
- Biomimetics
1 publications · 24 citations
1
h-index
- IEEE/CAA Journal of Automatica Sinica
1 publications · 135 citations
1
h-index
- Journal of Intelligent & Robotic Systems
1 publications · 48 citations
1
h-index
1–5