基于多目标蛾群算法的机械臂最优轨迹规划

Optimal Trajectory Planning for A Manipulator Based on Multi-Objective Moth Swarm Algorithm

  • 摘要: 为了提高绿篱修剪机械臂的效率和稳定性,以运行时间和关节冲击为优化目标,提出一种基于改进的多目标蛾群算法(Improved Multi-Objective Moth Swarm Algorithm,IMOMSA)的最优轨迹规划方法。根据机械臂结构形式,结合其可操作性选择路径点并进行插值拟合。在运动学约束下使用IMOMSA进行时间-冲击多目标优化,生成Pareto最优解集并通过模糊隶属函数选择最优解。该算法整合帕累托存档和拥挤距离机制以扩展单目标算法,并引入混沌初始化和对立学习(Opposition-Based Learning,OBL)改进策略。通过两个算例将IMOMSA与经典多目标优化算法进行对比,在ZDT测试函数集中评估算法多样性和收敛性指标,在实际轨迹规划问题中验证算法有效性。最后得到的仿真结果显示,优化后的运行时间减少11.8%,各关节冲击指数下降5.98%至39.96%,IMOMSA在最优轨迹规划问题中的应用可提升绿篱修剪机械臂的效率与稳定性。

     

    Abstract: We propose an optimal trajectory planning method based on the improved multi-objective moth swarm algorithm (IMOMSA) to enhance the efficiency and stability of a hedge-trimming manipulator, with running time and joint impact as the optimization objectives. Based on the structure and operability of the robotic arm, we select and interpolate path points for fitting. Under kinematic constraints, IMOMSA performs time-impact multi-objective optimization, generating a Pareto optimal solution set, from which the optimal solution is selected using fuzzy membership functions. This algorithm integrates Pareto archiving and crowding distance mechanisms to extend single-objective algorithms while incorporating chaotic initialization and opposition-based learning (OBL) improvement strategies. We conduct two case studies to compare IMOMSA with classical multi-objective optimization algorithms. The diversity and convergence of the algorithm are evaluated using the ZDT test function set, and its effectiveness is validated in a practical trajectory planning problem. Simulation results show that the optimized running time is reduced by 11.8%, and the joint impact index decreases by 5.98% to 39.96%. The application of IMOMSA in trajectory planning substantially enhances the efficiency and stability of the hedge-trimming manipulator.

     

/

返回文章
返回