.png){kind=icon}
.png){kind=icon}
Return
Comparative Study on Serial and Parallel Forward Dynamics Algorithms for Kinematic Chains
.png){kind=icon}
PRE
AI
DOI：10.1177/0278364909102350.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
dynamics simulation
parallel computation
articulated-body inertia
complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
2.4K
Citations:
1.5W