A RRT based path planning scheme for multi-DOF robots in unstructured environments

方案(数学) 运动规划 路径(计算) 机器人 计算机科学 模拟 人工智能 实时计算 工程类 数学 计算机网络 数学分析
作者
Meilin Kang,Qinhu Chen,Zeming Fan,Chuan Yu,Yixin Wang,Xiaojun Yu
出处
期刊:Computers and Electronics in Agriculture [Elsevier BV]
卷期号:218: 108707-108707 被引量:37
标识
DOI:10.1016/j.compag.2024.108707
摘要

Path planning for robots in complex orchard environments is crucial to ensure efficient and safe completion of harvesting tasks. The use of flexible multi-degree-of-freedom (multi-DOF) robots further adds to the complexity of the task. Therefore, based on a rapidly exploring random tree (RRT) algorithm, a bidirectional path planning method adjusting the expansion direction and dynamic step (EDDS-bi-RRT) according to the scene information is proposed to improve the planning efficiency of multi-DOF robots in the configuration space (C-space). Two improvements are introduced to the algorithm: (1) The algorithm begins by designating the search's starting point as the tree's root node. Subsequently, it generates an extended tree by continuously adding leaf nodes through sampling. The expansion direction is set from the nearest node to the target point, and the cosine and sine factors are introduced to adjust the direction when the sampling point collides with obstacles, and the extended trees will be exchanged for growth from the target point to the nearest node accordingly. (2) The minimum distance between the robot links and obstacles is the maximum safe distance d with which the robot links can move in the workspace. Then, d is converted to the expansion step in the high-dimensional C-space by introducing the matrix operator norm. This way, the explore efficiency is improved significantly in complex environments while the computational time and the path length decrease. Simulations in different scenarios are performed based on a 17-DOF humanoid dual-arm apple harvesting robot developed in our lab, and the results show that the proposed algorithm presents a higher efficiency and shorter planning time and path length compared with previous similar algorithms. In addition, experiments in the lab orchard environments are also performed to indicate that the EDDS-bi-RRT algorithm can be applied to generate collision-free path points for multi-DOF robots in unstructured environments safely and effectively.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
鳗鱼短靴发布了新的文献求助30
1秒前
核桃发布了新的文献求助20
1秒前
木子完成签到,获得积分10
1秒前
姜姜发布了新的文献求助10
1秒前
1秒前
kyJYbs完成签到,获得积分10
2秒前
2秒前
2秒前
美好乐儿发布了新的文献求助10
3秒前
王璐完成签到,获得积分10
3秒前
蘑菇完成签到,获得积分10
3秒前
科研通AI6.2应助123采纳,获得10
3秒前
Owen应助Xbr采纳,获得10
4秒前
JamesPei应助初景采纳,获得10
4秒前
4秒前
5秒前
5秒前
5秒前
暴躁的冰兰完成签到 ,获得积分10
6秒前
tom完成签到,获得积分10
6秒前
小马甲应助xttt采纳,获得10
6秒前
6秒前
wanci应助寒枫采纳,获得10
6秒前
ding应助简单海露采纳,获得10
6秒前
耍酷寄柔发布了新的文献求助10
7秒前
7秒前
7秒前
9秒前
烟酒生发布了新的文献求助10
10秒前
King完成签到,获得积分20
10秒前
Xujiamei关注了科研通微信公众号
10秒前
机灵嘉懿完成签到 ,获得积分10
10秒前
调皮老头发布了新的文献求助10
11秒前
lars完成签到 ,获得积分10
11秒前
11秒前
雨竹完成签到 ,获得积分10
11秒前
科研通AI6.2应助仔仔采纳,获得10
11秒前
11秒前
Potato完成签到 ,获得积分10
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
HYDROLYSE ACIDE DE QUELQUES DIOXASPIROCYCLANES 1314
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Navigating Normative Orders. Interdisciplinary Perspectives 800
1 Peter and Christ's Descent to the Dead in Its Early Christian Reception 700
Organizational Behavior 510
Management and the Arts 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7745925
求助须知:如何正确求助?哪些是违规求助? 9293769
关于积分的说明 20222118
捐赠科研通 7325542
什么是DOI,文献DOI怎么找? 3307982
关于科研通互助平台的介绍 2459950
邀请新用户注册赠送积分活动 2319405