The improved compact QP method for resolving manipulator redundancy

Abstract

The compact QP method is an effective and efficient algorithm for resolving the manipulator redundancy under inequality constraints. In this paper, a more computationally efficient scheme which will improve the efficiency of the compact QP method-the improved compact QP method -is developed. With the technique of workspace decomposition, the redundant inverse kinematics problem can be decomposed into two subproblems. Thus, the size of the redundancy problem can be reduced. For an n degree-of-freedom spatial redundant manipulator, instead of a 6/spl times/n matrix, only a 3/spl times/(n-3) matrix is needed to be manipulated by Gaussian elimination with partial pivoting for selecting the free variables. The simulation results on the CESAR manipulator indicate that the speedup of the compact QP method as compared with the original QP method is about 4.3. Furthermore, the speedup of the improved compact QP method is about 5.6. Therefore, it is believed that the improved compact QP method is one of the most efficient and effective optimization algorithm for resolving the manipulator redundancy under inequality constraints.<>