Peifeng Ma , Aibin Zhu , Yihao Chen , Yao Tu , Han Mao , Jiyuan Song , Xin Wang , Sheng Su , Dangchao Li , Xia Dong
{"title":"基于改进型 BIT* 算法的水果采摘机械手多目标运动规划","authors":"Peifeng Ma , Aibin Zhu , Yihao Chen , Yao Tu , Han Mao , Jiyuan Song , Xin Wang , Sheng Su , Dangchao Li , 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":"{\"title\":\"Multi objective motion planning of fruit harvesting manipulator based on improved BIT* algorithm\",\"authors\":\"Peifeng Ma , Aibin Zhu , Yihao Chen , Yao Tu , Han Mao , Jiyuan Song , Xin Wang , Sheng Su , Dangchao Li , 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}","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}
Multi objective motion planning of fruit harvesting manipulator based on improved BIT* algorithm
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.
期刊介绍:
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.