.png){kind=icon}
Return
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
.png){kind=icon}
OA
AI
DOI：10.3390/s21020333.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposed a triangular inequality-based rewiring method for the rapidly exploring random tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm's performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.
Keywords:
RRT-Connect
triangular inequality
rewiring
optimality
robot path planning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.2W
Citations:
20.9W
Organization
Cited Papers
Analysis of plate and colony precipitates decorating stacking faults in a single-crystal silicon
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSave
View more