首页|期刊导航|荆楚理工学院学报|面向移动机器人路径规划的蝴蝶优化算法研究

面向移动机器人路径规划的蝴蝶优化算法研究OA

Research on Butterfly Optimization Algorithm for Path Planning of Mobile Robots

中文摘要英文摘要

路径规划是移动机器人领域的一个核心挑战,旨在为机器人在复杂环境中寻找最优、无碰撞路径.传统优化算法往往面临局部最优陷阱和高计算复杂度等问题.本文提出了一种基于改进蝴蝶优化算法(Improved Butterfly Optimization Algorithm,IBOA)的移动机器人路径规划方法.通过引入混沌映射初始化种群、自适应概率切换机制和高斯分布估计策略修改蝴蝶种群的进化方向,提升算法的开发和探索能力.最后,通过对移动机器人路径规划问题的求解,结果表明IBOA 算法在解决移动机器人路径规划问题时表现出色,在 20×20、30×30和 50×50 栅格地图中,相比于主流算法平均路径分别缩短了 12.5%、25.2%和 6.9%.

Path planning is a core challenge in the field of mobile robotics,aimed at finding optimal,collision-free trajecto-ries for robots operating in complex environments.Traditional optimization algorithms often encounter issues such as local optima traps and high computational complexity.This paper proposes a mobile robot path planning method based on the Improved Butterfly Optimization Algorithm(IBOA).By incorporating chaotic mapping for population initialization,an adaptive probability switching mechanism,and a Gaussian distribution estimation strategy to modify the evolutionary direction of the butterfly population,the algo-rithm's exploration and exploitation capabilities are enhanced.Finally,through the resolution of mobile robot path planning prob-lem,the results indicate that the IBOA algorithm demonstrates exceptional performance in solving mobile robot path planning prob-lem,achieving an average path reduction of 12.5%,25.2%,and 6.9%compared with mainstream algorithms in 20×20,30×30,and 50×50 grid maps,respectively.

朱泽奇;李远志

安徽电子信息职业技术学院 机电工程学院,安徽 蚌埠 233000常德科技职业技术学院 互联智造学院,湖南 常德 415000

信息技术与安全科学

移动机器人路径规划蝴蝶优化算法高斯分布估计

mobile robotpath planningbutterfly optimization algorithmgaussian distribution estimation

《荆楚理工学院学报》 2026 (4)

1-10,10

湖南省教育厅科学研究项目(25C0831)

评论