融合APF与IDBO算法的煤矿机器人路径规划

Path Planning of Coal Mine Robots Based on Fused APF-IDBO Algorithm

  • 摘要: 针对煤矿井下非结构化环境及动态障碍物干扰导致煤矿机器人路径规划收敛慢、路径曲折且易陷入局部最优等问题,提出一种融合人工势场与多策略改进蜣螂优化算法(AIDBO)。首先,引入Singer混沌映射初始化种群,提高初始解在复杂巷道中的分布均匀性;其次,融合对数螺旋反向学习策略与非线性自适应收缩因子,增强算法跳出局部最优的能力并协同平衡全局与局部搜索;通过在CEC2005函数集上的性能测试,改进蜣螂优化算法(IDBO)在全局搜索能力和收敛精度方面均优于DBO算法。最后,构建适应度-障碍双驱动的增益自适应策略,将APF作为后处理算子嵌入算法中,利用势场机制对全局路径进行二次平滑与局部微调。通过在多种维度的栅格地图中进行仿真验证,AIDBO算法在静态与动态环境下均表现出显著优势。在30×30静态场景中,AIDBO算法的最短路径长度为45.0537cm,较IDBO和DBO算法分别缩短了15.4%和22.0%;在40×40动态复杂环境下,AIDBO路径长度为58.5261cm,较IDBO和DBO分别缩短了20.3%和28.2%。此外,引入适应度-障碍双驱动策略后,路径拐点数减少了15.38%,转角度数降低了21.77%,最小安全距离提升了14.94%。AIDBO算法不仅显著提升了路径规划的收敛精度与寻优效率,更有效解决了动态环境下的路径平滑与安全避障问题,具有较强的鲁棒性。

     

    Abstract: Aiming at the problems of slow convergence, tortuous paths, and susceptibility to local optima in the path planning of coal mine robots caused by unstructured environments and dynamic obstacle interference in underground coal mines, a path planning method integrating Artificial Potential Field (APF) and Multi-strategy Improved Dung Beetle Optimization (AIDBO) is proposed. Firstly, the Singer chaotic map is introduced to initialize the population, thereby improving the distribution uniformity of initial solutions in complex roadway environments. Secondly, the logarithmic spiral opposition-based learning strategy and non-linear adaptive constriction factor are fused to enhance the algorithm's ability to escape from local optima and synergistically balance global exploration and local exploitation. Performance tests on the CEC2005 benchmark function set demonstrate that the Improved Dung Beetle Optimization (IDBO) algorithm is superior to the standard DBO algorithm in terms of global search capability and convergence accuracy. Finally, a fitness-obstacle dual-driven gain adaptive strategy is constructed to embed APF into the algorithm as a post-processing operator, utilizing the potential field mechanism to perform secondary smoothing and local fine-tuning on the global path. Simulation verifications in grid maps of various dimensions show that the AIDBO algorithm exhibits significant advantages in both static and dynamic environments. In the 30×30 static scenario, the shortest path length of the AIDBO algorithm is 45.0537 cm, which is shortened by 15.4% and 22.0% compared with IDBO and DBO algorithms, respectively. In the 40×40 dynamic complex environment, the path length of AIDBO is 58.5261 cm, shortened by 20.3% and 28.2% compared with IDBO and DBO, respectively. Furthermore, after introducing the fitness-obstacle dual-driven strategy, the number of path inflection points is reduced by 15.38%, the cumulative turning angle is reduced by 21.77%, and the minimum safety distance is increased by 14.94%. The AIDBO algorithm not only significantly improves the convergence accuracy and optimization efficiency of path planning but also effectively solves the problems of path smoothing and safe obstacle avoidance in dynamic environments, demonstrating strong robustness.

     

/

返回文章
返回