Localized Path Planning for Mobile Robots Based on a Subarea-Artificial Potential Field Model
Qiang Lv, Guoqiang Hao, Zhen Huang, Bin Li, Dandan Fu, Huanlong Zhao, Wei Chen, Sheng Chen
Abstract
The artificial potential field method has efficient obstacle avoidance ability, but this traditional method suffers from local minima, unreasonable paths, and sudden changes in heading angles during obstacle avoidance, leading to rough paths and increased energy consumption. To enable autonomous mobile robots (AMR) to escape from local minimum traps and move along reasonable, smooth paths while reducing travel time and energy consumption, in this paper, an artificial potential field method based on subareas is proposed. First, the optimal virtual subgoal was obtained around the obstacles based on the relationship between the AMR, obstacles, and goal points in the local environment. This was done according to the virtual subgoal benefit function to solve the local minima problem and select a reasonable path. Secondly, when AMR encountered an obstacle, the subarea-potential field model was utilized to solve problems such as path zigzagging and increased energy consumption due to excessive changes in the turning angle; this helped to smooth its planning path. Through simulations and actual testing, the algorithm in this paper demonstrated smoother heading angle changes, reduced energy consumption, and a 10.95% average reduction in movement time when facing a complex environment. This proves the feasibility of the algorithm.