A nonlinear vehicle-structure interaction methodology with wheel-rail detachment and reattachment

. A vehicle-structure interaction methodology with a nonlinear contact formulation based on contact and target elements has been developed. To solve the dynamic equations of motion, an incremental formulation has been used due to the nonlinear nature of the contact mechanics, while a procedure based on the Lagrange multiplier method imposes the contact constraint equations when contact occurs. The system of nonlinear equations is solved by an efficient block factorization solver that reorders the system matrix and isolates the nonlinear terms that belong to the contact elements or to other nonlinear elements that may be incorporated in the model. Such procedure avoids multiple unnecessary factorizations of the linear terms during each Newton iteration, making the formulation efficient and computationally attractive. A numerical example has been carried out to validate the accuracy and efficiency of the present methodology. The obtained results have shown a good agreement with the results obtained with the commercial finite element software ANSY

On the constraints violation in forward dynamics of multibody systems

It is known that the dynamic equations of motion for constrained mechanical multibody systems are frequently formulated using the Newton-Euler’s approach, which is augmented with the acceleration constraint equations. This formulation results in the establishment of a mixed set of partial differential and algebraic equations, which are solved in order to predict the dynamic behavior of general multibody systems. The classical resolution of the equations of motion is highly prone to constraints violation because the position and velocity constraint equations are not fulfilled. In this work, a general and comprehensive methodology to eliminate the constraints violation at the position and velocity levels is offered. The basic idea of the described approach is to add corrective terms to the position and velocity vectors with the intent to satisfy the corresponding kinematic constraint equations. These corrective terms are evaluated as function of the Moore-Penrose generalized inverse of the Jacobian matrix and of the kinematic constraint equations. The described methodology is embedded in the standard method to solve the equations of motion based on the technique of Lagrange multipliers. Finally, the effectiveness of the described methodology is demonstrated through the dynamic modeling and simulation of different planar and spatial multibody systems. The outcomes in terms of constraints violation at the position and velocity levels, conservation of the total energy and computational efficiency are analyzed and compared with those obtained with the standard Lagrange multipliers method, the Baumgarte stabilization method, the augmented Lagrangian formulation, the index-1 augmented Lagrangian and the coordinate partitioning method.The first author expresses his gratitude to the Portuguese Foundation for Science and Technology through the PhD grant (PD/BD/114154/2016). This work has been supported by the Portuguese Foundation for Science and Technology with the reference project UID/EEA/04436/2013, by FEDER funds through the COMPETE 2020 – Programa Operacional Competitividade e Internacionalização (POCI) with the reference project POCI-01-0145-FEDER-006941.info:eu-repo/semantics/publishedVersio

Computation Reuse in Statics and Dynamics Problems for Assemblies of Rigid Bodies

The problem of determining the forces among contacting rigid bodies is fundamental to many areas of robotics, including manipulation planning, control, and dynamic simulation. For example, consider the question of how to unstack an assembly, or how to find stable regions of a rubble pile. In considering problems of this type over discrete or continuous time, we often encounter a sequence of problems with similar substructure. The primary contribution of our work is the observation that in many cases, common physical structure can be exploited to solve a sequence of related problems more efficiently than if each problem were considered in isolation. We examine three general problems concerning rigid-body assemblies: dynamic simulation, assembly planning, and assembly stability given limited knowledge of the structure\u27s geometry. To approach the dynamic simulation and assembly planning applications, we have optimized a known method for solving the system dynamics. The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem. Dantzig\u27s algorithm, when applicable, takes n or fewer major cycles to find a solution to the linear complementarity problem corresponding to an assembly with n contacts. We show that Dantzig\u27s algorithm will find a solution in n - k or fewer major cycles if the algorithm is initialized with a solution to the dynamics problem for a subassembly with k internal contacts. Finally, we show that if we have limited knowledge of a structure\u27s geometry, we can still learn about stable regions of its surface by physically pressing on it. We present an approach for finding stable regions of planar assemblies: sample presses on the surface to identify a stable cone in wrench space, partition the space of applicable wrenches into stable and unstable regions, and map these back to the surface of the structure

Comparison and Coupling of Algorithms for Collisions, contact and friction in rigid multi-body simulations.

International audienceNumerous works in computational mechanics are dedicated to multi-body systems. This leads to the use of various methods to simulate the static or dynamic evolution of complex systems. The case of dense multi-contact assemblies is one of the more complex one: the problem have often a large number of unknown and have a infinity of solution due to the definition of the matrix of the system. Moreover this problem become harder when friction or more complex laws are introduced in the system. Thus we need fast and robust solvers to perform mechanical studies. These performances can be increased when the special problem structure is considered (sparse matrices, block structured problem). Our work is based on the Non Smooth Contact Dynamic framework introduced by Moreau. The method uses a time-stepping integrator without explicit event-handling procedure and an unilateral contact impact formulation associated to Coulomb's friction. In this paper we use and compare different iterative algorithms such as Gauss-Seidel, projected conjugate gradient and direct ones as Lemke and Quadratic programming solvers. The efficiency of the methods is compared in terms of complexity, convergence criterion and of CPU time. To illustrate the results, we focus on granular assemblies. 3D frictional contact simulations are performed with ConF&TiS and the Numerics library of the siconos project

Differential-Algebraic Equations and Beyond: From Smooth to Nonsmooth Constrained Dynamical Systems

The present article presents a summarizing view at differential-algebraic equations (DAEs) and analyzes how new application fields and corresponding mathematical models lead to innovations both in theory and in numerical analysis for this problem class. Recent numerical methods for nonsmooth dynamical systems subject to unilateral contact and friction illustrate the topicality of this development.Comment: Preprint of Book Chapte

High Performance Algorithms and Implementations Using Sparse and Parallelization Techniques on MBS

In this paper we will see how the efficiency of the MBS simulations can be improved in two different ways, by considering both an explicit and implicit semi-recursive formulation. The explicit method is based on a double velocity transformation that involves the solution of a redundant but compatible system of equations. The high computational cost of this operation has been drastically reduced by taking into account the sparsity pattern of the system. Regarding this, the goal of this method is the introduction of MA48, a high performance mathematical library provided by Harwell Subroutine Library. The second method proposed in this paper has the particularity that, depending on the case, between 70 and 85% of the computation time is devoted to the evaluation of forces derivatives with respect to the relative position and velocity vectors. Keeping in mind that evaluating these derivatives can be decomposed into concurrent tasks, the main goal of this paper lies on a successful and straightforward parallel implementation that have led to a substantial improvement with a speedup of 3.2 by keeping all the cores busy in a quad-core processor and distributing the workload between them, achieving on this way a huge time reduction by doing an ideal CPU usag