By Topic

Application of dynamic programming to robot kinematics

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
$33 $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

2 Author(s)
N. Thakor ; Johns Hopkins University ; M. McNeela

This paper presents a dynamic programming (DP) algorithm to calculate robot manipulator kinematics and plan optimized trajectories. The algorithm optimizes desireable cost functions such as absolute accuracy or time of travel. We show that, when necessary, we can accept sub-optimal (higher cost) alternative to our advantage. For example, if an optimal trajectory is blocked by an obstacle, the robot can reach the destination by following a sub-optimal path. We present computer simulations of many diverse applications of DP to robot kinematic problems. DP algorithm requires more computations than conventional techniques, but permits optimization of objective criteria and flexibility in path planning.

Published in:

Robotics and Automation. Proceedings. 1986 IEEE International Conference on  (Volume:3 )

Date of Conference:

Apr 1986