System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

The improved compact QP method for resolving manipulator redundancy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Fan-Tien Cheng ; Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan ; Rong-Jing Sheu ; Tsing-Hua Chen

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 BP method-is developed. With the technique of work space 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×n matrix, only a 3×(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 3.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

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:25 ,  Issue: 11 )