Efficient Factorization of the Joint-Space Inertia Matrix for Branched Kinematic Trees
This paper describes new factorization algorithms that exploit branch-induced sparsity in the joint-space inertia matrix (JSIM) of a kinematic tree. It also presents new formulae that show how the cost of calculating and factorizing the JSIM vary with the topology of the tree. These formulae show that the cost of calculating for-ward dynamics for a branched tree can be considerably less than the cost for an unbranched tree of the same site. Branches can also reduce complexity; some examples are...[Show more]
|Collections||ANU Research Publications|
|Source:||International Journal of Robotics Research|
|01_Featherstone_Efficient_Factorization_of_the_2005.pdf||256.68 kB||Adobe PDF||Request a copy|
|02_Featherstone_Efficient_Factorization_of_the_2005.pdf||225.75 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.