Symbolically efficient formulations for computational robot dynamics
Charles P. Neuman, J. Murray
- Year
- 1987
- Citations
- 31
Abstract
Abstract In 1983, the authors implemented the computer program Algebraic Robot Modeler (ARM) to generate symbolically complete closed‐form and recursive dynamic robot models. 1–4 Then, in 1985, we incorporated in ARM heuristic rules for the systematic organization of dynamic robot models to reduce the computational requirements of customized forward and inverse dynamics calculations. We compare the symbolic efficiencies of six robot dynamics formulations for generating closed‐form and recursive models. We find that our Lagrange‐Christoffel formulation is the most symbolically efficient generator of closed‐form dynamic robot models. In our companion paper, 3 we resolve the issue of numerical efficiency of customized closed‐form and recursive algorithms for computing the forward and inverse dynamics of kinematically and dynamically structured manipulators.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002