This paper extends an existing algorithm for the first-order derivatives of rigid-body dynamics to the case of closed-chain kinematic systems modeled using constraint embed- ding. Many standard dynamics algorithms apply to both open- chain and constraint-embedded models, but existing efficient derivative methods assume joint velocity effects are locally config- uration invariant. We remove this assumption and derive adapted algorithms that extend dynamics derivatives to more general joint types, including those arising in constraint-embedded closed- chain models. Our results compare conventional pin-joint robot models with more complete actuation models that capture local closed chains. We show that the additional terms introduced by these generalizations have low computational impact when mod- eling actuation kinematics alone, but can incur higher cost when additional rigid bodies, such as motor rotors, are included in the actuation chain, or when considering non-local loops. Overall, these results enable more accurate dynamics computations for constraint-embedded actuation submechanisms to be adopted in model-predictive control and differentiable simulation.
Figures & tables
Fig. 1: Body numbering and notation examples for (a) an open-chain system and (b) a constraint-embedding model applied to a closed-chain system.
Fig. 2: Actuation mechanisms for the (a) MIT Humanoid Leg, (b) Tello humanoid [ 14 ] , and (c) Cassie Leg. The MIT Humanoid [ 9 ] has a coupled belt drive for the knee and ankle. Tello [ 8 ] has a 2DoF differential hip mechanism and a coupled linkage mechanism for the knee and ankle. Cassie has four bar mechanisms for its distal DoFs.
Robot
∂τ/∂q
∂τ/∂q˙
Kuka LWR 4+
1.07e-14
3.33e-16
Mini Cheetah
2.84e-14
2.66e-15
MIT Humanoid
2.84e-14
1.07e-14
Cassie
8.53e-14
1.11e-14
Tello
4.26e-14
1.78e-15
TABLE I: Maximum Error of the Inverse Dynamics Derivatives
Fig. 3: Per-joint error for the inverse dynamics derivatives for MIT Mini Cheetah with motor rotors modeled using constraint embedding.
Fig. 4: Algorithm speed for full and simplified robot models with clang. Fwd refers to the forward pass of Algorithm 1 (lines 2-11) and Bwd refers to its backward pass (lines 12-28). +/− M indicate with/without actuation mechanism transmission kinematics and +/− R indicate with and without motor rotors.
Fig. 5: Scaling performance of kinematic trees with different joint types and topologies (serial chain vs. binary tree).
Fig. 6: Computation time vs. loop depth for two 10-body chains connected by an additional body at varying depths. Two three link chains connected at a depth of 2 are shown in the inset.
Closed kinematic chains complicate modular modeling by coupling active and passive coordinates through nonlinear closure constraints. This paper presents a Path-Assembled Closure Differential Mapping (PACDM) framework for modular closure resolution and kinematic reduction. Each closure element compares two ordered transformation paths with common endpoints, with their mismatch expressed through the logarithm on SE(3) and the corresponding Jacobian assembled from local transformation derivatives. Multi-path modules are constructed from a minimal set of pairwise closure elements, while rank-revealing analysis selects locally independent scalar constraints. A defect homotopy recovers closure-consistent passive coordinates from approximate estimates along a feasible and regular continuation path. At regular configurations, implicit differentiation yields the local active-to-passive differential mapping, which is subsequently used in a predictor-corrector continuation procedure for prescribed motion. The framework is evaluated on a seven-degree-of-freedom heavy-duty manipulator containing two-path and three-path closed-chain modules. Comparison with Simscape Multibody yields trajectory root-mean-square errors below 8.5 x 10^-10 rad, while predictor-corrector continuation is approximately 45.8 times faster than applying defect homotopy at every trajectory sample.
Mohammad Dastranj, Jouni Mattila
Unit of Automation Technology and Mechanical Engineering, Faculty of Engineering and Natural Sciences, Tampere University, 33720 Tampere, Finland
Rigid closed chains can admit indeterminate internal reactions even when their motion is fully specified. This paper develops a modular inverse-dynamics workflow that combines path-based motion reconstruction with recovery of uniquely determined actuator and joint-wrench outputs. Analytical second-order differentiation of assembled transformation paths supplies passive velocities and accelerations on a regular closure branch. Spatial Newton--Euler balances are then assembled over the physical body-and-joint graph. Established nullspace and dual criteria identify and recover unique outputs, while balance, ideal-joint admissibility and affine-family diagnostics assess nonunique reference reactions. Evaluation against Simscape Multibody uses prescribed motion of a seven-degree-of-freedom heavy-duty hybrid serial--parallel manipulator under common rigid-body, ideal-joint assumptions. The results show close agreement with the reference for passive positions, actuator efforts and uniquely recoverable constraint-wrench components. Reaction diagnostics support compatibility with the admissible numerical load family.
Mohammad Dastranj, Jouni Mattila
Unit of Automation Technology and Mechanical Engineering, Tampere University, Tampere, Finland
As robot control shifts toward large-scale reinforcement learning with in-loop dynamics computation, the community's reliance on CPU-bound libraries such as Pinocchio creates a throughput bottleneck in GPU-based training pipelines. We present BARD (Batched Articulated Rigid-body Dynamics), a self-contained PyTorch implementation of Featherstone's rigid-body dynamics algorithms, optimized for batched GPU evaluation and automatic differentiation. Three design choices make this efficient: a tiered lazy-evaluation cache that avoids redundant tree traversals, matmul-free joint transforms via pre-computed Rodrigues constants, and level-parallel propagation that reduces sequential operations to tree-depth batched steps. On five robot models (7-23 DOFs), BARD matches Pinocchio numerically while reaching up to 64x higher throughput for Forward Kinematics and 63x for Jacobians at batch size 4096 on an NVIDIA H200. We validate differentiability through gradient-based system identification on a 7-DOF manipulator, recovering link masses to 1.24% mean error under 5% torque noise, and integrate BARD into an Isaac Lab AMP training pipeline for an 11-DOF spined quadruped with 4096 parallel environments, where it is 8.5x faster than Pinocchio and 2.0x faster than ADAM for in-loop dynamics. BARD is open-sourced at: https://github.com/YueWang996/bard-pytorch-dynamics.
Yue Wang, Yanran Xu, Wenbo Wu +2
University of Southampton, Southampton, SO17 1BJ, UK