This paper provides a method for computing force-feasible paths on the Stewart platform. Given two configurations of the platform, the method attempts to connect them through a path that, at any point, allows the platform to counteract any external wrench lying inside a predefined six-dimensional region. In particular, the Jacobian matrix of the manipulator will be full rank along such path, so that the path will not traverse the forward singularity locus at any point. The path is computed by first characterizing the force-feasible C-space of the manipulator as the solution set of a system of equations, and then using a higher-dimensional continuation technique to explore this set systematically from one configuration, until the second configuration is found. Examples are included that demonstrate the performance of the method on illustrative situations. ; Preprint


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Planning singularity-free force-feasible paths on the Stewart platform

    Bohigas, Oriol / Manubens, Montserrat / Ros, Lluís | BASE | 2012

    Freier Zugriff


    Planning singularity-free paths on closed-chain manipulators

    Bohigas Nadal, Oriol / Henderson, Michael E. / Ros Giralt, Lluís et al. | BASE | 2013

    Freier Zugriff

    Planning singularity-free paths on closed-chain manipulators

    Bohigas, Oriol / Henderson, M. E. / Ros, Lluís et al. | BASE | 2013

    Freier Zugriff