改进旅鼠算法的机器人路径规划研究
DOI:
CSTR:
作者:
作者单位:

太原科技大学电子信息工程学院 太原 030024

作者简介:

通讯作者:

中图分类号:

TP301.6;TN965

基金项目:

山西省基础研究计划面上项目(202203021221153)、国家自然科学基金青年科学基金(61703297)资助


Robot path planning research with improved artificial lemming algorithm
Author:
Affiliation:

School of Electronic Information Engineering,Taiyuan University of Science and Technology,Taiyuan 030024, China

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    为解决旅鼠算法(ALA)收敛速度慢、收敛精度低、易陷入局部最优的问题,提出一种多策略改进旅鼠算法(IALA)。首先引入Hammersley序列对算法进行种群初始化,使初始种群具有更加优秀的搜索能力;然后利用反向差分变异机制,提高种群的多样性,增强算法逃离局部最优的能力;最后通过软霜冰搜索机制,让算法在优化过程中兼顾局部性和全局性,提高了算法的寻优能力和收敛速度。为验证改进算法的有效性,选取9个基准测试函数对改进算法进行对比测试,对比结果显示:IALA有着更快的收敛速度及更高的收敛精度。最后将改进算法应用于3种复杂程度地图的机器人路径规划仿真实验,结果表明:与原算法ALA进行比较,改进后的算法IALA在第1种地图中路径最优值下降0.64%,平均值下降2.86%;在第2种地图中路径最优值下降10.24%,平均值下降6.91%;在最后一种地图中路径最优值下降2.02%,平均值下降2.6%。证明了改进后的算法具有更好的路径寻优能力。

    Abstract:

    In order to solve the problems of slow convergence speed, low convergence accuracy and easy to fall into local optimization of artificial lemmings algorithm (ALA), a multi strategy improved artificial lemmings algorithm (IALA) is proposed. Firstly, Hammersley sequence is introduced to initialize the population of the algorithm, so that the initial population has better search ability; then the reverse differential mutation mechanism is used to improve the diversity of the population and enhance the ability of the algorithm to escape from the local optimum; finally, through the soft frost ice search mechanism, the algorithm takes into account the local and global characteristics in the optimization process, which improves the optimization ability and convergence speed of the algorithm. In order to verify the effectiveness of the improved algorithm, nine benchmark functions are selected to compare the improved algorithm. The comparison results show that IALA has faster convergence speed and higher convergence accuracy. Finally, the improved algorithm is applied to the simulation experiment of robot path planning on three kinds of complex maps. The results show that compared with the original algorithm ala, the improved algorithm IALA in the first kind of map, the optimal value of path decreases by 0.64%, and the average value decreases by 2.86%; in the second map, the optimal value of path decreased by 10.24%, and the average value decreased by 6.91%; in the last map, the optimal value of the path decreased by 2.6%, and the average value decreased by 1.3%. It is proved that the improved algorithm has better path optimization ability.

    参考文献
    相似文献
    引证文献
引用本文

焦怀良,刘立群,何俊强,张政,吴青峰.改进旅鼠算法的机器人路径规划研究[J].电子测量技术,2026,49(6):86-97

复制
分享
相关视频

文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2026-05-13
  • 出版日期:
文章二维码

重要通知公告

①《电子测量技术》期刊收款账户变更公告