RL-Lock: Reinforcement Learning for Generating Interlocking Assemblies
Not on the map. Why?
Abstract (arXiv)
An interlocking assembly is an assembly in which component parts are connected purely through their geometric arrangement, without relying on external connectors such as glue and nails. Such assemblies have been widely used in a variety of real-world applications due to their structural stability. The problem of generating interlocking assemblies is generally formulated as a shape decomposition problem, where a target 3D object represented as a voxel grid is partitioned into a prescribed number of interlocking pieces. We observe that generating interlocking assemblies is inherently a sequential decision-making problem, where an agent repeatedly decides which piece each voxel should be assigned to. Inspired by the observation, we propose the first reinforcement learning framework RL-Lock for generating interlocking assemblies, without relying on handcrafted search heuristics as existing works did. RL-Lock combines structured action chunking with MCTS-guided policy-value learning to efficiently navigate the large combinatorial search space for interlocking assembly generation. We demonstrate through experiments that RL-Lock allows effective generation of interlocking assemblies, especially for challenging cases in which existing approaches take too long or even fail to find a valid solution.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 32 references that are in the map. First posted on arXiv 3 Aug 2026.
Builds on
5 of 32 references.
References · 5
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 20163D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotationcited by 1,471
- 2020PCGRL: Procedural Content Generation via Reinforcement Learningcited by 90
- 2021Brick-by-Brick: Combinatorial Construction with Deep Reinforcement Learningcited by 19
- 2025Video Game Level Design as a Multi-Agent Reinforcement Learning Problemcited by 1
Built on by
Not cited yet.