首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于改进的自适应和声搜索算法的时间最优轨迹规划
引用本文:胡长风,刘国栋.基于改进的自适应和声搜索算法的时间最优轨迹规划[J].江南学院学报,2013(6):682-687.
作者姓名:胡长风  刘国栋
作者单位:江南大学物联网工程学院,江苏无锡214122
摘    要:根据机械臂运动约束,提出了关节空间基于改进的自适应和声搜索算法的三次样条插值轨迹规划。该算法采用自适应的记忆库取值概率、微调概率和调节步长产生新解。利用三次样条插值方法构造各关节位移、速度及加速度均连续的轨迹,然后由IAHS算法解算出最优时间。通过与基本和声搜索算法的对比,表明该算法有更强的寻优能力。

关 键 词:机械臂  轨迹规划  时间最优  改进自适应和声算法  三次样条插值

Minimum-Time Trajectory Planning for Manipulators Based on the IAHS Algorithm
HU Chang-feng,LIU Guo-dong.Minimum-Time Trajectory Planning for Manipulators Based on the IAHS Algorithm[J].Journal of Jiangnan College,2013(6):682-687.
Authors:HU Chang-feng  LIU Guo-dong
Institution:(School of Internet of Things Engineering, Jiangnan University, Wuxi 214122, China)
Abstract:According to the velocity limitation of manipulators, a time-optimal cubic splines interpolation trajectory planning is presented based on the improved adaptive harmony search (IAHS) Algorithm. Adaptive harmony consideration rate, pitch adjusting rate and band width are used to produce new solutions. Using cubic splines interpolation to construct the path that position, velocity, acceleration of each joint, the IAHS algorithm is used to get the time of the cubic splines interpolation. The simulation results show that the algorithm has good performance compared with the harmony search algorithm.
Keywords:manipulator  trajectory planning  time-optimization  IAHS  cubic splines
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号