The number of synthesized kinematic chains usually is too large to evaluate individual characteristics of each chain. The concept of connectivity is useful to classify the kinematic chains. In this paper, an algorithm is developed to automatically compute the connectivity matrix in planar kinematic chains. The main work is to compute two intermediate parameters, namely the minimum mobility matrix and the minimum distance matrix. The algorithm is capable of dealing with both simple-jointed and multiple-jointed kinematic chains. The present work can be used to automatically determine kinematic chains satisfying the required connectivity constraint, and is helpful for the creative design of mechanisms. The practical application is illustrated by taking the face-shovel hydraulic excavator for instance.
Algorithm for computing the connectivity in planar kinematic chains and its application
2020-12-22
Article (Journal)
Electronic Resource
English
An automatic method for the connectivity calculation in planar closed kinematic chains
Online Contents | 2017
|Variety and connectivity in kinematic chains
Online Contents | 2008
|Variety and connectivity in kinematic chains
Online Contents | 2008
|Generation of planar kinematic chains
Online Contents | 1996
|Parallelism in planar kinematic chains (manipulators)
Online Contents | 2004
|