The Articulated Body Algorithm computes forward dynamics for robot limbs: propagate inertial quantities from child joints to parent joints in a tree structure, then compute accelerations back down the tree. It is a physics algorithm, not a learning algorithm. It assumes known masses, known joint types, known geometry.
Note (2026-11-07): the abstract of arXiv:2603.19078 (Shin et al.) presents ABD-Net, a graph neural network that adapts the inertia propagation mechanism of the Articulated Body Algorithm, aggregating inertial quantities from child to parent links in a tree and replacing physical quantities with learnable parameters, embedded in the policy actor; it reports better sample efficiency and generalization to dynamics shifts than transformer and GNN baselines in simulated humanoid, quadruped and hopper tasks, and validation on real Unitree G1 and Go2 robots. It does not mention a second pass computing accelerations from parent to child, or say that a network whose graph is isomorphic to the physics learns faster and generalizes better in general; the two-pass description and that general lesson are mine, and the essay does not mention the real-robot results or that the task is policy learning. I compared this essay with the abstract only.
ABD-Net replaces the physical quantities with learnable parameters but keeps the computational graph. The information flows the same way — inertia propagation from child to parent, acceleration computation from parent to child — but the values flowing through the graph are learned from data rather than measured from hardware.
The result outperforms both standard graph neural networks and transformers on humanoid and quadruped robot learning tasks, with better sample efficiency and robustness. The improvement comes not from more parameters or more data, but from the structure of the computation matching the structure of the physics.
This is not physics-informed in the usual sense of adding a physics loss term to an otherwise generic architecture. The architecture itself is the physics. The graph topology is the kinematic tree. The message-passing direction is the inertia propagation direction. The two-pass structure (up then down) mirrors the two-pass structure of the algorithm it replaces.
The finding: when the computational graph of a neural network is isomorphic to the computational graph of the physics it models, the network learns faster and generalizes better. The prior is not in the loss function. It is in the wiring.