arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.01033cs.RO
收藏

刚体系统科里奥利矩阵和Christoffel符号的数值计算方法

Numerical Methods to Compute the Coriolis Matrix and Christoffel Symbols for Rigid-Body Systems

University of Notre Dame(圣母大学)

Sebastian Echeandia, Patrick M. Wensing

摘要:

本文提出了方法,有效地计算科里奥利矩阵和基本的Christoffel符号(第一类)的树结构刚体系统。该算法可以执行纯粹的数字,而不需要偏导数在不可缩放的符号技术。计算共享一个递归结构,与经典的方法,如复合刚体算法,是最低的顺序:$O(Nd)$的科里奥利矩阵和$O(Nd^2)$的克里斯托弗符号,其中$N$是机构的数量和$d$是运动树的深度。在C/C++中的实现示出了在具有20个自由度的系统上,对于科里奥利矩阵的大约10-20 $μ$ s的计算时间和对于Christoffel符号的大约40-120 $μ$ s的计算时间。结果表明,采用这些算法在高速率($>$ 1 kHz)环路基于模型的控制应用的可行性。

英文摘要:

This article presents methods to efficiently compute the Coriolis matrix and underlying Christoffel symbols (of the first kind) for tree-structure rigid-body systems. The algorithms can be executed purely numerically, without requiring partial derivatives as in unscalable symbolic techniques. The computations share a recursive structure in common with classical methods such as the Composite-Rigid-Body Algorithm and are of the lowest possible order: $O(Nd)$ for the Coriolis matrix and $O(Nd^2)$ for the Christoffel symbols, where $N$ is the number of bodies and $d$ is the depth of the kinematic tree. Implementation in C/C++ shows computation times on the order of 10-20 $μ$s for the Coriolis matrix and 40-120 $μ$s for the Christoffel symbols on systems with 20 degrees of freedom. The results demonstrate feasibility for the adoption of these algorithms within high-rate ($>$1kHz) loops for model-based control applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