Application of a dynamic programming algorithm for trajectory planning of finger‐like manipulators

Dextrous hand designs require planning and coordination of multijointed fingers. This communication presents a dynamic programming algorithm to optimize the trajectory of a finger or a fingerlike manipulator. The algorithm generates a minimum cost trajectory for a specified cost function (such as accuracy or time of travel) and a set of constraints (such as obstacles along the trajectory). We present simulations demonstrating the trajectory planning for simplified fingerlike manipulator configurations. This approach is potentially applicable to several additional situations faced by multijointed fingers employed in dextrous hand designs, such as complex trajectory planning, obstacle avoidance, and fault tolerance. We illustrate some results obtained by computer simulations of these problems.