【24h】

Discrete Fireworks Algorithm for Welding Robot Path Planning

机译:用于焊接机器人路径规划的离散烟花算法

获取原文

摘要

Welding robots are widely used in manufacturing industries, and reasonable welding path planning is an important issue in production efficiency. Welding robot path planning aims to arrange the sequence of weld joints and find the optimal welding path for the robot, which is essentially a combinatorial optimization problem. With the development of artificial intelligence, swarm intelligence algorithms shed new light on this problem. Fireworks algorithm (FWA) is a newly proposed swarm intelligence algorithm, simulating the process of fireworks explosion producing sparks to find the optimal solution. It has shown excellent performance in continuous optimization problems. In this paper, a discrete fireworks algorithm (DFWA), is proposed to solve the welding robot path planning problem. We introduce some operations to the framework of traditional FWA. In DFWA, 2-opt local search and crossover operator are applied on the explosion sparks. A new way of fireworks quality judgment is designed. Mutation operator is implemented for the generation of Gaussian sparks, and the selection strategy is improved. Simulation experiments have been made to verify our method and compare its performance with other current swarm intelligence algorithms. Experimental results show that the proposed method performs well with good convergence, stability and accuracy. It is effective for welding robot path planning.
机译:焊接机器人广泛用于制造业,合理的焊接路径规划是生产效率的重要问题。焊接机器人路径规划旨在安排焊接接头的顺序,并找到机器人的最佳焊接路径,这基本上是组合优化问题。随着人工智能的发展,群体智能算法揭示了这个问题。烟花算法(FWA)是一种新提出的群体智能算法,模拟烟花爆炸的过程产生火花,找到最佳解决方案。它在连续优化问题中表现出出色的性能。本文提出了一种离散烟花算法(DFWA),以解决焊接机器人路径规划问题。我们向传统FWA的框架介绍了一些操作。在DFWA中,在爆炸火花上应用2个OPT本地搜索和交叉操作员。设计了一种新的烟花质量判断方式。实施突变算子用于Gaussian火花的产生,并改善了选择策略。已经进行了仿真实验,以验证我们的方法,并将其与其他当前群智能算法进行比较。实验结果表明,该方法具有良好的收敛,稳定性和精度。它对焊接机器人路径规划是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号