اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLinear-Time Contact and Friction Dynamics in Maximal Coordinates using Variational Integrators
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Simulation of contact and friction dynamics is an important basis for control- and learning-based algorithms. However, the numerical difficulties of contact interactions pose a challenge for robust and efficient simulators. A maximal-coordinate representation of the dynamics enables efficient solving algorithms, but current methods in maximal coordinates require constraint stabilization schemes. Therefore, we propose an interior-point algorithm for the numerically robust treatment of rigid-body dynamics with contact interactions in maximal coordinates. Additionally, we discretize the dynamics with a variational integrator to prevent constraint drift. Our algorithm achieves linear-time complexity both in the number of contact points and the number of bodies, which is shown theoretically and demonstrated with an implementation. Furthermore, we simulate two robotic systems to highlight the applicability of the proposed algorithm.
قيم البحث
اقرأ أيضاً
The linear-quadratic regulator (LQR) is an efficient control method for linear and linearized systems. Typically, LQR is implemented in minimal coordinates (also called generalized or joint coordinates). However, other coordinates are possible and re
cent research suggests that there may be numerical and control-theoretic advantages when using higher-dimensional non-minimal state parameterizations for dynamical systems. One such parameterization is maximal coordinates, in which each link in a multi-body system is parameterized by its full six degrees of freedom and joints between links are modeled with algebraic constraints. Such constraints can also represent closed kinematic loops or contact with the environment. This paper investigates the difference between minimal- and maximal-coordinate LQR control laws. A case study of applying LQR to a simple pendulum and simulations comparing the basins of attraction and tracking performance of minimal- and maximal-coordinate LQR controllers suggest that maximal-coordinate LQR achieves greater robustness and improved tracking performance compared to minimal-coordinate LQR when applied to nonlinear systems.
A fixed time-step variational integrator cannot preserve momentum, energy, and symplectic form simultaneously for nonintegrable systems. This barrier can be overcome by treating time as a discrete dynamic variable and deriving adaptive time-step vari
ational integrators that conserve the energy in addition to being symplectic and momentum-preserving. Their utility, however, is still an open question due to the numerical difficulties associated with solving the governing discrete equations. In this work, we investigate the numerical performance of energy-preserving, adaptive time-step variational integrators. First, we compare the time adaptation and energy performance of the energy-preserving adaptive algorithm with the adaptive variational integrator for Keplers problem. We also study the effect of variable precision arithmetic on the energy conservation properties. Second, we apply tools from Lagrangian backward error analysis to investigate numerical stability of the energy-preserving adaptive algorithm. Finally, we consider a simple mechanical system example to illustrate our backward stability approach by constructing a modified Lagrangian for the modified equation of an energy-preserving, adaptive time-step variational integrator.
We present a general approach for controlling robotic systems that make and break contact with their environments: linear contact-implicit model-predictive control (LCI-MPC). Our use of differentiable contact dynamics provides a natural extension of
linear model-predictive control to contact-rich settings. The policy leverages precomputed linearizations about a reference state or trajectory while contact modes, encoded via complementarity constraints, are explicitly retained, resulting in policies that can be efficiently evaluated while maintaining robustness to changes in contact timings. In many cases, the algorithm is even capable of generating entirely new contact sequences. To enable real-time performance, we devise a custom structure-exploiting linear solver for the contact dynamics. We demonstrate that the policy can respond to disturbances by discovering and exploiting new contact modes and is robust to model mismatch and unmodeled environments for a collection of simulated robotic systems, including: pushbot, hopper, quadruped, and biped.
We introduce a procedure for gluing Weinstein domains along Weinstein subdomains. By gluing along flexible subdomains, we show that any finite collection of high-dimensional Weinstein domains with the same topology are Weinstein subdomains of a `maxi
mal Weinstein domain also with the same topology. As an application, we produce exotic cotangent bundles containing many closed regular Lagrangians that are formally Lagrangian isotopic but not Hamiltonian isotopic and also give a new construction of exotic Weinstein structures on Euclidean space. We describe a similar construction in the contact setting which we use to produce `maximal contact structures and extend several existing results in low-dimensional contact geometry to high-dimensions. We prove that all contact manifolds have symplectic caps, introduce a general procedure for producing contact manifolds with many Weinstein fillings, and give a new proof of the existence of codimension two contact embeddings.
Model predictive control (MPC) schemes have a proven track record for delivering aggressive and robust performance in many challenging control tasks, coping with nonlinear system dynamics, constraints, and observational noise. Despite their success,
these methods often rely on simple control distributions, which can limit their performance in highly uncertain and complex environments. MPC frameworks must be able to accommodate changing distributions over system parameters, based on the most recent measurements. In this paper, we devise an implicit variational inference algorithm able to estimate distributions over model parameters and control inputs on-the-fly. The method incorporates Stein Variational gradient descent to approximate the target distributions as a collection of particles, and performs updates based on a Bayesian formulation. This enables the approximation of complex multi-modal posterior distributions, typically occurring in challenging and realistic robot navigation tasks. We demonstrate our approach on both simulated and real-world experiments requiring real-time execution in the face of dynamically changing environments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
