An asynchronous, variational method for simulating elastica in complex contact and impact scenarios is developed. Asynchronous Variational Integrators [1] (AVIs) are extended to handle contact forces by associating dierent time steps to forces instead of to spatial elements. By discretizing a barrier potential by an innite sum of nested quadratic potentials, these extended AVIs are used to resolve contact while obeying momentum- and energy-conservation laws. A series of two- and three-dimensional examples illustrate the robustness and good energy behavior of the method.
Several authors have explored a structure-preserving approach to solving the contact problem. Barth al @cite_20 consider an adaptive-step-size algorithm that preserves the time-reversible symmetry of the RATTLE algorithm, and demonstrate an application to an elastic rod interacting with a Lennard-Jones potential. Kane al @cite_35 show that the Newmark method, for all parameters, is variational, and construct two two-step dissipative integrators that yield good energy decay. Laursen and Love @cite_24 , by taking into account velocity discontinuities that occur at contact interfaces, develop a momentum- and energy-preserving method for simulating frictionless contact. This paper shares with these last approaches the viewpoint that structured integration, with its associated conservation guarantees, is an invaluable tool for accurately simulating dynamic systems with contact.
@cite_24 @cite_35 @cite_20
2099876657 2067309337 2075921599 2477962321
We propose a new explicit contact algorithm for finite element discretized solids and shells with smooth and non-smooth geometries. The equations of motion are integrated in time with a predictor-corrector-type algorithm. After each predictor step, the impenetrability constraints and the exchange of momenta between the impacting bodies are considered and enforced independently. The geometrically inadmissible penetrations are removed using closest point projections or similar updates. Penetration is measured using the signed volume of intersection described by the contacting surface elements, which is well-defined for both smooth and non-smooth geometries. For computing the instantaneous velocity changes that occur during the impact event, we introduce the decomposition contact response method. This enables the closed-form solution of the jump equations at impact, and applies to non-frictional as well as frictional contact, as exemplified by the Coulomb frictional model. The overall algorithm has excellent momentum and energy conservation characteristics, as several numerical examples demonstrate. Copyright © 2005 John Wiley & Sons, Ltd. The value of energy and momentum conserving algorithms has been well established for the analysis of highly non-linear systems, including those characterized by the nonsmooth non-linearities of an impact event. This work proposes an improved integration scheme for frictionless dynamic contact, seeking to preserve the stability properties of exact energy and momentum conservation without the heretofore unavoidable compromise of violating geometric admissibility as established by the contact constraints. The physically motivated introduction of a discrete contact velocity provides an algorithmic framework that ensures exact conservation locally while remaining independent of the choice of constraint treatment, thus making full conservation equally possible in conjunction with a penalty regularization as with an exact Lagrange multiplier enforcement. The discrete velocity effects are incorporated as a post-convergence update to the system velocities, and thus have no direct effect on the non-linear solution of the displacement equilibrium equation. The result is a robust implicit algorithmic treatment of dynamic frictionless impact, appropriate for large deformations and fully conservative for a range of geometric constraints. Copyright © 2001 John Wiley & Sons, Ltd. The present work extends the non-smooth contact class of algorithms introduced by to the case of friction. The formulation specifically addresses contact geometries, e.g. involving multiple collisions between tightly packed non-smooth bodies, for which neither normals nor gap functions can be properly defined. A key aspect of the approach is that the incremental displacements follow from a minimum principle. The objective function comprises terms which account for inertia, strain energy, contact, friction and external forcing. The Euler–Lagrange equations corresponding to this extended variational principle are shown to be consistent with the equations of motion of solids in frictional contact. In addition to its value as a basis for formulating numerical algorithms, the variational framework offers theoretical advantages as regards the selection of trajectories in cases of non-uniqueness. We present numerical and analytical examples which demonstrate the good momentum and energy conservation characteristics of the numerical algorithms, as well as the ability of the approach to account for stick and slip conditions. We present a multi-contact walking pattern generator based on preview-control of the 3D acceleration of the center of mass (COM). A key point in the design of our algorithm is the calculation of contact-stability constraints. Thanks to a mathematical observation on the algebraic nature of the frictional wrench cone, we show that the 3D volume of feasible COM accelerations is always an upward-pointing cone. We reduce its computation to a convex hull of (dual) 2D points, for which optimal C(nlog n) algorithms are readily available. This reformulation brings a significant speedup compared to previous methods, which allows us to compute time-varying contact-stability criteria fast enough for the control loop. Next, we propose a conservative trajectory-wide contact-stability criterion, which can be derived from COM-acceleration volumes at marginal cost and directly applied in a model-predictive controller. We finally implement this pipeline and exemplify it with the HRP-4 humanoid model in multi-contact dynamically walking scenarios.