An Iterative Method for the Displacement Analysis of Spatial Mechanisms
John J. Uicker, Jacques Denavit, Richard S. Hartenberg
Abstract
John J. Uicker, Jacques Denavit, Richard S. Hartenberg
Abstract
An algebraic method for the displacement analysis of linkages has been the subject of earlier publications [1, 2]. This method, based on the use of a symbolic notation, allows the application of matrix algebra to the study of displacements in linkages, and permits formulation of all the kinematic relations of a linkage in terms of matrix equations. Based on this earlier work, the present paper develops an iterative method for the solution of the matrix equations required in displacement analysis. A complete solution is given for simple-closed linkages consisting of revolute and prismatic pairs (and their combinations). A brief indication of how higher pairs and multiple-closed chains may be handled is also given. Particularly useful in spatial problems, since it does not depend on visualization, this approach is developed in a manner intended for digital-computer operation.
OpenAlex reports 227 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An algebraic method for the displacement analysis of linkages has been the subject of earlier publications [1, 2]. This method, based on the use of a symbolic notation, allows the application of matrix algebra to the study of displacements in linkages, and permits formulation of all the kinematic relations of a linkage in terms of matrix equations. Based on this earlier work, the present paper develops an iterative method for the solution of the matrix equations required in displacement analysis. A complete solution is given for simple-closed linkages consisting of revolute and prismatic pairs (and their combinations). A brief indication of how higher pairs and multiple-closed chains may be handled is also given. Particularly useful in spatial problems, since it does not depend on visualization, this approach is developed in a manner intended for digital-computer operation.
Key concepts: Displacement (psychology), Iterative method, Computer science, Matrix (chemical analysis), Kinematics, Simple (philosophy), Algebra over a field, Algebraic number