Skip to content
Open access

Explainable Graph Neural Networks Towards Data-Driven Inverse Kinematics in Industrial Robot Motion Planning

Jul 2026 · Electronics · Vol 15, pp. 3071 · 0 citations · 19 references

TL;DR

XGNN complements analytical and numerical IK methods as an interpretable, calibration-robust warm start when DH parameters are unavailable, proprietary, or degraded, and provides the strongest warm start for DLS refinement.

Abstract

Inverse kinematics (IK) is fundamental to robot motion planning. Classical analytical solvers require complete Denavit–Hartenberg (DH) parameters that are often proprietary or degraded by mechanical wear, and numerical solvers based on damped least squares (DLS) are sensitive to initialization, particularly near singularities. We propose XGNN, an explainable graph neural network positioned as a model-free, interpretable warm-start initializer for downstream numerical IK refinement rather than as a standalone replacement for analytical solvers. Each IK query is encoded as a 12-node graph in which six pose nodes and six joint nodes are connected through bipartite pose-to-joint attention edges and chain edges along the kinematic structure. GATv2 message passing aggregates information at each joint node; two ablation-validated design contributions (a learnable node-type embedding and an angle-aware composite loss) enable training to convergence. Evaluated on 300,000 trajectory-style samples generated from the ABB IRB 2400 kinematic model, XGNN achieves 3.66∘ joint mean absolute error (MAE), comparable to a multilayer perceptron baseline (3.09∘) and a bidirectional LSTM (3.14∘) under identical training. The standalone joint accuracy of all learned models is too coarse for direct industrial use, but XGNN provides the strongest warm start for DLS refinement: the convergence rate improves from 98.4% to 100%, mean iterations drop from 14.6 to 3.2, and wall-clock time per pose drops 5.0× on the IRB 2400. The benefit transfers cross-platform to the Universal Robots UR5 collaborative manipulator (convergence rate 82.2% to 100%, 10.0× speedup) and survives DH parameter perturbation of up to ±10%, simulating calibration drift or mechanical wear. The GATv2 attention coefficients additionally provide an interpretability signal at zero inference cost. XGNN therefore complements analytical and numerical IK methods as an interpretable, calibration-robust warm start when DH parameters are unavailable, proprietary, or degraded.

Read PDF

Similar papers

#graph neural networks Preprint Sep 2026

Model Predictive Control of Tensegrity Robots via Contact-Aware Graph Neural Dynamics Model

A hybrid MPPI controller operating over the learned GNN dynamics model improves predictive accuracy over a flat-ground baseline model and achieves superior navigation performance compared to $A^*$-based re-planning and MPPI-only variants.

Nelson Chen, Patrick Meng, Charles Tang et al. · 0 citations
Open access Oct 2026

Physics-Informed Neural Networks for Estimating the Cable Dynamics via Cartesian Measurements

Aerial robots equipped with cables used as soft end-effectors represent a new, versatile robotic paradigm to solve multiple tasks. However, to fully exploit the versatility of soft robots, the modeling problem must be addressed. The main challenges depend on the hard-to-model continuum dynamics. To solve this challenge...

M. Pierallini, Yao-Lei Shen, Y. de Santis et al. · 0 citations
#artificial intelligence Preprint Sep 2026

MorphIK: Morphology-Conditioned Neural Inverse Kinematics for Unknown Robots

MorphIK is a flow-matching model that solves inverse kinematics for revolute-joint-based kinematic chains it has never seen during training, and allows learning and generalizing neural inverse kinematics for a multitude of known and unknown robots.

Lennart Clasmeier, Jan-Gerrit Habekost, C. Weber et al. · 0 citations
Preprint Sep 2026

LOInK: Learned Optimal Inverse Kinematics via Structured Neural Surrogate Models

We introduce Learned Optimal Inverse Kinematics (LOInK), a method to generate approximately optimal solutions to an inverse kinematics problem. When trained on data consisting of sampled configurations and associated task variables and a given cost function, LOInK learns a bi-Lipschitz invertible mapping from configura...

Michael Somerfield, Damian Abood, Rui-Gang Wang et al. · 0 citations
Preprint Aug 2026

Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations

Motion planning problems such as collision-free navigation and contact-rich manipulation can be naturally formulated as optimization problems that couple discrete decisions with continuous trajectories. The Graphs of Convex Sets (GCS) framework offers a practical solution to these problems. It represents discrete decis...

Ananya Trivedi, Sarvesh Prajapati, Zhe-Xin Xu et al. · 0 citations
Preprint Oct 2026

Model-Based Geometry-Aware Generative Optimization for Constrained Locomotion Planning

Constrained Locomotion Planning (CLP) for quadrupeds and humanoids, where robots must satisfy collision avoidance, contact consistency, kinematic feasibility, and support constraints, is challenging under high-dimensional dynamics and highly non-convex environments. Recent Model-Based Diffusion (MBD) approaches recast...

Zhi-Lin He, Xin-Yuan Wang, Chang-Liu Liu · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.