Faster motion on Cartesian paths exploiting robot redundancy at the acceleration level

Khaled Al Khudir, Alessandro De Luca

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Abstract

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 parametrized joint path. In this framework, multiple sub-optimal 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.
Original languageEnglish
Pages (from-to)3553-3560
Number of pages8
Journal IEEE Robotics and Automation Letters
Volume3
Issue number4
DOIs
Publication statusPublished - 9 Jul 2018
Externally publishedYes

Keywords

  • Robotics
  • Optimal control
  • optimisation
  • Dynamic
  • motion control

Fingerprint

Dive into the research topics of 'Faster motion on Cartesian paths exploiting robot redundancy at the acceleration level'. Together they form a unique fingerprint.

Cite this