Show simple item record

A Recursive Lagrangian Formulation of Manipulator Dynamics

dc.date.accessioned2004-10-04T14:50:43Z
dc.date.accessioned2018-11-24T10:12:53Z
dc.date.available2004-10-04T14:50:43Z
dc.date.available2018-11-24T10:12:53Z
dc.date.issued1980-06-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6317
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6317
dc.description.abstractAn efficient Lagrangian formulation of manipulator dynamics has been developed. The efficiency derives from recurrence relations for the velocities, accelerations, and generalized forces. The number of additions and multiplications varies linearly with the number of joints, as opposed to past Lagrangian dynamics formulations with an n4 dependence. With 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 recent Newton-Euler formulations and tabular formulations are compared. It is concluded that recursive formulations based either on the Lagrangian or Newton-Euler dynamics offer the best method of dynamics calculation.en_US
dc.format.extent4853172 bytes
dc.format.extent3504013 bytes
dc.language.isoen_US
dc.titleA Recursive Lagrangian Formulation of Manipulator Dynamicsen_US


Files in this item

FilesSizeFormatView
AIM-533.pdf3.504Mbapplication/pdfView/Open
AIM-533.ps4.853Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record