• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利：CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法，用中文像聊天一样搜索，搜遍4000万医学文献。AI智能推荐，让科研检索更轻松。

立即免费搜索

文件翻译

保留排版，准确专业，支持PDF/Word/PPT等文件格式，支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述，25分钟生成高质量综述，智能提取关键信息，辅助科研写作。

立即免费体验

基于三角不等式的改进RRT-Connect算法用于机器人路径规划

Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning.

作者信息

Kang Jin-Gu, Lim Dong-Woo, Choi Yong-Sik, Jang Woo-Jin, Jung Jin-Woo

机构信息

Department of Computer Science and Engineering, Dongguk University, Seoul 04620, Korea.

Department of Artificial Intelligence, Dongguk University, Seoul 04620, Korea.

出版信息

Sensors (Basel). 2021 Jan 6;21(2):333. doi: 10.3390/s21020333.

DOI:10.3390/s21020333
PMID:33419005
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7825297/
Abstract

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.

摘要

本文针对快速扩展随机树（RRT）-Connect机器人路径规划算法提出了一种基于三角不等式的重布线方法，与RRT算法相比，该方法能保证规划时间，使其更接近最优解。为检验所提算法的性能，本文通过仿真在各种环境下对RRT和RRT-Connect算法进行了比较。从这些实验结果来看，所提算法在样本数量和规划时间相近的情况下，与RRT算法相比，规划时间更快，路径长度更短；与RRT-Connect算法相比，路径长度更短。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/3132fb105cad/sensors-21-00333-g021.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/6f96d50ec794/sensors-21-00333-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cf6366dc5f48/sensors-21-00333-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/7332072555f9/sensors-21-00333-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/a0d224bda5eb/sensors-21-00333-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cea7b8cad656/sensors-21-00333-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/64436846acdf/sensors-21-00333-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/64500eb94734/sensors-21-00333-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/b13962887f85/sensors-21-00333-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/532b6ef1d95b/sensors-21-00333-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/be44bbdadd0a/sensors-21-00333-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/ac9712972ed2/sensors-21-00333-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/4a28225ae54c/sensors-21-00333-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cb57d0892f63/sensors-21-00333-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/29b2807ddce2/sensors-21-00333-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/e9ed6b6d5a4a/sensors-21-00333-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/e7d6e7a49709/sensors-21-00333-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/5257ffb21823/sensors-21-00333-g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/37a91c80ff89/sensors-21-00333-g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/1d57a0ed19b4/sensors-21-00333-g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/58ef0434d130/sensors-21-00333-g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/3132fb105cad/sensors-21-00333-g021.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/6f96d50ec794/sensors-21-00333-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cf6366dc5f48/sensors-21-00333-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/7332072555f9/sensors-21-00333-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/a0d224bda5eb/sensors-21-00333-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cea7b8cad656/sensors-21-00333-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/64436846acdf/sensors-21-00333-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/64500eb94734/sensors-21-00333-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/b13962887f85/sensors-21-00333-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/532b6ef1d95b/sensors-21-00333-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/be44bbdadd0a/sensors-21-00333-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/ac9712972ed2/sensors-21-00333-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/4a28225ae54c/sensors-21-00333-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/cb57d0892f63/sensors-21-00333-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/29b2807ddce2/sensors-21-00333-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/e9ed6b6d5a4a/sensors-21-00333-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/e7d6e7a49709/sensors-21-00333-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/5257ffb21823/sensors-21-00333-g017.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/37a91c80ff89/sensors-21-00333-g018.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/1d57a0ed19b4/sensors-21-00333-g019.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/58ef0434d130/sensors-21-00333-g020.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/e7e7/7825297/3132fb105cad/sensors-21-00333-g021.jpg

相似文献

