Research on Path-Planning Algorithm Integrating Optimization A-Star Algorithm and Artificial Potential Field Method

Citations Over TimeTop 10% of 2022 papers

Abstract

A fusion pathfinding algorithm based on the optimized A-star algorithm, the artificial potential field method and the least squares method is proposed to meet the performance requirements of path smoothing, response speed and computation time for the path planning of home cleaning robots. The fusion algorithm improves the operation rules of the traditional A-star algorithm, enabling global path planning to be completed quickly. At the same time, the operating rules of the artificial potential field method are changed according to the path points found by the optimal A-star algorithm, thus greatly avoiding the dilemma of being trapped in local optima. Finally, the least squares method is applied to fit the complete path to obtain a smooth path trajectory. Experiments show that the fusion algorithm significantly improves pathfinding efficiency and produces smoother and more continuous paths. Through simulation comparison experiments, the optimized A-star algorithm reduced path-planning time by 60% compared to the traditional A-star algorithm and 65.2% compared to the bidirectional A-star algorithm path-planning time. The fusion algorithm reduced the path-planning time by 65.2% compared to the ant colony algorithm and 83.64% compared to the RRT algorithm path-planning time.

Related Papers

• → Research on the A-star Algorithm Based on Path Finding(2023)4 cited
• → Fast Path planning on planar occupancy grid exploiting geometry of obstacles(2017)2 cited
• → Integrated Global Path Planning for Autonomous Mobile Robots in Complicated Environments(2022)1 cited
• → Dynamic 3D Point-Cloud-Driven Autonomous Hierarchical Path Planning for Quadruped Robots(2024)1 cited
• Indoor path planning algorithm and simulation of cleaning robot based on MRDS(2014)