1987
DOI: 10.1080/08905458708905124
|View full text |Cite
|
Sign up to set email alerts
|

A Recursive Formulation for Constrained Mechanical System Dynamics: Part I. Open Loop Systems

Abstract: A recursive formulation of the equations of motion of spatial constrained mechanical systems is derived, using tools of variational and vector calculus. Position, virtual displacement, velocity, and acceleration relations are developed, using relative coordinates between kinematically coupled bodies. Graph theoretic definition of connectivity of systems with tree structure is used to define computational sequences for formulation and solution of the equations of motion that is efficient and well suited for par… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
93
0
9

Year Published

1998
1998
2016
2016

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 252 publications
(102 citation statements)
references
References 13 publications
0
93
0
9
Order By: Relevance
“…It is worth mentioning that, in the specialized literature, this possibility has not been considered as far as we are aware; with some works commenting that solving this kind of linear problems (or related ones) is costly (but not giving further details) [19][20][21], and some other works explicitly stating that such a computation must take O(N 3 c ) [22] or O(N 2 c ) [23,24] operations. Also, in the field of robot kinematics, many O(N c ) algorithms have been devised to deal with different aspects of constrained physical systems (robots in this case) [25][26][27], but none of them tackles the calculation of the Lagrange multipliers themselves.…”
Section: Introductionmentioning
confidence: 99%
“…It is worth mentioning that, in the specialized literature, this possibility has not been considered as far as we are aware; with some works commenting that solving this kind of linear problems (or related ones) is costly (but not giving further details) [19][20][21], and some other works explicitly stating that such a computation must take O(N 3 c ) [22] or O(N 2 c ) [23,24] operations. Also, in the field of robot kinematics, many O(N c ) algorithms have been devised to deal with different aspects of constrained physical systems (robots in this case) [25][26][27], but none of them tackles the calculation of the Lagrange multipliers themselves.…”
Section: Introductionmentioning
confidence: 99%
“…It is easier to specify initial conditions for position of a system. The initial conditions for momenta p n can be calculated using (6). In order to do that, one has to assume that at the initial time-step all constraint force impulses are known to be zero (σ m = 0), and no momentum is absorbed at constrained directions (see [30] for a more detailed discussion).…”
Section: Hamilton's Canonical Equationsmentioning
confidence: 99%
“…Due to the advances in the robotics field, there has been a growing attention to the development of efficient, low order algorithms for the simulation of open-loop and closed-loop kinematic chain system dynamics [5][6][7]. It is especially worth noticing the analogies between the optimal filtering theory and robot dynamics [8] that gave foundations for various mass matrix factorizations of a manipulator.…”
Section: Introductionmentioning
confidence: 99%
“…In the article [8], a dynamic analysis method of one-DOF PUSR spatial linkage mechanism (where P means a one-DOF prismatic joint and U-a two-DOF universal joint, in fact being a composition of two rotational joints R), presented in the work [9], has been analyzed. The authors based here on the assumptions included in the works [10][11][12]. Both characterized mechanisms, in fact being a family of the spatial linkage mechanisms, contain neither redundant DOF nor passive constraints.…”
Section: Introductionmentioning
confidence: 99%