A General Framework for Hierarchical Redundancy Resolution Under Arbitrary Constraints
release_fvdvjbd7s5gqtfz5njakf7t7he
by
Mario D. Fiore, Gaetano Meli, Anton Ziese, Bruno Siciliano, Ciro Natale
2022
Abstract
The increasing interest in autonomous robots with a high number of degrees of
freedom for industrial applications and service robotics demands control
algorithms to handle multiple tasks as well as hard constraints efficiently.
This paper presents a general framework in which both kinematic (velocity- or
acceleration-based) and dynamic (torque-based) control of redundant robots are
handled in a unified fashion. The framework allows for the specification of
redundancy resolution problems featuring a hierarchy of arbitrary (equality and
inequality) constraints, arbitrary weighting of the control effort in the cost
function and an additional input used to optimize possibly remaining
redundancy. To solve such problems, a generalization of the Saturation in the
Null Space (SNS) algorithm is introduced, which extends the original method
according to the features required by our general control framework. Variants
of the developed algorithm are presented, which ensure both efficient
computation and optimality of the solution. Experiments on a KUKA LBRiiwa
robotic arm, as well as simulations with a highly redundant mobile manipulator
are reported.
In text/plain
format
Archived Files and Locations
application/pdf 9.1 MB
file_oubhiuarwnamtjnhpzqxwbb62a
|
arxiv.org (repository) web.archive.org (webarchive) |
2204.03974v1
access all versions, variants, and formats of this works (eg, pre-prints)