Reordering and partitioning Jacobian matrices using graph-spectral method

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An efficient spectral method is developed for reducing the Jacobian matrix to its block-triangular form in order to solve the inverse kinematics problem. Based on the kinematic structure matrix, the problem of reducing the Jacobian matrix to block-triangular form is transformed into reducing the bandwidth of the matrix. The second Laplacian eigenvector, associated with the bigraph of the structure matrix of the inverse Jacobian, is used to renumber the rows and columns of the Jacobian. The rearranged Jacobian can be divided into subsystems immediately according to the entry value of the Fiedler vector. This algorithm is applied in detail to kinematic analysis for a PUMA robot and T3 robot. Because of the algebraic nature of spectral algorithm, the algorithm can be implemented in a fairly straightforward manner. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, X., & Hu, Y. (2009). Reordering and partitioning Jacobian matrices using graph-spectral method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5928 LNAI, pp. 696–705). https://doi.org/10.1007/978-3-642-10817-4_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free