1
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning.基于三角不等式的改进RRT-Connect算法用于机器人路径规划
Sensors (Basel). 2021 Jan 6;21(2):333. doi: 10.3390/s21020333.
2
A Bidirectional Interpolation Method for Post-Processing in Sampling-Based Robot Path Planning.基于采样的机器人路径规划中后处理的双向插值方法。
Sensors (Basel). 2021 Nov 8;21(21):7425. doi: 10.3390/s21217425.
3
Application of the Improved Rapidly Exploring Random Tree Algorithm to an Insect-like Mobile Robot in a Narrow Environment.改进的快速扩展随机树算法在狭窄环境下类昆虫移动机器人中的应用
Biomimetics (Basel). 2023 Aug 17;8(4):374. doi: 10.3390/biomimetics8040374.
4
Improved RRT* Algorithm for Disinfecting Robot Path Planning.用于消毒机器人路径规划的改进型RRT*算法
Sensors (Basel). 2024 Feb 26;24(5):1520. doi: 10.3390/s24051520.
5
Implementation of a Real-Time Object Pick-and-Place System Based on a Changing Strategy for Rapidly-Exploring Random Tree.基于快速探索随机树的变策略的实时目标抓取放置系统的实现。
Sensors (Basel). 2023 May 16;23(10):4814. doi: 10.3390/s23104814.
6
Complex Environment Path Planning for Unmanned Aerial Vehicles.复杂环境下的无人机路径规划。
Sensors (Basel). 2021 Aug 3;21(15):5250. doi: 10.3390/s21155250.
7
A Sampling-Based Algorithm with the Metropolis Acceptance Criterion for Robot Motion Planning.基于采样的具有 metropolis 接受准则的机器人运动规划算法。
Sensors (Basel). 2022 Nov 26;22(23):9203. doi: 10.3390/s22239203.
8
A survey of path planning of industrial robots based on rapidly exploring random trees.基于快速扩展随机树的工业机器人路径规划研究
Front Neurorobot. 2023 Nov 3;17:1268447. doi: 10.3389/fnbot.2023.1268447. eCollection 2023.
9
Recent advances in Rapidly-exploring random tree: A review.快速扩展随机树的最新进展：综述
Heliyon. 2024 Jun 7;10(11):e32451. doi: 10.1016/j.heliyon.2024.e32451. eCollection 2024 Jun 15.
10
A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.一种基于改进RRT算法的机器人操作臂自主避障动态路径规划方法。
Sensors (Basel). 2018 Feb 13;18(2):571. doi: 10.3390/s18020571.

引用本文的文献

1
Path Planning of Quadrupedal Robot Based on Improved RRT-Connect Algorithm.基于改进RRT-Connect算法的四足机器人路径规划
Sensors (Basel). 2025 Apr 18;25(8):2558. doi: 10.3390/s25082558.
2
Adaptive Step RRT*-Based Method for Path Planning of Tea-Picking Robotic Arm.基于自适应步长RRT*的采茶机器人手臂路径规划方法
Sensors (Basel). 2024 Dec 4;24(23):7759. doi: 10.3390/s24237759.
3
Recent advances in Rapidly-exploring random tree: A review.快速扩展随机树的最新进展：综述

本文引用的文献

1
Water Sink Model for Robot Motion Planning.机器人运动规划的水槽模型。
Sensors (Basel). 2019 Mar 13;19(6):1269. doi: 10.3390/s19061269.
Heliyon. 2024 Jun 7;10(11):e32451. doi: 10.1016/j.heliyon.2024.e32451. eCollection 2024 Jun 15.
4
An Improved Harris Hawks Optimization Algorithm and Its Application in Grid Map Path Planning.一种改进的哈里斯鹰优化算法及其在网格地图路径规划中的应用
Biomimetics (Basel). 2023 Sep 15;8(5):428. doi: 10.3390/biomimetics8050428.
5
A Novel AGV Path Planning Approach for Narrow Channels Based on the Bi-RRT Algorithm with a Failure Rate Threshold.一种基于带故障率阈值的双向快速扩展随机树算法的窄通道新型AGV路径规划方法。
Sensors (Basel). 2023 Aug 30;23(17):7547. doi: 10.3390/s23177547.
6
A Path Planning Method with a Bidirectional Potential Field Probabilistic Step Size RRT for a Dual Manipulator.一种用于双机械臂的双向势场概率步长 RRT 路径规划方法。
Sensors (Basel). 2023 May 29;23(11):5172. doi: 10.3390/s23115172.
7
Improved Bidirectional RRT* Algorithm for Robot Path Planning.改进的双向 RRT*算法在机器人路径规划中的应用。
Sensors (Basel). 2023 Jan 16;23(2):1041. doi: 10.3390/s23021041.
8
A Sampling-Based Algorithm with the Metropolis Acceptance Criterion for Robot Motion Planning.基于采样的具有 metropolis 接受准则的机器人运动规划算法。
Sensors (Basel). 2022 Nov 26;22(23):9203. doi: 10.3390/s22239203.
9
Combined improved A* and greedy algorithm for path planning of multi-objective mobile robot.用于多目标移动机器人路径规划的改进A*算法与贪心算法相结合的方法
Sci Rep. 2022 Aug 2;12(1):13273. doi: 10.1038/s41598-022-17684-0.
10
A Bidirectional Interpolation Method for Post-Processing in Sampling-Based Robot Path Planning.基于采样的机器人路径规划中后处理的双向插值方法。
Sensors (Basel). 2021 Nov 8;21(21):7425. doi: 10.3390/s21217425.