Fast dynamic simulation of highly articulated robots with contact via Θ(n2) time dense generalized inertia matrix inversion

Authors:
Evan Drumwright
Affiliations:
The George Washington University, Washington, D.C.
Venue:
SIMPAR'12 Proceedings of the Third international conference on Simulation, Modeling, and Programming for Autonomous Robots
Year:
2012

Citing 4
Cited 0

Linear-time dynamics using Lagrange multipliers

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Robot Dynamics Algorithm

Robot Dynamics Algorithm
Efficient Factorization of the Joint-Space Inertia Matrix for Branched Kinematic Trees

International Journal of Robotics Research
Rigid Body Dynamics Algorithms

Rigid Body Dynamics Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized inertia matrix and its inverse are used extensively in robotics applications. While construction of the inertia matrix requires Θ(n2) time, inverting it traditionally employs algorithms running in time O(n3). We describe an algorithm that reduces the asymptotic time complexity of this operation to the theoretical minimum: Θ(n2). 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.