2017
DOI: 10.1109/tro.2017.2654507
|View full text |Cite
|
Sign up to set email alerts
|

A Parallel Recursive Hamiltonian Algorithm for Forward Dynamics of Serial Kinematic Chains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(22 citation statements)
references
References 43 publications
0
22
0
Order By: Relevance
“…This, unfortunately, leads to a situation where the term T δ | |t f doesn't vanish when explicit dependency of h on reaction forces appears. We can, however, overcome this problem by adding variation of Equation (2) to the cost functional (26) and an auxiliary adjoint variable evaluated at time t = t f . Equation (2) can be rewritten as:…”
Section: The Adjoint Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This, unfortunately, leads to a situation where the term T δ | |t f doesn't vanish when explicit dependency of h on reaction forces appears. We can, however, overcome this problem by adding variation of Equation (2) to the cost functional (26) and an auxiliary adjoint variable evaluated at time t = t f . Equation (2) can be rewritten as:…”
Section: The Adjoint Methodsmentioning
confidence: 99%
“…Multiple representations of equations of motion may be employed to model a MBS. Recent works of the authors [25][26][27] have demonstrated that by using a constrained Hamilton's canonical equations, in which Lagrange multipliers enforce constraint equations at the velocity level, one can obtain more stable solutions for DAEs as compared to acceleration-based counterparts. 28,29 This phenomenon is partially connected with differential index reduction of the resultant Hamilton's equations.…”
Section: Introductionmentioning
confidence: 99%
“…The Articulated Body Algorithm (ABA) [15] was combined with the DCA in [6] to deliver significant speedups in computation times. Hamilton's canonical equations were used in [7,8] and showed good properties regarding the satisfaction of kinematic constraints. Augmented Lagrangian methods with configurationand velocity-level mass-orthogonal projections have also been employed [28]; the resulting algorithm has been proven to behave robustly during the simulation of mechanical systems with redundant constraints and singular configurations.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, the height of an upper part of such tree should be minimized and the lower part of the tree should be designed in a way to distribute the computational load as evenly as possible over the available processing units. Therefore, the real problem is to design a good assembly-disassembly tree for a given mechanism so that the tree could be efficiently mapped onto the architecture of a given parallel resource, either it is a shared memory computer (as in this paper) or it is a graphics processor unit (as analyzed in [8]). The specifics of the binary tree creation for various multibody system topologies can found in other references [6,16,28,33].…”
Section: Parallel Implementationmentioning
confidence: 99%
“…In previous papers [33,34], the authors proposed a Hamiltonian based divide-andconquer algorithm (HDCA) for open-loop multi-rigid body dynamics. In this paper, the HDCA algorithm is significantly extended and generalized to deal with systems possessing closed-loop and coupled-loops topologies.…”
Section: Introductionmentioning
confidence: 99%