Algorithm for computing the connectivity in planar kinematic chains and its application. (October 2021)

• Record Type: Journal Article
• Authors: Yang, Wenjian; Ding, Huafeng; Kecskemethy, Andres
• Other Names: Georgiades Fotios guest-editor.; Hedrih Andjelka guest-editor.; Atanasovska Ivana guest-editor.
• Is Part Of: Proceedings of the Institution of Mechanical Engineers. Volume 235:Number 20(2021)
• Page Start: 4988
• Page End: 4997
• Publication Date: 2021-10
• Subjects: Connectivity -- connectivity matrix -- planar kinematic chain -- creative design -- mechanism; Mechanical engineering -- Periodicals; 621.05
• DOI: 10.1177/0954406220980507
• Languages: English
• ISSNs: 0954-4062

Abstract

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.