基于改进灰狼优化的煤矿巡检机器人路径规划算法研究

Path planning algorithm for coal mine inspection robots based on improved Grey Wolf Optimizer

  • 摘要: 针对基于灰狼优化(GWO)的煤矿巡检机器人路径规划算法在井下复杂环境下存在易陷入局部最优、动态适应性不足等问题,提出一种基于改进GWO(IGWO)的煤矿巡检机器人路径规划算法(IGWO算法)。引入分段线性混沌映射(PWLCM)进行种群初始化,确保种群分布均匀,增强全局搜索能力。设计非线性收敛因子,以有效平衡算法的全局探索与局部开发能力,避免陷入局部最优。引入双种群结构、差分进化和淘汰机制,增强种群个体多样性,提升算法对环境的适应性。融入三次B样条曲线对生成路径进行平滑处理,提高路径的可执行性,减少冗余拐点。提出一种基于特征栅格的二维空间模型,有效降低路径搜索的计算复杂度,提升算法实时性。在多种典型煤矿环境(包括随机障碍地图、固定障碍地图及狭窄地图)下,进行IGWO,GWO,基于记忆、进化算子、局部搜索和线性种群规模缩减技术的灰狼优化(MELGWO),A*,鲸鱼优化算法(WOA)及粒子群优化(PSO)算法的对比实验,结果表明:IGWO算法在规划路径长度与安全性上的表现优于对比算法。在随机复杂场景下,IGWO算法规划路径长度较MELGWO算法减少56.9%。在20×20固定场景下,IGWO算法规划路径的平均拐点数分别较WOA和A*算法减少12.5%和44.4%。在40×40固定场景下,IGWO算法规划路径长度的极差和方差均优于WOA和PSO算法。在狭窄地图环境下,IGWO算法成功规划出比A*算法更加平滑的路径,且运行时间更短。

     

    Abstract: To address the problems that path planning algorithm for coal mine inspection robots based on Grey Wolf Optimization (GWO) is prone to falling into local optima and shows insufficient dynamic adaptability in complex underground environments, an Improved GWO (IGWO)-based path planning algorithm for coal mine inspection robots was proposed. A Piecewise Linear Chaotic Map (PWLCM) was introduced for population initialization to ensure uniform population distribution and enhance global search capability. A nonlinear convergence factor was designed to effectively balance the algorithm’s global exploration and local exploitation and avoid falling into local optima. A dual-population structure, differential evolution, and an elimination mechanism were introduced to enhance population diversity and improve the algorithm’s adaptability to the environment. A cubic B-spline curve was incorporated to smooth the generated path, improving path executability and reducing redundant turning points. A two-dimensional spatial model based on feature grids was proposed to effectively reduce the computational complexity of path search and improve real-time performance of the algorithm. Comparative experiments were conducted under various typical coal mine environments including random obstacle maps, fixed obstacle maps, and narrow maps, with IGWO compared against GWO, Memory, Evolutionary Operator, Local Search, and Linear Population Size Reduction Technique based GWO (MELGWO), A*, Whale Optimization Algorithm (WOA), and Particle Swarm Optimization (PSO). The results showed that IGWO outperformed the comparison algorithms in terms of path length and safety. In random complex scenarios, the path length of IGWO was 56.9% shorter than that of MELGWO. In a 20×20 fixed scenario, the average number of turning points of IGWO was reduced by 12.5% and 44.4% compared with WOA and A*, respectively. In a 40×40 fixed scenario, the range and variance of the IGWO path length were both lower than those of WOA and PSO. In a narrow map environment, IGWO successfully planned a smoother path than A* and required less running time.

     

/

返回文章
返回