Fast Dynamic Simulation of Highly Articulated Robots with Contact via Θ(n2) Time Dense Generalized Inertia Matrix Inversion
The generalized inertia matrix and its inverse are used extensively in robotics applications. While construction of the inertia matrix requires Θ(n 2) time, inverting it traditionally employs algorithms running in time O(n 3). We describe an algorithm that reduces the asymptotic time complexity of this operation to the theoretical minimum: Θ(n 2). We also present simple modifications that reduce the number of arithmetic operations (and thereby the running time). We compare our approach against fast Cholesky factorization both theoretically (using number of arithmetic operations) and empirically (using running times). We demonstrate our method to dynamically simulate a highly articulated robot undergoing contact, yielding an order of magnitude decrease in running time over existing methods.
KeywordsArithmetic Operation Inertia Matrix Cholesky Factorization Robot Dynamic Global Frame
Unable to display preview. Download preview PDF.
- 3.Featherstone, R.: Robot Dynamics Algorithms. Kluwer (1987)Google Scholar
- 6.Featherstone, R.: Rigid Body Dynamics Algorithms. Springer (2008)Google Scholar
- 7.Featherstone, R., Orin, D.: Robot dynamics: Equations and algorithms. In: Proc. of IEEE Intl. Conf. on Robotics and Automation, San Francisco, CA (April 2000)Google Scholar
- 9.Baraff, D.: Linear-time dynamics using lagrange multipliers. In: Proc. of Computer Graphics, New Orleans, LA (August 1996)Google Scholar
- 10.Drumwright, E., Shell, D.A.: Modeling contact friction and joint friction in dynamic robotic simulation using the principle of maximum dissipation. In: Proc. of Workshop on the Algorithmic Foundations of Robotics, WAFR (2010)Google Scholar