首页|期刊导航|机械科学与技术|面向多工位多机器人焊接任务的多目标优化方法

面向多工位多机器人焊接任务的多目标优化方法OA

A Multi-objective Optimization Method for Multi-station and Multi-robot Welding Tasks

中文摘要英文摘要

在多工位多机器人的多目标优化问题中焊接机器人的轨迹规划和多工位多机器人任务分配是决定焊接效率和能耗的关键因素.针对多工位多机器人任务分配这一多约束、强耦合的问题,综合考虑机器人的最大速度和加速度、可达性、碰撞、焊接时间等多重约束条件,构建出面向焊接任务分配和焊接顺序协同规划的多目标优化模型,提出一种三层逐步优化算法对其进行优化求解.采用改进 NSGA-II 算法对焊接机器人进行多目标轨迹优化,得到 Pareto 最优解集,选择合适的解作为轨迹曲线,并在 Process Simulate 中构建出虚拟仿真模型对可达性、碰撞、超约束等指标进行分析,验证该轨迹的可行性.搭建实验平台验证了所提方法的有效性.实验结果表明:相比贪婪算法,该算法完工时间提高了 6.93%,能耗降低了 5.01%;相比模糊 C 均值与蚁群组合算法,完工时间提高了4.53%,能耗降低了 2.13%,证明了该方法的优越性.

The trajectory planning of welding robots and task allocation in multi-station multi-robot systems are crucial elements that determine welding efficiency and energy consumption in the multi-objective optimization problem.For the multi-constraint and strongly coupled problem of multi-station and multi-robot task allocation,considering multiple constraint conditions such as the maximum speed and acceleration of the robot,reachability,collision,and welding time comprehensively,a multi-objective optimization model for welding task allocation and welding sequence collaborative planning is constructed,and a three-layer stepwise optimization algorithm is proposed to optimize and solve it.An optimization model is created for the collaborative planning of welding task distribution and welding sequence,along with a three-layer step-by-step optimization algorithm to solve the model efficiently.The improved NSGA-II algorithm is utilized to optimize the multi-objective trajectory of the welding robot based on path optimization results obtained from a three-layer step-by-step optimization algorithm.The algorithm identifies the Pareto optimal solution set,selects a suitable solution as the trajectory curve,and creates a virtual simulation model in Process Simulate to analyze accessibility,collision,and super-constraints indexes,thereby validating the trajectory feasibility.An experimental platform is built to verify the effectiveness of the proposed method.The three-layer step-by-step optimization algorithm outperforms the greedy algorithm by reducing completion time by 6.93%and energy consumption by 5.01%.It also surpasses the combination of fuzzy C-mean and ant colony algorithm by improving completion time by 4.53%and reducing energy consumption by 2.13%,demonstrating the superiority of this method.

余坼操;朱学军;杨旭东;温琼阳;王鹏;彭达

宁夏大学 机械工程学院,银川 750021宁夏大学 机械工程学院,银川 750021宁夏大学 机械工程学院,银川 750021宁夏大学 机械工程学院,银川 750021宁夏大学 机械工程学院,银川 750021宁夏大学 机械工程学院,银川 750021

信息技术与安全科学

多工位多机器人三层逐步优化任务分配多目标优化

multi-stationmulti-robotthree-layer step-by-step optimizationtask allocationmulti-objective optimization

《机械科学与技术》 2026 (5)

814-827,14

国家自然科学基金项目(51765056)

10.13433/j.cnki.1003-8728.20240081

评论