首页 | 官方网站   微博 | 高级检索  
     

冗余度机器人在一般限制条件下的最优轨迹规划
引用本文:吉爱国,冯汝鹏.冗余度机器人在一般限制条件下的最优轨迹规划[J].哈尔滨工业大学学报,1997,29(2):54-56.
作者姓名:吉爱国  冯汝鹏
摘    要:在讨论冗余度机器人的最优轨迹规划过程中,提出了扩展雅可比矩阵法。将雅可比矩阵和限制条件函数对各关节位置的导数阵联合起来,构成扩展雅可比方阵。讨论了扩展雅可比矩阵的逆,得到了一般限制条件下的最优解与最小范数解的关系,并用此关系进行最优轨迹规划。

关 键 词:冗余度机器人  雅可比矩阵  轨迹规划  机器人

Optimal Path Planning of Redundant Robots in General Limit Condition
Ji Aiguo Feng Rupeng Guo Wei Zhang Jinjiang.Optimal Path Planning of Redundant Robots in General Limit Condition[J].Journal of Harbin Institute of Technology,1997,29(2):54-56.
Authors:Ji Aiguo Feng Rupeng Guo Wei Zhang Jinjiang
Affiliation:Dept. of Control Engineering
Abstract:A method using extended Jacobian matrices to find the optimal path of a redundant robot is presented. The Jacobian matrices and the derivative matrix of the limit function to joint angles are combined into an extended Jacobian matrix. The inverse matrix of the extended Jacobian matrix is discussed, the relation between an optimal solution in general limit condition and the least-norm solution is obtained, which can be used to find the optimal path
Keywords:Redundant robot  Jacobian matrix  optimal path planning  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号