The computation of the forward dynamics plays an important role in simulating the motion of interconnected rigid bodies while considering the physical properties and constraints of each part. The applications in robotics, graphics and animation usually require fast computation, which leads to the usage of fast recursive algorithms. In this paper, we present a formulation of the recursive forward dynamics of serial kinematic chains that is rooted in geometry, which allows coordinate-free view and geometrically meaningful interpretations of the involved quantities. The mathematical framework is called conformal geometric algebra (CGA) and it extends classical vector algebra by introducting a unified representation of a large array of geometric operations, transformations and mathematical objects, such as points, lines, and planes, in a rigorous yet intuitive manner. We validate the computation numerically and provide an implementation of the results in an open-source library, making it immediately available in practice.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Recursive Forward Dynamics for Serial Kinematic Chains Using Conformal Geometric Algebra

  • Tobias Löw,
  • Sylvain Calinon

摘要

The computation of the forward dynamics plays an important role in simulating the motion of interconnected rigid bodies while considering the physical properties and constraints of each part. The applications in robotics, graphics and animation usually require fast computation, which leads to the usage of fast recursive algorithms. In this paper, we present a formulation of the recursive forward dynamics of serial kinematic chains that is rooted in geometry, which allows coordinate-free view and geometrically meaningful interpretations of the involved quantities. The mathematical framework is called conformal geometric algebra (CGA) and it extends classical vector algebra by introducting a unified representation of a large array of geometric operations, transformations and mathematical objects, such as points, lines, and planes, in a rigorous yet intuitive manner. We validate the computation numerically and provide an implementation of the results in an open-source library, making it immediately available in practice.