• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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*算法在机器人路径规划中的应用。

Improved Bidirectional RRT* Algorithm for Robot Path Planning.

机构信息

Key Laboratory of Intelligent Industrial Equipment Technology of Hebei Province, School of Mechanical and Equipment Engineering, Hebei University of Engineering, Handan 056038, China.

出版信息

Sensors (Basel). 2023 Jan 16;23(2):1041. doi: 10.3390/s23021041.

DOI:10.3390/s23021041
PMID:36679837
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9862987/
Abstract

In order to address the shortcomings of the traditional bidirectional RRT* algorithm, such as its high degree of randomness, low search efficiency, and the many inflection points in the planned path, we institute improvements in the following directions. Firstly, to address the problem of the high degree of randomness in the process of random tree expansion, the expansion direction of the random tree growing at the starting point is constrained by the improved artificial potential field method; thus, the random tree grows towards the target point. Secondly, the random tree sampling point grown at the target point is biased to the random number sampling point grown at the starting point. Finally, the path planned by the improved bidirectional RRT* algorithm is optimized by extracting key points. Simulation experiments show that compared with the traditional A*, the traditional RRT, and the traditional bidirectional RRT*, the improved bidirectional RRT* algorithm has a shorter path length, higher path-planning efficiency, and fewer inflection points. The optimized path is segmented using the dynamic window method according to the key points. The path planned by the fusion algorithm in a complex environment is smoother and allows for excellent avoidance of temporary obstacles.

摘要

为了解决传统双向 RRT算法随机性高、搜索效率低以及规划路径拐点多等缺点,我们从以下几个方面进行了改进。首先,针对随机树生长过程中随机性高的问题,通过改进的人工势场法约束起始点处随机树的扩展方向,使随机树朝着目标点生长。其次,目标点生长的随机树采样点向起始点生长的随机数采样点倾斜。最后,通过提取关键点对改进的双向 RRT算法规划的路径进行优化。仿真实验表明,与传统 A*、传统 RRT 和传统双向 RRT相比,改进的双向 RRT算法具有路径长度更短、路径规划效率更高、拐点更少的优点。使用关键点对优化后的路径进行分段,使用动态窗口法对融合算法在复杂环境中规划的路径进行分段,使规划的路径更加平滑,可以很好地避开临时障碍物。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/f757225d6385/sensors-23-01041-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/0686979b9eb7/sensors-23-01041-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/06c2b5ff6388/sensors-23-01041-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/68d49dc21f71/sensors-23-01041-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/7440167219f1/sensors-23-01041-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/86f3b2081f2a/sensors-23-01041-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/bf3041dfa191/sensors-23-01041-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/b37f26b7241c/sensors-23-01041-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/048964203f10/sensors-23-01041-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/7a60e82061df/sensors-23-01041-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/e4c1ca08a115/sensors-23-01041-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/8db53e082e77/sensors-23-01041-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/8b8867bab1f3/sensors-23-01041-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/48b6065b3922/sensors-23-01041-g013a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/400d5971534d/sensors-23-01041-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/b407295a3229/sensors-23-01041-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/f757225d6385/sensors-23-01041-g016.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/0686979b9eb7/sensors-23-01041-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/06c2b5ff6388/sensors-23-01041-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/68d49dc21f71/sensors-23-01041-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/7440167219f1/sensors-23-01041-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/86f3b2081f2a/sensors-23-01041-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/bf3041dfa191/sensors-23-01041-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/b37f26b7241c/sensors-23-01041-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/048964203f10/sensors-23-01041-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/7a60e82061df/sensors-23-01041-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/e4c1ca08a115/sensors-23-01041-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/8db53e082e77/sensors-23-01041-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/8b8867bab1f3/sensors-23-01041-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/48b6065b3922/sensors-23-01041-g013a.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/400d5971534d/sensors-23-01041-g014.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/b407295a3229/sensors-23-01041-g015.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/279b/9862987/f757225d6385/sensors-23-01041-g016.jpg

