Backend
Lodos: A Lightweight Simulator Designed for Contact-Rich Interactions with Detailed Meshes
arXiv cs.RO0 views
arXiv:2611.08872v1 Announce Type: new Abstract: In recent years, massively parallelized rigid-body simulation has played a central role in robotics research, enabling rapid progress in areas such as reinforcement learning, stochastic optimal control, and randomized smoothing-based trajectory optimization. Particularly in contact-rich settings, the scalability of such simulations in large part depends on well-optimized representations of collision geometry, often requiring a coarse approximation of the underlying surfaces using primitives such as spheres, capsules, cylinders, and boxes. Whenever the complexity of the surfaces or the precision demands of the application render such approximations insufficient, it is instead necessary to employ mesh-mesh collisions, which impose a significant reduction in throughput. This paper proposes a simulation framework designed from scratch to address this bottleneck, with novel routines for broadphase and narrowphase collision detection as well as the subsequent contact dynamics computation. As experimentally validated, the framework matches existing well-established simulators in terms of physical faithfulness, and can achieve approximately an order of magnitude higher throughput in the detailed mesh-mesh collision setting that it specializes in. The source code is available at https://github.com/martius-lab/lodos.
Source:https://arxiv.org/abs/2611.08872PreviousLodos-v2: An Efficient Primal Formulation of the Exact Frictional Contact ProblemNextLocalizing and Editing the Goal Representation of a Vision-Language-Action Model
Related posts

Generador de UUID aleatorios online para desarrolladores
0dev.to Database
Same Request, Different Answer: Quantization Amplifies Cache-Induced Divergence in LLM Serving
0arXiv cs.DC
A structure-preserving semi-implicit finite volume scheme on vertex-staggered unstructured meshes
0arXiv cs.NA
Descending Everest, Part II: Oracle Complexity of Minimizing a Sum of Convex $(L_0,L_1)$-Smooth Functions
0arXiv stat.ML
Black-box model classification under the discriminative factorization
0arXiv stat.ML
Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model
0arXiv stat.ML