Oct 2026· International Conference on Computer Vision, Robotics and Automation Engineering· Vol 14353, pp. 143531S - 143531S-9· 0 citations· 20 references
Engineering
TL;DR
An improved Informed-RRT* algorithm combined with a pruning strategy over the original RRT is investigated, which significantly improves path compactness and smoothness, and is well suited for practical robotic arm obstacle avoidance tasks.
Abstract
Efficient and reliable obstacle avoidance path planning is crucial for robotic arms operating in complex environments. This paper addresses the path planning problem of the PUMA560 robotic arm in scenarios with cuboid and spherical obstacles. We investigate the performance improvement of an improved Informed-RRT* algorithm combined with a pruning strategy over the original RRT. The algorithm rapidly obtains an initial path via a guiding mechanism, followed by progressive optimization and path pruning, ultimately generating a smooth and collision-free trajectory. Three scenarios with different obstacle avoidance difficulties (cuboid slight blocking, cuboid full blocking, spherical full blocking) are designed. Experimental results show that, compared with RRT, the improved Informed-RRT* algorithm slightly reduces the path cost but significantly improves planning efficiency and stability (e.g., planning time reduced by approximately 26% in the slight blocking scenario). The pruning step further reduces the path cost substantially, by approximately 40% on average across all three scenarios, with negligible time overhead, showing strong reliability across scenarios. The method is simple to implement, significantly improves path compactness and smoothness, and is well suited for practical robotic arm obstacle avoidance tasks.
This paper proposes IBPAS-RRT*, an adaptive bidirectional RRT* algorithm with joint-space potential field guidance that incorporates obstacle and goal information into joint-space tree expansion, thereby avoiding repeated inverse kinematics calls during planning.
This paper presents a comparative performance evaluation of three sampling-based path planning algorithms—RRT, RRT-Connect, and RRT*—for mobile robot navigation in complex environments. Experiments are conducted on three obstacle-avoidance maps with two distinct path-length scenarios, using path length, planning time,...
Jia-Jun Liu· International Conference on...· 0 citations
Robot path planning is a key core technology for realizing autonomous navigation of robots. Among them, the A* algorithm has been widely used due to its good balance between path optimality and search efficiency. However, the traditional A* algorithm faces problems such as excessive expansion nodes, numerous path infle...
Shao-Wei Hao· Journal of Computer Science...· 2 citations
A hybrid path planning algorithm that integrates an improved Bidirectional Rapidly-exploring Random Tree (BI-RRT) for global guidance with an enhanced Dynamic Window Approach (DWA) for local execution that improves search efficiency and maintains 100% success rate across tested environments.
Efficient and safe path planning is the core prerequisite for realizing the autonomous crushing operation of the hydraulic crushing robotic arm in the mine chute. Foundational sampling-based algorithms, specifically standard RRT* and Informed RRT*, have problems such as unattainable targets, high computational redundan...
Miao Chen, Guo-Wei Li, Lei Si et al.· Modelling· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.