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.


    Access

    Download


    Export, share and cite



    Title :

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


    Contributors:

    Publication date :

    2020-12-22



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629 / 620




    Variety and connectivity in kinematic chains

    Martins, Daniel | Online Contents | 2008


    Variety and connectivity in kinematic chains

    Martins, Daniel | Online Contents | 2008


    Generation of planar kinematic chains

    Tuttle, E.R. | Online Contents | 1996