Trabajo presentado en el IFToMM World Congress on Mechanism and Machine Science, celebrado en Cracovia (Polonia), del 15 al 18 de julio de 2019 ; Different branch-and-prune schemes can be found in the literature for numerically solving the position analysis of spherical mechanisms. For the prune operation, they all rely on the propagation of motion intervals. They differ in the way the problem is algebraically formulated. This paper exploits the fact that spherical kinematic loop equations can be formulated as sets of 3 multi-affine polynomials. Multi-affinity has an important impact on how the propagation of motion intervals can be performed because a multi-affine polynomial is uniquely determined by its values at the vertices of a closed hyperbox defined in its domain. ; This research has been partially funded under the project DPI2017-88282-P (AEI/FEDER, UE)


    Access

    Download


    Export, share and cite



    Title :

    A fast branch-and-prune algorithm for the position analysis of spherical mechanisms



    Publication date :

    2019-01-01



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    A branch-and-prune algorithm for solving systems of distance constraints

    Porta, Josep M. / Thomas, Federico / Ros, Lluís et al. | BASE | 2003

    Free access

    A branch-and-prune solver for distance constraints

    Porta, Josep M. / Ros, Lluís / Thomas, Federico et al. | BASE | 2005

    Free access

    Fast spherical search algorithm

    Liebe, Carl Christian | NTRS | 2004


    Fast spherical search algorithm

    Liebe, C.C. | IEEE | 2004


    7.1305 Fast Spherical Search Algorithm

    IEEE | British Library Conference Proceedings | 2004