欧拉公式
拉格朗日
数学
应用数学
牛顿法
计算
等价(形式语言)
拉格朗日力學
代表(政治)
数学优化
数学分析
非线性系统
算法
物理
分析力学
纯数学
政治
法学
量子
量子力学
政治学
量子动力学
标识
DOI:10.1177/027836498200100204
摘要
Recently, there has been considerable interest in efficient formulations of manipulator dynamics. The inefficiency of the classic Lagrangian formulation is well known, leading several researchers to a new formulation based on the Newton-Euler equations. This formulation is highly ef ficient, but there may be some confusion as to the source of this efficiency. This paper shows that there is in fact no fundamental difference in computational efficiency between Lagrangian and Newton-Euler formulations. The efficiency of the above-mentioned Newton-Euler formula tion is due to two factors: the recursive structure of the computation and the representation chosen for the rota tional dynamics. Both of these factors can be achieved in a Lagrangian formulation. Recursive Lagrangian dy namics has been discussed previously by Hollerbach. This paper compares the representations that have been used and shows that with a proper choice the Lagrangian formulation is indeed equivalent to the Newton-Euler formulation.
科研通智能强力驱动
Strongly Powered by AbleSci AI