Research on industrial robot path planning based on improved RRT algorithm

Path planning is a supporting technology in the field of industrial robot research. Appropriate path planning algorithms can ensure the safety of industrial robots at work and improve their work efficiency. This paper proposes an SRRT path planning algorithm based on Sarsa reinforcement learning, which retains the high efficiency of RRT node expansion and uses the feedback value of the expanded node as the evaluation criterion for the expansion process for subsequent learning processes. By improving the greedy strategy and reward function, the random tree follows the idea of "exploring first and then using", selects valid nodes with high feedback values as much as possible, reduces the amount of calculation in the subsequent learning process, improves the utilization rate of valid nodes, and expands the applicable environment of the algorithm.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1117/12.3049817
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

Research on industrial robot path planning based on improved RRT algorithm

Lu Fang
Robotic Path Planning Algorithms
article

Research on industrial robot path planning based on improved RRT algorithm

Lu Fang
article en

Abstract

Path planning is a supporting technology in the field of industrial robot research. Appropriate path planning algorithms can ensure the safety of industrial robots at work and improve their work efficiency. This paper proposes an SRRT path planning algorithm based on Sarsa reinforcement learning, which retains the high efficiency of RRT node expansion and uses the feedback value of the expanded node as the evaluation criterion for the expansion process for subsequent learning processes. By improving the greedy strategy and reward function, the random tree follows the idea of "exploring first and then using", selects valid nodes with high feedback values as much as possible, reduces the amount of calculation in the subsequent learning process, improves the utilization rate of valid nodes, and expands the applicable environment of the algorithm.

Huizhou University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 84%
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.