Research on Obstacle Avoidance Trajectory for Robots Based on RRT Algorithm
Aerospace engine blade remanufacturing technology requires intelligent adaptive techniques for support. Due to the complexity of the operating environment and the demand for intelligence, in order to maximize machining efficiency, avoid collisions, and adapt to different blade shapes and sizes, as well as to enhance production flexibility, research emphasis should be placed on path planning. Through robotic path planning, it is possible to effectively optimize the machining path, reduce the movement time of the robot during the machining process, improve machining efficiency, and reduce the machining cycle. This paper first introduces the traditional rapidly exploring random tree (RRT) algorithm and the RRT* algorithm, and proposes an improved RRT* algorithm to address the shortcomings of these two algorithms. It first introduces the improved RRT* algorithm and proposes three improvement strategies. Then, it conducts simulations in two-dimensional space and validates its effectiveness in two map environments. Finally, the paper models a robotic arm on the MATLAB software platform, simulates the path smoothing planning of the robotic arm, thereby verifying the feasibility and superiority of the algorithm.
Authors
- Dazhong Wang (ORCID: https://orcid.org/0000-0003-4658-0373)
- Rao Yao (ORCID: https://orcid.org/0009-0001-3594-3426)
- Jiaran Wang
- Pengfei Sun (ORCID: https://orcid.org/0000-0002-0563-5481)
Institutions
- Shanghai University of Engineering Science (CN)
Publication Details
- Published
- 2025-03-07
- DOI
- https://doi.org/10.1109/icrca64997.2025.11011122
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China