Path Planning for Robotic Arm Obstacle Avoidance Based on the Improved African Vulture Optimization Algorithm

To address the problems of low success rate, excessively long obstacle avoidance paths, and a large number of invalid nodes in path planning for robotic arms in complex environments, this paper proposes an obstacle avoidance path planning method based on the Cauchy Chaotic African Vulture Optimization Algorithm (CC-AVOA). By introducing a Cauchy perturbation term, the algorithm retains a certain degree of randomness in the later stages of the search, which helps to escape local optima. Furthermore, the introduction of a logical chaotic mapping increases the diversity of the initial vulture population, thereby improving the overall search efficiency of the algorithm. This paper compares the performance of the CC-AVOA algorithm with the standard African Vulture Optimization Algorithm (AVOA), the Rapid Exploratory Random Tree (RRT) algorithm, and the A* algorithm through simulation experiments in MATLAB R2024a under two-dimensional, three-dimensional, and robotic arm space environments. The results show that the CC-AVOA algorithm can generate paths with fewer nodes and shorter paths. Finally, the CC-AVOA algorithm is validated on both the RoboGuide industrial simulation platform and a physical FANUC robotic arm. The planned trajectories can be accurately executed without collisions, further confirming the feasibility and reliability of the proposed method in real industrial scenarios.