A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance

2015 ◽  
Vol 22 (7) ◽  
pp. 666-676 ◽  
Author(s):  
Zhexue Wei ◽  
Daming Zhu ◽  
Lusheng Wang
Author(s):  
A. Meghdari ◽  
H. Sayyaadi

Abstract An optimization technique based on the well known Dynamic Programming Algorithm is applied to the motion control trajectories and path planning of multi-jointed fingers in dextrous hand designs. A three fingered hand with each finger containing four degrees of freedom is considered for analysis. After generating the kinematics and dynamics equations of such a hand, optimum values of the joints torques and velocities are computed such that the finger-tips of the hand are moved through their prescribed trajectories with the least time or/and energy to reach the object being grasped. Finally, optimal as well as feasible solutions for the multi-jointed fingers are identified and the results are presented.


Sign in / Sign up

Export Citation Format

Share Document