A State-Time Formulation for Multibody Systems Dynamics Simulation: Part I — Extension to Systems With General Topology

Author(s):  
Mojtaba Oghbaei ◽  
Kurt S. Anderson

This paper presents an extension of a newly developed multibody system dynamics formulation to systems with general topology. The State-Time dynamic formulation, which has been recently developed by the authors, provides the means to yield significantly reduced simulation turnaround time through its ability to better exploit massively parallel computing resources. The rules provided in this article are useful in automating the generation of system’s equations of motion and in determining the final form of the system tangent matrix arising in this formulation. A priori knowledge of this structure assists one to find a proper ordering for the rows and columns of this matrix such that the final structure is optimized from data storage and solution expense perspectives. Also, the extended formulation enables one to eliminate the constraint forces or to bring only the desirable ones into evidence and as such results in a reduced set of equations and unknowns. Examples are provided to demonstrate application of the given rules.

Author(s):  
Mojtaba Oghbaei ◽  
Kurt S. Anderson ◽  
John A. Evans

This paper outlines the parallel implementation of a newly developed multibody system dynamics formulation. The methodology provides the means for the dynamic simulation to be parallelized temporally as well as spatially which will allow better exploitation of anticipated massively parallel computing resources. This will have three advantages: First, the system of equations may now be coarse grain parallelized to a far greater degree allowing an increased number of processors to be effectively utilized. Secondly, this will significantly reduce the fraction of serial operations and thus should increase speedup (reduced turn-around). Finally, the method allows temporal scale of each variable to be adjusted independently and as such offer considerable advantage for the efficient and accurate modeling and simulation of multiscale behaviors. These gains can be accomplished by discretizing a special form of the equations of motion in both temporal and spatial domains. Examples are provided to clarify the application of this scheme with particular attention on time domain parallelization.


Author(s):  
Kishor D. Bhalerao ◽  
Mohammad Poursina ◽  
Kurt S. Anderson

This paper presents a recursive direct differentiation method for sensitivity analysis of flexible multibody systems. Large rotations and translations in the system are modeled as rigid body degrees of freedom while the deformation field within each body is approximated by superposition of modal shape functions. The equations of motion for the flexible members are differentiated at body level and the sensitivity information is generated via a recursive divide and conquer scheme. The number of differentiations required in this method is minimal. The method works concurrently with the forward dynamics simulation of the system and requires minimum data storage. The use of divide and conquer framework makes the method linear and logarithmic in complexity for serial and parallel implementation, respectively, and ideally suited for general topologies. The method is applied to a flexible two arm robotic manipulator to calculate sensitivity information and the results are compared with the finite difference approach.


2006 ◽  
Vol 2 (1) ◽  
pp. 10-21 ◽  
Author(s):  
Rudranarayan M. Mukherjee ◽  
Kurt S. Anderson

This paper presents an efficient algorithm for the dynamics simulation and analysis of multi-flexible-body systems. This algorithm formulates and solves the nonlinear equations of motion for mechanical systems with interconnected flexible bodies subject to the limitations of modal superposition, and body substructuring, with arbitrarily large rotations and translations. The large rotations or translations are modelled as rigid body degrees of freedom associated with the interconnecting kinematic joint degrees of freedom. The elastic deformation of the component bodies is modelled through the use of modal coordinates and associated admissible shape functions. Apart from the approximation associated with the elastic deformations, this algorithm is exact, non-iterative, and applicable to generalized multi-flexible chain and tree topologies. In its basic form, the algorithm is both time and processor optimal in its treatment of the nb joint variables, providing O(log(nb)) turnaround time per temporal integration step, achieved with O(nb) processors. The actual cost associated with the parallel treatment of the nf flexible degrees of freedom depends on the specific parallel method chosen for dealing with the individual coefficient matrices which are associated locally with each flexible body.


2020 ◽  
Vol 1 (1) ◽  
pp. 93-102
Author(s):  
Carsten Strzalka ◽  
◽  
Manfred Zehn ◽  

For the analysis of structural components, the finite element method (FEM) has become the most widely applied tool for numerical stress- and subsequent durability analyses. In industrial application advanced FE-models result in high numbers of degrees of freedom, making dynamic analyses time-consuming and expensive. As detailed finite element models are necessary for accurate stress results, the resulting data and connected numerical effort from dynamic stress analysis can be high. For the reduction of that effort, sophisticated methods have been developed to limit numerical calculations and processing of data to only small fractions of the global model. Therefore, detailed knowledge of the position of a component’s highly stressed areas is of great advantage for any present or subsequent analysis steps. In this paper an efficient method for the a priori detection of highly stressed areas of force-excited components is presented, based on modal stress superposition. As the component’s dynamic response and corresponding stress is always a function of its excitation, special attention is paid to the influence of the loading position. Based on the frequency domain solution of the modally decoupled equations of motion, a coefficient for a priori weighted superposition of modal von Mises stress fields is developed and validated on a simply supported cantilever beam structure with variable loading positions. The proposed approach is then applied to a simplified industrial model of a twist beam rear axle.


