Papers for

mechanical engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Low clearance hinge design improves precision in 3d printed sheet robots

Low Clearance Hinge Joint Mechanism Based on 3D Printing on Sheet Fabrication Methodology

Abstract: This paper presents a low-clearance hinge joint mechanism based on the 3D printing on sheet fabrication method. This approach simplifies the fabrication of hinge mechanisms and overcomes limitations of conventional origami manufacturing by eliminating the need for adhesives commonly used during assembly, making it suitable for robots at the tens-of-centimeters scale. The advantages and disadvantages of three types of hinge joint mechanisms are compared, and a hinge joint that can be designed with low clearance for various facet thicknesses is selected. Based on the selected hinge joint, the twisting angle and bending force are analyzed, leading to the implementation of a clearance of 0.1 mm. Torsional resistance is experimentally evaluated to measure the torque required for twisting caused by plastic deformation and clearance. The results show that the torque associated with plastic deformation is sufficient to constrain the undesired degrees of freedom of the hinge joint, while the torque required for twisting due to clearance is minimal. Based on the analyzed data, the proposed hinge joint mechanism is applied to a 3-degree-of-freedom delta robot manipulator, demonstrating precise motion with low clearance.

Mon 14 SeptRobotics
The gist
Making strong, precise hinges in sheet-based robots can be tricky because usual methods use glue, which complicates building. The authors studied different hinge types and picked one that works well with very little gap (clearance). They tested how much force the hinge can handle while still moving smoothly. Using this design, they built a small robot arm that moves accurately without the problems caused by extra space in the hinges.
Open 2609.15276v1

LiftGCN improves finite element stress predictions with efficient graph learning

LiftGCN: Efficient Energy-Preserving Graph Learning via Joukowski Spectral Lifting for Finite Element Stress Prediction

Abstract: Finite element stress fields often exhibit strong local non-smoothness, where stress concentrations near holes, notches, and loading regions induce sharp spatial gradients and high-frequency graph components. Although graph neural networks naturally operate on irregular finite element meshes, conventional message passing is inherently smoothing and progressively attenuates such high-frequency information. Unitary propagation alleviates this problem by preserving spectral magnitudes, but typically relies on matrix functions and high-order approximations with $O(Ked)$ propagation complexity. We propose LiftGCN, an efficient spectrally stable graph network based on Joukowski spectral lifting. LiftGCN maps the real spectrum of a normalized graph operator onto the unit circle through the Joukowski relation and realizes the resulting spectral transformation as a simple second-order recurrence, avoiding matrix exponentials, eigendecomposition, and high-order polynomial truncation. We show that the linear Joukowski backbone has unit-modulus characteristic roots and admits an energy-preserving structure under a positive-definite metric, preventing exponential attenuation of graph-frequency components with depth. Each layer requires only one sparse neighborhood aggregation, yielding $O(ed)$ propagation complexity, while lightweight local nonlinear residuals provide expressive feature transformations. Experiments on finite element stress prediction demonstrate that LiftGCN achieves competitive overall accuracy while improving reconstruction of stress concentrations and local high-gradient structures with substantially reduced computational cost. Our code is available at https://github.com/ChenZeng001/LiftGCN.

Mon 14 SeptMachine LearningArtificial Intelligence
The gist
Predicting how parts stretch or bend under pressure is hard because sharp changes in stress happen near holes or cracks. Traditional graph neural networks smooth out these sharp changes, missing important details. The authors propose LiftGCN, a new method that preserves these sharp edges in the data efficiently. It does this by using a clever math trick called Joukowski spectral lifting, which keeps important signal frequencies while being computationally faster. Their tests show it predicts stress more accurately near complicated areas and does so with less computing power.
Open 2609.14977v1

Physics informed graph neural network models stress in complex solids

A variational physics-informed graph neural network for heterogeneous solid mechanics

