Algorithm for computing the connectivity in planar kinematic chains and its application

Affiliation
Institute of Mechatronics and System Dynamics, University of Duisburg-Essen, Duisburg, Germany
Yang, Wenjian;
Affiliation
School of Mechanical Engineering and Electronic Information, China University of Geosciences, Wuhan, China
Ding, Huafeng;
GND
172572533
ORCID
0000-0002-2044-7892
LSF
2821
Affiliation
Institute of Mechatronics and System Dynamics, University of Duisburg-Essen, Duisburg, Germany
Kecskeméthy, Andrés

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.

Cite

Citation style:
Could not load citation form.

Rights

License Holder:

© IMechE 2020

Use and reproduction:
All rights reserved