PATH PLANNING RESEARCH ON GRAPE PICKING ROBOTIC ARM BASED ON IMPROVED RRT ALGORITHM

The robot's operation in a grape orchard environment is often disrupted by obstacles such as vines and leaves, resulting in low fruit picking efficiency. To achieve stable obstacle avoidance, an improved RRT algorithm based on global adaptive step size and target-biased sampling was developed. First, the kinematic equations of the grape-picking robotic arm were established using the PoE method, and both forward and inverse kinematics calculations were performed to determine the robot's workspace. Then, to address the issues of lack of target orientation and other shortcomings in the traditional RRT algorithm when planning collision-free paths, dynamic updating and global adaptive step size strategies were proposed. Simulation experiments conducted using MATLAB software demonstrated that our improved RRT algorithm, compared to the RRT, RRT_informed, and RRT_star algorithms, offered advantages in terms of lower planning time, fewer sampling points, and shorter path lengths in both 2D and 3D map scenarios. Finally, grape-picking experiments were conducted in both a laboratory setting and a real orchard. The results demonstrated that the average path planning time using the proposed algorithm was shorter compared to baseline algorithms, effectively validating the efficiency and practicality of the algorithm.

Authors

Institutions

Publication Details

Journal
INMATEH Agricultural Engineering
Published
2024-12-23
DOI
https://doi.org/10.35633/inmateh-74-73
Citations
2
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PATH PLANNING RESEARCH ON GRAPE PICKING ROBOTIC ARM BASED ON IMPROVED RRT ALGORITHM

Xin’an Chen, Yifan Hu, Jianjun Qin, Yue Zhao et al.
2 citations
INMATEH Agricultural Engineering
Robotic Path Planning Algorithms
0.50
article

PATH PLANNING RESEARCH ON GRAPE PICKING ROBOTIC ARM BASED ON IMPROVED RRT ALGORITHM

Xin’an Chen, Yifan Hu, Jianjun Qin, Yue Zhao, Linsong Wang
article en
2 citations

Abstract

The robot's operation in a grape orchard environment is often disrupted by obstacles such as vines and leaves, resulting in low fruit picking efficiency. To achieve stable obstacle avoidance, an improved RRT algorithm based on global adaptive step size and target-biased sampling was developed. First, the kinematic equations of the grape-picking robotic arm were established using the PoE method, and both forward and inverse kinematics calculations were performed to determine the robot's workspace. Then, to address the issues of lack of target orientation and other shortcomings in the traditional RRT algorithm when planning collision-free paths, dynamic updating and global adaptive step size strategies were proposed. Simulation experiments conducted using MATLAB software demonstrated that our improved RRT algorithm, compared to the RRT, RRT_informed, and RRT_star algorithms, offered advantages in terms of lower planning time, fewer sampling points, and shorter path lengths in both 2D and 3D map scenarios. Finally, grape-picking experiments were conducted in both a laboratory setting and a real orchard. The results demonstrated that the average path planning time using the proposed algorithm was shorter compared to baseline algorithms, effectively validating the efficiency and practicality of the algorithm.

INMATEH Agricultural Engineering
Beijing University of Civil Engineering and Architecture (CN)
Openalex Percentile: Top 33%
Robotic Path Planning Algorithms
0.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.