Abstract: Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($σ_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

Thu 10 SeptMachine Learning
The gist
Modeling stress in materials with different properties is tricky because stress behaves differently at their boundaries. The authors developed a new type of neural network that uses a mesh to represent the material, assigning behavior to each part, which allows it to model stress without complicated penalty terms. This method shows improved accuracy over previous approaches across a range of material stiffness differences. However, training takes much longer than traditional methods, so it’s best suited for repeated analyses or identifying unknown material properties, not one-time calculations.
Open 2609.10983v1

Kinematic method links joint motion to platform behavior across robot mechanisms

Lie-Algebraic Bell Recurrences for Arbitrary-Order Twist Jets and Parallel-Mechanism Closure

Abstract: This paper develops an arbitrary-order kinematic construction that links serial propagation, parallel-mechanism closure, and rigid-platform point fields within one dual screw framework. A cylindrical joint is retained as one native physical block, with revolute and prismatic joints obtained as special cases. For each fixed joint axis, ordinary Bell polynomials organize the derivatives of the exponential factor; across a chain, the noncommuting factors remain in their physical order. Initial-frame prefix and terminal-resolved covariant formulas then produce equivalent representations of the serial twist jet. For a parallel mechanism, repeated Leibniz differentiation, with joint-level derivatives organized by Bell polynomials, yields an arbitrary-order triangular active-passive closure recurrence: the same passive Jacobian is solved at every derivative order at a regular configuration, while the right-hand side contains only prescribed active data and lower-order jets. The resulting platform twist jet is mapped exactly to the point-independent affine invariants of the velocity, acceleration, jerk, and snap fields. The validation is deliberately complementary: a generic 3C chain with noncoplanar axes and nonzero rotational and translational cylindrical coordinates tests ordered serial propagation, an RR+RRR spherical wrist tests active-passive closure, and a Hunt-type 6-RUS mechanism with six active revolute joints tests an independently reconstructed platform jet and its affine fields. Independent differentiation of the rigid motion, evaluation of the affine fields, and the differentiated branch closures all agree through fourth order with residuals below $10^{-12}$ in the corresponding SI units. The formulation is purely kinematic and applies at configurations where the selected active-passive partition is regular.

Wed 9 SeptRobotics
The gist
Robots and mechanical systems often have parts connected by joints that move in specific ways. This paper presents a mathematical method to describe motion changes of any order (speed, acceleration, jerk, and beyond) for complex assemblies that include serial chains and parallel mechanisms. The authors use special polynomials (called Bell polynomials) and algebraic tools to keep track of how motions combine, even when joints interact non-linearly. They validate their formulas by testing on different robotic arms and mechanisms, confirming accurate and consistent results.
Open 2609.10748v1

Local gradient neural operator predicts evolving mechanical systems well

Local gradient neural operator

Abstract: Field temporal prediction and source identification constitute canonical problems in dynamical systems. Conventional approaches to these problems depend on a thorough understanding of the governing partial differential equations (PDEs). Recently, deep learning, as represented by neural operators, has provided a data-driven paradigm for addressing such tasks. However, most existing global neural operators for PDEs require large training datasets and many learnable parameters, with limited interpretability and generalization. We propose the local gradient neural operator (LGNO) as a lightweight and interpretable alternative for field temporal evolution prediction and source identification in typical mechanical problems. The method builds on priors from nonlinear gradient discretization and uses multilayer perceptron convolutional layers to learn translation-invariant local kernels that resemble discrete stencils. A zero consistent stencil factorization separates coefficient learning from field reconstruction, rendering the learned operators more transparent. For problems with symmetries, network folding shares equivalent components and reduces parameter counts. We evaluate the method on PDE benchmarks covering linear and nonlinear, static and dynamic, and low and high dimensional cases. Results show that LGNO maintains accuracy, parameter efficiency, and rollout stability across these tasks, and further exhibits wide applicability to mechanical problems including diffusion, flow, and quantum phenomena.

Mon 7 SeptMachine Learning
The gist
Predicting how things like heat or fluids will change over time usually needs deep understanding of complicated math equations. The researchers introduce a new method called the local gradient neural operator, which learns from data in a simpler, more understandable way. Their approach uses local patterns that mimic traditional numerical methods and keeps things efficient with fewer parameters. This method works well on many types of problems, including those involving diffusion, flow, and even quantum effects.
Open 2609.07752v1