基于IAGA的机械手时间最优轨迹规划*

作者：周小燕,高峰,鲍官军,杨庆华 日期：2009-08-18/span> 浏览：3591 查看PDF文档

基于IAGA的机械手时间最优轨迹规划*

周小燕,高峰,鲍官军,杨庆华
（浙江工业大学 机械制造及自动化教育部重点实验室，浙江 杭州 310014）

摘要：为了实现机械手在约束范围内以最快的速度运动，将遗传算法应用于机械手时间最优轨迹规划的研究。在遗传算法进化过程的基础上，提出了一种基于种群集散状态的改进自适应遗传算子，同时采用了优胜劣汰的选择方式，进化后期交换交叉和变异的顺序，有效地解决了简单遗传算法的两大缺陷。对PUMA560的前三铰进行了仿真试验，并与混沌优化法进行了对比分析。实验结果表明，所提出的算法可以有效地防止早熟，收敛速度更快，鲁棒性更好且拥有较强的寻优能力。
关键词：改进自适应遗传算法；机械手；时间最优轨迹规划
中图分类号：TP242文献标识码：A文章编号：1001-4551(2009)08-0001-04

Timeoptimal trajectory planning for robot manipulators based on improved adaptive genetic algorithm
ZHOU Xiaoyan， GAO Feng， BAO Guanjun， YANG Qinghua
(The MOE Key Laboratory of Mechanical Manufacture and Automation, Zhejiang University of Technology, Hangzhou 310014， China)
Abstract: Aiming at realizing the fastest speed moving of robot manipulators in the constraints, the genetic algorithm was applied in the research of timeoptimal trajectory planning of robot manipulators. A scheme of improved selfadaptive genetic algorithm(IAGA) on population species distribution status was proposed based on the course of genetic evolution, the select strategy of suruival of the fittest was adopted, and at the anaphase of evolvement, the order of cross and variation was exchanged, which deals with the two disadvantages of the simple genetic algorithm(SGA) efficiently. Simulations of PUMA560 robots first three joints were carried out. Compared with chaos optimization, the experimental results show that the presented algorithm features virtues of prematurity prevention, faster convergence speed and higher robustness with strong search ability.
Key words: improved selfadaptive genetic algorithm(IAGA); robot manipulators; timeoptimal trajectory planning