A novel parallel recursive Newton–Euler algorithm for modelling and computation of robot dynamics

E. Abdalla, H.J. Pu, M. Müller, A.A. Tantawy, L. Abdelatif and H. Nour Eldin

Mathematics and Computers in Simulation (MATCOM), 1994, vol. 37, issue 2, 227-240

Abstract: The recursive Newton—Euler formulation to compile or compute the robot dynamics is essential for problems of robot simulation as well as for robot inverse dynamics. Beside the established form of computation in outward (forward) and inward (backward) recursion, several schemes that exploit inherent parallelisms have been recently reported and used in distributed real time computation of robot dynamics. In this paper, the basic physical potential for such parallelism is addressed. Beside modified regrouping of such recursion, novel individual recursive equations for the Inertial, Coupling and Gravitational Dynamics of the robot are introduced.

Date: 1994
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475494900213
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:37:y:1994:i:2:p:227-240

DOI: 10.1016/0378-4754(94)90021-3

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().