By Topic

A Recursive Lagrangian Formulation of Maniputator Dynamics and a Comparative Study of Dynamics Formulation Complexity

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

1 Author(s)

An efficent Lagangian formulation of manipulator dynamics has been developed. The efficiency derives from recurrence relatons for the velocities, accelerations, and generalized forces. The number of additons and multiplicatins varies linearly with the number of joint, as opposed to past Lagrangian dynamics formulations with an n4 dependence. Wih this formulation it should be possible in principle to compute the Lagrangian dynamics in real time. The computational complexities of this and other dynamics formulations including rect Newton-Euler formulations and tabular formulations are compared. It Is concluded that recursive formultions based either on the Lagrangian or Newton-Euler dynamics offer the best method of dynamns calculation.

Published in:

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