ROSep 24, 2020

Virtual Forward Dynamics Models for Cartesian Robot Control

arXiv:2009.11888v111 citations
Originality Incremental advance
AI Analysis

This work addresses a specific problem in industrial robotics for improving force-resolved control in interaction tasks, representing an incremental advancement by adapting forward dynamics to a less-researched application.

The paper tackles the problem of applying forward dynamics to Cartesian robot control for industrial robots with high-gain joint-level control, proposing a virtual forward dynamics model that linearizes operational space dynamics by reducing virtual link masses relative to the end effector. The result shows that this approach outperforms the Damped Least Squares method by combining benefits of Jacobian inverse and transpose methods, as demonstrated in experiments on stability and manipulability in singular configurations.

In industrial context, admittance control represents an important scheme in programming robots for interaction tasks with their environments. Those robots usually implement high-gain disturbance rejection on joint-level and hide direct access to the actuators behind velocity or position controlled interfaces. Using wrist force-torque sensors to add compliance to these systems, force-resolved control laws must map the control signals from Cartesian space to joint motion. Although forward dynamics algorithms would perfectly fit to that task description, their application to Cartesian robot control is not well researched. This paper proposes a general concept of virtual forward dynamics models for Cartesian robot control and investigates how the forward mapping behaves in comparison to well-established alternatives. Through decreasing the virtual system's link masses in comparison to the end effector, the virtual system becomes linear in the operational space dynamics. Experiments focus on stability and manipulability, particularly in singular configurations. Our results show that through this trick, forward dynamics can combine both benefits of the Jacobian inverse and the Jacobian transpose and, in this regard, outperforms the Damped Least Squares method.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes