.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
RRT-Connect
triangular inequality
rewiring
optimality
robot path planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Analysis of plate and colony precipitates decorating stacking faults in a single-crystal silicon
PREAI
分享收藏Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm基于改进遗传算法的连续环境多目标多机器人路径规划
PREAI
分享收藏OECD Series on Principles of Good Laboratory Practice and Compliance Monitoring经合组织关于良好实验室规范和合规监测原则的系列.png)
OAAI
IF0
OAAI分享收藏A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles自动驾驶城市车辆运动规划与控制技术综述OAAI
OAAI分享收藏
查看更多内容