Research on Path Planning of Path-Finding Robot Based on Optimized RRT Algorithm
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
To address the problems of long time consumption, low efficiency, and even planning failure in the autonomous path planning of path-finding robots in complex environments, a path planning method (APF-RRT) for pathfinding robots based on the fusion of the Artificial Potential Field (APF) method and the Rapidly Exploring Random Tree (RRT) algorithm is proposed. This method makes full use of the advantage of the RRT algorithm, which can conduct path exploration in any direction, and at the same time integrates the improved new potential field function of the APF method. This enables the path-finding robot to simultaneously possess the ability of active obstacle avoidance while moving towards the target area. A simulation environment was built using Matlab to simulate and compare the path planning effects of this fusion algorithm with other traditional algorithms under different scenarios. The simulation results show that compared with traditional algorithms, the APF-RRT fusion algorithm exhibits significant advantages in three key dimensions: path planning speed, control of the number of generated nodes, and optimal path selection, which effectively improves the path planning performance of path-finding robots. This research supports Sustainable Development Goal 9 (Industry, Innovation, and Infrastructure) by promoting intelligent robotic systems for sustainable automation.
Fields of Study & Subjects
Robotic Path Planning Algorithms
Reinforcement Learning in Robotics
Robotics and Sensor-Based Localization
Publication details
- Journal / source
- IEEE International Conference on Power, Electronics and Green Energy (ICPEGE)
- Pages
- 1594–1598
- Publication date
- 28 January 2026
- Language
- EN