Backward Layout Search for Sequence-Constrained Robotic Assembly

arXiv:2608.18454v1 Announce Type: new Abstract: Robotic assembly layout planning must determine the assembly site and the initial pose of each part while ensuring collision-free execution of a prescribed assembly sequence. This problem is challenging because the obstacle environment changes after each assembly step, and unassembled parts re maining in the workspace may block robot motions. We observe that the feasibility of each assembly step depends only on the initial poses of the current and later-assembled parts. Based on this dependency, we propose Backward Layout Search (BLS), which assigns initial part poses in reverse assembly order. Each expansion performs geometric, kinematic, grasp, and prescribed-motion checks, while collision masks and candidate set filtering remove infeasible initial part pose candidates. Promising partial layouts are retained through beam selection, and complete layouts are validated by full motion planning in forward assembly order. Experiments on five assembly models show that BLS produces collision-free executable layouts and reduces step evaluations and search time compared with a matched forward search.

Related

• Accelerating Mixed Discrete-Continuous Motion Planning via Neural Graphs of Convex Sets
• Bridging Discrete Planning and Continuous Execution for Redundant Robot
• Monte Carlo Tree Search with Tensor Factorization for Optimization Problems in Robotics
• PEEL: Parallel Extraction for Long-Horizon Disassembly Planning via Scale-Invariant Sampling

Source: arXiv cs.RO | 2026-08-20