A Hybrid Path Planning Method Based on Improved A* and CSA-APF Algorithms
Open Access
- 5 March 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 39139-39151
Abstract
In order to address the challenges of global path planning in complex and dynamic environments, where avoiding dynamic obstacles is difficult, and local paths are prone to getting stuck in local optima, this paper proposes an enhanced hybrid path planning approach based on improvements to the A* algorithm and the Artificial Potential Field (APF) algorithm. Firstly, addressing the issues of redundant path nodes and non-smooth paths generated by the A* algorithm, we introduce enhancements such as weighted heuristic function, removal of redundant path nodes, and the incorporation of a cubic quasi-uniform B-spline curve to improve search speed and generate smoother paths. Secondly, addressing the problems of unreachable target points and susceptibility to local optima associated with the APF algorithm, two key strategies are employed. On one hand, the repulsive potential field function is modified by incorporating the m -th power of the relative distance from the robot to the target point to ensure reachability. On the other hand, the Constrained Simulated Annealing with Augmented Potential Field (CSA-APF) algorithm is introduced, which integrates simulated annealing with angle and safety distance constraints. This approach facilitates escaping local optima and obtaining global optimal solutions. Finally, the proposed methods are compared through simulation experiments in different scenarios. The experimental results demonstrate that the proposed approach effectively achieves path planning in complex dynamic environments.Keywords
Funding Information
- Open Project of China International Science and Technology Cooperation Base on Intelligent Equipment Manufacturing in Special Service Environment (ISTC2021KF07, ISTC2022KF04, ISTC2021KF08)
This publication has 37 references indexed in Scilit:
- A hybrid path planning algorithm considering AUV dynamic constraints based on improved A* algorithm and APF algorithmOcean Engineering, 2023
- Robot path planning based on artificial potential field with deterministic annealingISA Transactions, 2023
- A hybrid formation path planning based on A* and multi-target improved artificial potential field algorithm in the 2D random environmentsAdvanced Engineering Informatics, 2022
- A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resourcesEuropean Journal of Operational Research, 2022
- A new approach based on Bezier curves to solve path planning problems for mobile robotsJournal of Computational Science, 2022
- Enhanced ant colony algorithm with communication mechanism for mobile robot path planningRobotics and Autonomous Systems, 2022
- The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formationsOcean Engineering, 2021
- A Novel GRU-RNN Network Model for Dynamic Path Planning of Mobile RobotIEEE Access, 2019
- Heterogeneous-ants-based path planner for global path planning of mobile robot applicationsInternational Journal of Control, Automation, and Systems, 2017
- A hierarchical path planning approach based on A ⁎ and least-squares policy iteration for mobile robotsNeurocomputing, 2015