2016 ◽  
Vol 842 ◽  
pp. 251-258 ◽  
Author(s):  
Muhammad Rafi Hadytama ◽  
Rianto A. Sasongko

This paper presents the flight dynamics simulation and analysis of a tilt-rotor vertical takeoff and landing (VTOL) aircraft on transition phase, that is conversion from vertical or hover to horizontal or level flight and vice versa. The model of the aircraft is derived from simplified equations of motion comprising the forces and moments working on the aircraft in the airplane's longitudinal plane of motion. This study focuses on the problem of the airplane's dynamic response during conversion phase, which gives an understanding about the flight characteristics of the vehicle. The understanding about the flight dynamics characteristics is important for the control system design phase. Some simulation results are given to provide better visualization about the behaviour of the tilt-rotor. The simulation results show that both transition phases are quite stable, although an improved stability can give better manoeuver and attitude handling. Improvement on the simulation model is also required to provide more accurate and realistic dynamic response of the vehicle.


Author(s):  
Shanzhong Duan ◽  
Kurt S. Anderson

Abstract The paper presents a new hybrid parallelizable low order algorithm for modeling the dynamic behavior of multi-rigid-body chain systems. The method is based on cutting certain system interbody joints so that largely independent multibody subchain systems are formed. These subchains interact with one another through associated unknown constraint forces f¯c at the cut joints. The increased parallelism is obtainable through cutting the joints and the explicit determination of associated constraint loads combined with a sequential O(n) procedure. In other words, sequential O(n) procedures are performed to form and solve equations of motion within subchains and parallel strategies are used to form and solve constraint equations between subchains in parallel. The algorithm can easily accommodate the available number of processors while maintaining high efficiency. An O[(n+m)Np+m(1+γ)Np+mγlog2Np](0<γ<1) performance will be achieved with Np processors for a chain system with n degrees of freedom and m constraints due to cutting of interbody joints.


2021 ◽  
Author(s):  
Friedrich Pfeiffer

Abstract Constraints in multibody systems are usually treated by a Lagrange I - method resulting in equations of motion together with the constraint forces. Going from non-minimal coordinates to minimal ones opens the possibility to project the original equations directly to the minimal ones, thus eliminating the constraint forces. The necessary procedure is described, a general example of combined machine-process dynamics discussed and a specific example given. For a n-link robot tracking a path the equations of motion are projected onto this path resulting in quadratic form linear differential equations. They define the space of allowed motion, which is generated by a polygon-system.


Author(s):  
Hazem A. Attia ◽  
Maher G. Mohamed

Abstract In this paper, the dynamic modelling of a planar three degree-of-freedom platform-type manipulator is presented. A kinematic analysis is carried out initially to evaluate the initial coordinates and velocities. The dynamic model of the manipulator is formulated using a two-step transformation. Initially, the dynamic formulation is written in terms of the Cartesian coordinates of a dynamically equivalent system of particles. Since there is no rotational motion associated with a particle, then the differential equations of motion are derived by applying Newton’s second law to study the translational motion of the particles. The constraint forces between the particles are expressed in terms of Lagrange multipliers. Then, the differential equations of motion are written in terms of the relative joint variables. This leads to an efficient solution and integration of the equations of motion. A numerical example is presented and a computer program is developed.


Author(s):  
Hazem Ali Attia ◽  
Tarek M. A. El-Mistikawy ◽  
Adel A. Megahed

Abstract In this paper the dynamic analysis of RRPR robot manipulator is presented. The equations of motion are formulated using a two-step transformation. Initially, a dynamically equivalent system of particles that replaces the rigid bodies is constructed and then Newton’s second law is applied to derive their equations of motion. The equations of motion are then transformed to the relative joint variables. Use of both Cartesian and joint variables produces an efficient set of equations without loss of generality. For open chains, this process automatically eliminates all of the non-working constraint forces and leads to an efficient solution and integration of the equations of motion. The results of the simulation indicate the simplicity and generality of the dynamic formulation.


Author(s):  
Michael J. Sadowski ◽  
Kurt S. Anderson

This paper presents an algorithm for the efficient numerical analysis and simulation of a category of contact/impact problems in multi-rigid-body dynamic systems with tree topologies. The algorithm can accommodate the jumps in structure which occur in the equations of motion of general multi-rigid-body systems due to a contact/impact event between bodies, or due to the locking of joints as long as the resulting system is a tree topology. The presented method uses a generalized momentum balance approach to determine the velocity jumps which take place across impacts in such multibody dynamic systems where event constraint forces are of the “non-working” category. The presented method does not suffer from the performance (speed) penalty encountered by most other momentum balance methods given its O(n) overall cost, and exact direct embedded consideration of all the constraints. Due to these characteristics, the presented algorithm offers superior computing performance relative to other methods in situations involving both large n and potentially many unilateral constraints.


Sign in / Sign up

Export Citation Format

Share Document