Multi objective motion planning of fruit harvesting manipulator based on improved BIT* algorithm

IF 7.7 1区 农林科学 Q1 AGRICULTURE, MULTIDISCIPLINARY
Peifeng Ma , Aibin Zhu , Yihao Chen , Yao Tu , Han Mao , Jiyuan Song , Xin Wang , Sheng Su , Dangchao Li , Xia Dong
{"title":"Multi objective motion planning of fruit harvesting manipulator based on improved BIT* algorithm","authors":"Peifeng Ma ,&nbsp;Aibin Zhu ,&nbsp;Yihao Chen ,&nbsp;Yao Tu ,&nbsp;Han Mao ,&nbsp;Jiyuan Song ,&nbsp;Xin Wang ,&nbsp;Sheng Su ,&nbsp;Dangchao Li ,&nbsp;Xia Dong","doi":"10.1016/j.compag.2024.109567","DOIUrl":null,"url":null,"abstract":"<div><div>The primary challenge for fruit-harvesting robots in unstructured orchard environments lies in achieving fast and accurate fruit picking while avoiding obstacles like branches. This paper introduces a rapid and efficient multi-objective motion planning method based on the improved BIT* algorithm. Two depth cameras are employed to acquire the locations of both targets and obstacles, and an obstacle map of the harvesting environment is generated using the octree method. For collision detection, a combination of bounding box and grid-based techniques is applied. The proposed bidirectional BIT* (Bi-BIT*) algorithm builds forward and backward trees simultaneously during initialization, alternating searches to reduce the time required for the initial solution. The manipulator’s joint paths are interpolated using a quintic polynomial, and a multi-objective optimization problem is solved to achieve a smooth joint motion trajectory while minimizing energy consumption and pulsation. Both two-dimensional and three-dimensional simulations demonstrate that the Bi-BIT* algorithm consistently outperforms three other algorithms, achieving the highest overall scores. In the harvesting experiment of Scenario 1, the Bi-BIT* algorithm had an average execution time of 7.32 s—36.4% faster than the Informed RRT* algorithm, 19.0% faster than the RRT-Connect algorithm, and 28.7% faster than the BIT* algorithm. Additionally, the Bi-BIT* algorithm achieved a 96% planning success rate and an 84% execution success rate, surpassing the other three algorithms. In Experiment Scenario 2, the Bi-BIT* algorithm had an average execution time of 8.59 s, which is 41.0% faster than the Informed RRT* algorithm, 6.3% faster than the RRT-Connect algorithm, and 19.5% faster than the BIT* algorithm. Furthermore, the Bi-BIT* algorithm demonstrated superior planning and execution success rates of 92% and 88%, respectively, compared to the other algorithms. These experimental results confirm that the proposed multi-objective motion planning method enables the harvesting manipulator to avoid obstacles efficiently and accurately, completing the harvesting task with high performance.</div></div>","PeriodicalId":50627,"journal":{"name":"Computers and Electronics in Agriculture","volume":"227 ","pages":"Article 109567"},"PeriodicalIF":7.7000,"publicationDate":"2024-11-12","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/S016816992400958X","RegionNum":1,"RegionCategory":"农林科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AGRICULTURE, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The primary challenge for fruit-harvesting robots in unstructured orchard environments lies in achieving fast and accurate fruit picking while avoiding obstacles like branches. This paper introduces a rapid and efficient multi-objective motion planning method based on the improved BIT* algorithm. Two depth cameras are employed to acquire the locations of both targets and obstacles, and an obstacle map of the harvesting environment is generated using the octree method. For collision detection, a combination of bounding box and grid-based techniques is applied. The proposed bidirectional BIT* (Bi-BIT*) algorithm builds forward and backward trees simultaneously during initialization, alternating searches to reduce the time required for the initial solution. The manipulator’s joint paths are interpolated using a quintic polynomial, and a multi-objective optimization problem is solved to achieve a smooth joint motion trajectory while minimizing energy consumption and pulsation. Both two-dimensional and three-dimensional simulations demonstrate that the Bi-BIT* algorithm consistently outperforms three other algorithms, achieving the highest overall scores. In the harvesting experiment of Scenario 1, the Bi-BIT* algorithm had an average execution time of 7.32 s—36.4% faster than the Informed RRT* algorithm, 19.0% faster than the RRT-Connect algorithm, and 28.7% faster than the BIT* algorithm. Additionally, the Bi-BIT* algorithm achieved a 96% planning success rate and an 84% execution success rate, surpassing the other three algorithms. In Experiment Scenario 2, the Bi-BIT* algorithm had an average execution time of 8.59 s, which is 41.0% faster than the Informed RRT* algorithm, 6.3% faster than the RRT-Connect algorithm, and 19.5% faster than the BIT* algorithm. Furthermore, the Bi-BIT* algorithm demonstrated superior planning and execution success rates of 92% and 88%, respectively, compared to the other algorithms. These experimental results confirm that the proposed multi-objective motion planning method enables the harvesting manipulator to avoid obstacles efficiently and accurately, completing the harvesting task with high performance.
基于改进型 BIT* 算法的水果采摘机械手多目标运动规划
在非结构化果园环境中,水果采摘机器人面临的主要挑战是在避开树枝等障碍物的同时实现快速、准确的水果采摘。本文基于改进的 BIT* 算法,介绍了一种快速高效的多目标运动规划方法。采用两个深度摄像头获取目标和障碍物的位置,并使用八叉树方法生成采摘环境的障碍物地图。在碰撞检测方面,采用了边界框和基于网格的组合技术。所提出的双向 BIT* (Bi-BIT*) 算法在初始化过程中同时建立前向树和后向树,交替搜索以减少初始解所需的时间。使用五次多项式对机械手的关节路径进行插值,并解决多目标优化问题,以实现平滑的关节运动轨迹,同时最大限度地减少能耗和脉动。二维和三维模拟结果表明,Bi-BIT* 算法始终优于其他三种算法,总分最高。在场景 1 的收割实验中,Bi-BIT* 算法的平均执行时间为 7.32 秒,比 Informed RRT* 算法快 36.4%,比 RRT-Connect 算法快 19.0%,比 BIT* 算法快 28.7%。此外,Bi-BIT* 算法的规划成功率达到 96%,执行成功率达到 84%,超过了其他三种算法。在实验方案 2 中,Bi-BIT* 算法的平均执行时间为 8.59 秒,比 Informed RRT* 算法快 41.0%,比 RRT-Connect 算法快 6.3%,比 BIT* 算法快 19.5%。此外,与其他算法相比,Bi-BIT* 算法的规划和执行成功率更高,分别达到 92% 和 88%。这些实验结果证实,所提出的多目标运动规划方法能使收割机械手高效、准确地避开障碍物,高性能地完成收割任务。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信