The problem of minimizing the transfer time along a given Cartesian path for redundant robots can be approached in two steps, by separating the generation of a joint path associated to the Cartesian path from the exact minimization of motion time under kinematic/dynamic bounds along the obtained parameterized joint path. In this framework, multiple suboptimal solutions can be found, depending on how redundancy is locally resolved in the joint space within the first step. We propose a solution method that works at the acceleration level, by using weighted pseudoinversion, optimizing an inertia-related criterion, and including null-space damping. Several numerical results obtained on different robot systems demonstrate consistently good behaviors and definitely faster motion times in comparison with related methods proposed in the literature. The motion time obtained with our method is reasonably close to the global time-optimal solution along same Cartesian path. Experimental results on a KUKA LWR IV are also reported, showing the tracking control performance on the executed motions.


    Access

    Download


    Export, share and cite



    Title :

    Faster Motion on Cartesian Paths Exploiting Robot Redundancy at the Acceleration Level



    Publication date :

    2018-01-01



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Redundancy resolution in human-robot co-manipulation with cartesian impedance control

    FICUCIELLO, FANNY / VILLANI, LUIGI / SICILIANO, BRUNO | BASE | 2016

    Free access

    Motion redundancy robot climbing mechanism

    YE WEI / HUO TONGWANG / CHEN QIAOHONG et al. | European Patent Office | 2024

    Free access

    Cartesian Motion Control of a Mobile Robot

    Horn, J. / IEEE; Industrial Electronics Society | British Library Conference Proceedings | 1994


    Exploiting spatial-redundancy of image sensor for motion robust rPPG

    Wang, W. / Stuijk, S. / Haan, de, G. | BASE | 2015

    Free access