Linear-time dynamics using Lagrange multipliers
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Robot Dynamics Algorithm
Simulating and Generating Motions of Human Figures (Springer Tracts in Advanced Robotics, V. 9)
Simulating and Generating Motions of Human Figures (Springer Tracts in Advanced Robotics, V. 9)
Efficient Factorization of the Joint-Space Inertia Matrix for Branched Kinematic Trees
International Journal of Robotics Research
| Hi-index | 0.00 |
The main focus of this paper is to investigate the essential differences among four forward dynamics algorithms: the Articulated-Body Algorithm (ABA) and Divide-and-Conquer Algorithm (DCA) by Featherstone; the Constraint Force Algorithm (CFA) by Fijany et al.; and the Assembly-Disassembly Algorithm (ADA) by the present authors. All of the algorithms have O(N) asymptotic complexity for serial computation where N is the number of rigid bodies, and three of them can also be processed in parallel which results in O (log N ) complexity on O (N) processors. We start by summarizing two essential backgrounds of the forward dynamics algorithms, i.e. articulated-body inertias and joint constraint representation. We then present a new formulation of ADA as well as the outlines of the other three algorithms using the same notation. Finally, we perform qualitative as well as quantitative comparisons of the algorithms using our implementations of ABA, CFA, and ADA.