相似文献

1
Improved Bidirectional RRT* Algorithm for Robot Path Planning.改进的双向 RRT*算法在机器人路径规划中的应用。
Sensors (Basel). 2023 Jan 16;23(2):1041. doi: 10.3390/s23021041.
2
Research on Autonomous Vehicle Path Planning Algorithm Based on Improved RRT* Algorithm and Artificial Potential Field Method.基于改进RRT*算法和人工势场法的自动驾驶车辆路径规划算法研究
Sensors (Basel). 2024 Jun 16;24(12):3899. doi: 10.3390/s24123899.
3
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.
4
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.
5
Intelligent Optimization Algorithm-Based Path Planning for a Mobile Robot.基于智能优化算法的移动机器人路径规划。
Comput Intell Neurosci. 2021 Sep 29;2021:8025730. doi: 10.1155/2021/8025730. eCollection 2021.
6
Improving path planning for mobile robots in complex orchard environments: the continuous bidirectional Quick-RRT* algorithm.改进复杂果园环境中移动机器人的路径规划:连续双向快速扩展随机树星算法
Front Plant Sci. 2024 May 13;15:1337638. doi: 10.3389/fpls.2024.1337638. eCollection 2024.
7
Path planning of a manipulator based on an improved P_RRT* algorithm.基于改进的P_RRT*算法的机械手路径规划
Complex Intell Systems. 2022;8(3):2227-2245. doi: 10.1007/s40747-021-00628-y. Epub 2022 Jan 21.
8
Improved RRT* Algorithm for Disinfecting Robot Path Planning.用于消毒机器人路径规划的改进型RRT*算法
Sensors (Basel). 2024 Feb 26;24(5):1520. doi: 10.3390/s24051520.
9
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.
10
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.

引用本文的文献

1
Multi-stage bidirectional informed-RRT * plant protection UAV path planning method based on A * algorithm domain guidance.基于A*算法域引导的多阶段双向知情-RRT*植保无人机路径规划方法
Front Plant Sci. 2025 Aug 22;16:1650007. doi: 10.3389/fpls.2025.1650007. eCollection 2025.
2
Dynamic Path Planning for Unmanned Autonomous Vehicles Based on CAS-UNet and Graph Neural Networks.基于CAS-UNet和图神经网络的无人驾驶车辆动态路径规划
Sensors (Basel). 2025 Jul 9;25(14):4283. doi: 10.3390/s25144283.
3
Path planning of intelligent tennis ball picking robot integrating twin network target tracking algorithm.

本文引用的文献

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.
融合双网络目标跟踪算法的智能网球拾取机器人路径规划
Sci Rep. 2025 Jul 1;15(1):20668. doi: 10.1038/s41598-025-04865-w.
4
Hybrid Clustering-Enhanced Brain Storm Optimization Algorithm for Efficient Multi-Robot Path Planning.用于高效多机器人路径规划的混合聚类增强型头脑风暴优化算法
Biomimetics (Basel). 2025 May 26;10(6):347. doi: 10.3390/biomimetics10060347.
5
An improved artificial potential field with RRT star algorithm for autonomous vehicle path planning.一种用于自动驾驶车辆路径规划的基于RRT星算法的改进人工势场法。
Sci Rep. 2025 May 15;15(1):16982. doi: 10.1038/s41598-025-00694-z.
6
Driving Assistance System with Obstacle Avoidance for Electric Wheelchairs.电动轮椅避障驾驶辅助系统。
Sensors (Basel). 2024 Jul 17;24(14):4644. doi: 10.3390/s24144644.
7
Research on Autonomous Vehicle Path Planning Algorithm Based on Improved RRT* Algorithm and Artificial Potential Field Method.基于改进RRT*算法和人工势场法的自动驾驶车辆路径规划算法研究
Sensors (Basel). 2024 Jun 16;24(12):3899. doi: 10.3390/s24123899.
8
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.