检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京邮电大学自动化学院,北京100876 [2]北方工业大学机电工程学院,北京100041
出 处:《北京航空航天大学学报》2009年第1期48-51,共4页Journal of Beijing University of Aeronautics and Astronautics
基 金:国家973资助项目(2004CB318000);国家自然科学基金资助项目(50475161);国家863计划资助项目(2007AA04Z211)
摘 要:为获得Stewart台体并联机器人位置正解的解析解,使用分次字典序Groeb-ner基和Sylvester结式相结合的代数方法对该问题进行研究.利用计算代数中的分次字典序Groebner基算法,计算该机器人位置正解封闭数学模型的分次字典序Groebner基;从得出的51个基中选取20个基,构造20阶Sylvester结式,分析符号形式方程组的变量次数,可以直接得出该机器人位置正解一元高次方程的次数为40且最多有40组解的结论,其结果与前人的完全一致,但结式的尺寸却小得多.为了对结果进行验证,使用同伦连续法对同一个数字算例进行计算,两种方法得到结果一致.为并联机构位置正解的研究提供了一种新的有效算法.The Groebner-Sylevester hybrid approach was presented to obtain the closed-form solutions of the direct kinematics of the Stewart mechanism robot. The reduced Groebner basis under degree lexicographic ordering for the closed-form equations was presented based on computer algebra method. And 20 Groebner basis were picked out from the 51 Groebner basis. Then a 20 × 20 dimensional Sylvester's matrix was construeted, which is relatively small in size. And a 40th degree univariate equation was presented from the determinate of the matrix by analyzing the numbers of the variables in the equations. To verify the proposed algorithm, a same numerical example was calculated based on the continuation method as well as the the proposed algorithm. It shows that the proposed algorithm calculates simply and rapidly to lead to the univariate equation. The results both by using the continuation method and based on the proposed algorithm are same. Then a novel and practical algorithm to solve the direct kinematics of the parallel mechanism robot was presented.
关 键 词:并联机构 位置正解 Sylvester结式
分 类 号:TH112[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112