Obstacle Avoidance Trajectory Planning for Truss-Type Coal Gangue Sorting Robot

Coal gangue sorting is essential for improving coal quality and utilizing solid waste. In practical applications, robotic arms must not only complete target grasping but also maintain smooth trajectories and effective obstacle avoidance. Traditional RRT* algorithms face challenges such as long computation times and overly extended paths. This paper proposes an improved RRT* algorithm combining the bounding box method and Artificial Potential Field to enhance obstacle avoidance. A probabilistic bias strategy is in-troduced to maintain randomness while guiding path growth, and cubic B-spline interpolation smooths the trajectory. Experiments comparing the improved RRT* algorithm with the traditional RRT algorithm show that the proposed method is more suitable for coal gangue sorting. Adding target region bias reduced the average runtime by 10.22%, and under this strategy, the improved algorithm achieved shorter path lengths and a 35.89% reduction in runtime. The results demonstrate that the proposed algorithm effectively addresses obstacle avoidance and performs better in coal gangue sorting environments, with shorter paths and faster runtimes.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/icraic65937.2024.00052
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Obstacle Avoidance Trajectory Planning for Truss-Type Coal Gangue Sorting Robot

Jiaquan Yang, Yulong Wang, Yanwei Wang, Zheng Wang et al.
Robotic Path Planning Algorithms
article

Obstacle Avoidance Trajectory Planning for Truss-Type Coal Gangue Sorting Robot

Jiaquan Yang, Yulong Wang, Yanwei Wang, Zheng Wang, Xiangyu Zhang, Ziying Min
article en

Abstract

Coal gangue sorting is essential for improving coal quality and utilizing solid waste. In practical applications, robotic arms must not only complete target grasping but also maintain smooth trajectories and effective obstacle avoidance. Traditional RRT* algorithms face challenges such as long computation times and overly extended paths. This paper proposes an improved RRT* algorithm combining the bounding box method and Artificial Potential Field to enhance obstacle avoidance. A probabilistic bias strategy is in-troduced to maintain randomness while guiding path growth, and cubic B-spline interpolation smooths the trajectory. Experiments comparing the improved RRT* algorithm with the traditional RRT algorithm show that the proposed method is more suitable for coal gangue sorting. Adding target region bias reduced the average runtime by 10.22%, and under this strategy, the improved algorithm achieved shorter path lengths and a 35.89% reduction in runtime. The results demonstrate that the proposed algorithm effectively addresses obstacle avoidance and performs better in coal gangue sorting environments, with shorter paths and faster runtimes.

Heilongjiang University of Science and Technology (CN), Yichun University (CN)
Climate action
Openalex Percentile: Top 70%
Robotic Path Planning Algorithms
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.