机器人
计算机科学
二次规划
运动学
规范(哲学)
数学优化
二次方程
算法
线性规划
数学
人工智能
几何学
政治学
经典力学
物理
法学
作者
Fabrizio Flacco,Alessandro De Luca,Oussama Khatib
标识
DOI:10.1109/tro.2015.2418582
摘要
We present an efficient method for addressing online the inversion of differential task kinematics for redundant manipulators, in the presence of hard limits on joint space motion that can never be violated. The proposed Saturation in the Null Space (SNS) algorithm proceeds by successively discarding the use of joints that would exceed their motion bounds when using the minimum norm solution. When processing multiple tasks with priority, the SNS method realizes a preemptive strategy by preserving the correct order of priority in spite of the presence of saturations. In the single- and multitask case, the algorithm automatically integrates a least possible task-scaling procedure, when an original task is found to be unfeasible. The optimality properties of the SNS algorithm are analyzed by considering an associated quadratic programming problem. Its solution leads to a variant of the algorithm, which guarantees optimality even when the basic SNS algorithm does not. Numerically efficient versions of these algorithms are proposed. Their performance allows real-time control of robots executing many prioritized tasks with a large number of hard bounds. Experimental results are reported.
科研通智能强力驱动
Strongly Powered by AbleSci AI