Time-optimal and path-optimal motion planning for selective broccoli harvesting manipulator

IF 8.9 1区 农林科学 Q1 AGRICULTURE, MULTIDISCIPLINARY
Shuo Kang , Dongfang Li , Sifang Long , Yongkai Ye , Fuming Kuang , Dongdong Du , Jun Wang
{"title":"Time-optimal and path-optimal motion planning for selective broccoli harvesting manipulator","authors":"Shuo Kang ,&nbsp;Dongfang Li ,&nbsp;Sifang Long ,&nbsp;Yongkai Ye ,&nbsp;Fuming Kuang ,&nbsp;Dongdong Du ,&nbsp;Jun Wang","doi":"10.1016/j.compag.2025.111007","DOIUrl":null,"url":null,"abstract":"<div><div>Due to the asynchronous maturation characteristics of broccoli, manual harvesting in multiple batches encounters labor shortages. Consequently, there is an urgent requirement for the development of a selective broccoli harvesting robot. One of the crucial technologies in the broccoli selective harvesting robot is the motion planning algorithm, which quickly generates safe and feasible paths to avoid collisions, ensuring efficient completion of the harvesting task. However, existing motion planning algorithms struggle to balance planning speed, path quality, and success rate simultaneously. The desired motion planning algorithm for the robotic arm should enable continuous, smooth, safe, and fast movements, resembling the motion of a human arm, as it travels between the cutting and collection points, thereby enhancing the efficiency of broccoli harvesting. To address this issue, we proposed flexible edge checking and uniform sampling strategies to enhance the sampling and search processes, thereby expediting planning speed. Additionally, a Markov optimiser was incorporated to optimise path length and smoothness. Our proposed algorithm is named Time-Optimal and Path-Optimal (TOPO), which maintains and enhances the convergence properties and asymptotic optimality of Batch Informed Trees (BIT*), enabling the manipulator to exhibit smooth, efficient, and adaptive trajectories. To verify the effectiveness of our proposed algorithm, we conducted multi-dimensional collaborative simulation experiments and prototype verification experiments. The results demonstrate that compared with Rapidly-exploring Random Tree Star (RRT*), Rapidly-exploring Random Tree Connect (RRT-Connect), Fast Marching Tree Star (FMT*), Adaptively Informed Trees (AIT*), Advanced BIT*(ABIT*) and BIT* algorithms, the TOPO algorithm can reduce path planning time by 50%-73%, shorten path length by 4%-11%, minimise operating time by 9%–32%, and improve planning success rate to 97%. It can reduce the operating time of harvesting a single broccoli to within 11 s, thus enabling the selective harvesting robot to perform tasks more efficiently.</div></div>","PeriodicalId":50627,"journal":{"name":"Computers and Electronics in Agriculture","volume":"239 ","pages":"Article 111007"},"PeriodicalIF":8.9000,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers and Electronics in Agriculture","FirstCategoryId":"97","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168169925011135","RegionNum":1,"RegionCategory":"农林科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AGRICULTURE, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the asynchronous maturation characteristics of broccoli, manual harvesting in multiple batches encounters labor shortages. Consequently, there is an urgent requirement for the development of a selective broccoli harvesting robot. One of the crucial technologies in the broccoli selective harvesting robot is the motion planning algorithm, which quickly generates safe and feasible paths to avoid collisions, ensuring efficient completion of the harvesting task. However, existing motion planning algorithms struggle to balance planning speed, path quality, and success rate simultaneously. The desired motion planning algorithm for the robotic arm should enable continuous, smooth, safe, and fast movements, resembling the motion of a human arm, as it travels between the cutting and collection points, thereby enhancing the efficiency of broccoli harvesting. To address this issue, we proposed flexible edge checking and uniform sampling strategies to enhance the sampling and search processes, thereby expediting planning speed. Additionally, a Markov optimiser was incorporated to optimise path length and smoothness. Our proposed algorithm is named Time-Optimal and Path-Optimal (TOPO), which maintains and enhances the convergence properties and asymptotic optimality of Batch Informed Trees (BIT*), enabling the manipulator to exhibit smooth, efficient, and adaptive trajectories. To verify the effectiveness of our proposed algorithm, we conducted multi-dimensional collaborative simulation experiments and prototype verification experiments. The results demonstrate that compared with Rapidly-exploring Random Tree Star (RRT*), Rapidly-exploring Random Tree Connect (RRT-Connect), Fast Marching Tree Star (FMT*), Adaptively Informed Trees (AIT*), Advanced BIT*(ABIT*) and BIT* algorithms, the TOPO algorithm can reduce path planning time by 50%-73%, shorten path length by 4%-11%, minimise operating time by 9%–32%, and improve planning success rate to 97%. It can reduce the operating time of harvesting a single broccoli to within 11 s, thus enabling the selective harvesting robot to perform tasks more efficiently.
选择性西兰花收获机械手的时间最优和路径最优运动规划
由于花椰菜的非同步成熟特性,多批次人工采收存在劳动力短缺的问题。因此,迫切需要开发一种选择性西兰花收获机器人。西兰花选择性收获机器人的关键技术之一是运动规划算法,该算法能够快速生成安全可行的路径以避免碰撞,确保高效完成收获任务。然而,现有的运动规划算法难以同时平衡规划速度、路径质量和成功率。机械臂所需的运动规划算法应该能够实现连续、平稳、安全和快速的运动,类似于人类手臂的运动,当它在切割和收集点之间移动时,从而提高西兰花收获的效率。为了解决这一问题,我们提出了灵活的边缘检查和均匀采样策略,以提高采样和搜索过程,从而加快规划速度。此外,还引入了马尔可夫优化器来优化路径长度和平滑度。我们提出的算法被命名为时间最优和路径最优(TOPO),它保持并增强了Batch Informed Trees (BIT*)的收敛性和渐近最优性,使机械臂呈现出光滑、高效和自适应的轨迹。为了验证算法的有效性,我们进行了多维协同仿真实验和原型验证实验。结果表明,与快速探索随机树形星(RRT*)、快速探索随机树形连接(RRT-Connect)、快速行进树形星(FMT*)、自适应知情树(AIT*)、高级BIT*(ABIT*)和BIT*算法相比,TOPO算法可将路径规划时间缩短50% ~ 73%,将路径长度缩短4% ~ 11%,将操作时间缩短9% ~ 32%,将规划成功率提高到97%。它可以将单个西兰花收获的操作时间缩短到11秒以内,从而使选择性收获机器人更有效地执行任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers and Electronics in Agriculture
Computers and Electronics in Agriculture 工程技术-计算机:跨学科应用
CiteScore
15.30
自引率
14.50%
发文量
800
审稿时长
62 days
期刊介绍: Computers and Electronics in Agriculture provides international coverage of advancements in computer hardware, software, electronic instrumentation, and control systems applied to agricultural challenges. Encompassing agronomy, horticulture, forestry, aquaculture, and animal farming, the journal publishes original papers, reviews, and applications notes. It explores the use of computers and electronics in plant or animal agricultural production, covering topics like agricultural soils, water, pests, controlled environments, and waste. The scope extends to on-farm post-harvest operations and relevant technologies, including artificial intelligence, sensors, machine vision, robotics, networking, and simulation modeling. Its companion journal, Smart Agricultural Technology, continues the focus on smart applications in production agriculture.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信