基于改进蜂群算法的工业机器人路径规划研究
DOI:
CSTR:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TP24;TN302

基金项目:

广西科技基地和人才专项(桂科AD16380042)资助


Research on path planning for industrial robot based on improved bee colony algorithm
Author:
Affiliation:

Fund Project:

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

    针对工业机器人在复杂环境中运动的避障及路径优化问题,提出基于改进人工蜂群算法的工业机器人避障路径规划策略。首先针对传统人工蜂群算法搜索能力不足且容易陷入局部最优的问题,将禁忌搜索思想引入到人工蜂群算法最优解搜索过程中,形成了基于禁忌搜索的改进型人工蜂群算法,然后将其应用到工业机器人的路径规划问题中,并进行了仿真实验。结果表明,改进后的方法能够得到最优的路径,且寻优速度快、过程稳定。该方法可用于解决工业机器人路径规划问题。

    Abstract:

    Aiming at the obstacle avoidance and path optimization for industrial robots in complex environments, a path planning strategy for robot obstacle avoidance based on improved artificial bee colony algorithm is proposed. Firstly, aiming at the problems of lack of search ability and easy to fall into local optimum for traditional artificial bee colony algorithm, tabu search is introduced into the search process of artificial bee colony algorithm. An improved artificial bee colony algorithm based on tabu search is formed, and applied to the path planning problem of industrial robot. The results show that the improved method can obtain the optimal obstacle path of industrial robot, and the optimization speed is fast and the process is stable, which can be used to solve the problem of obstacle avoidance path planning of g industrial robot.

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

吴方圆.基于改进蜂群算法的工业机器人路径规划研究[J].电子测量技术,2019,42(7):13-17

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2021-08-09
  • 出版日期:
文章二维码