arXiv:2504. 16595v2 Announce Type: replace-cross Abstract: Packing objects efficiently is a fundamental problem in logistics, warehouse automation, and robotics.
arXiv:2510. 10057v2 Announce Type: replace Abstract: The three-dimensional bin packing problem (3D-BPP) is widely applied in logistics and warehousing.
arXiv:2609.38863v1 Announce Type: cross Abstract: The two-dimensional irregular knapsack problem in a fixed circular container is an important combinatorial optimization problem for maximizing materi...
arXiv:2506. 04147v5 Announce Type: replace-cross Abstract: Building capable household and industrial robots requires mastering the control of versatile, high-degree-of-freedom (DoF) systems such as mobile manipulators.
The paper introduces QDTraj, a method that uses Quality‑Diversity algorithms to automatically generate a diverse set of low‑level trajectory primitives for manipulating articulated objects. By leveraging sparse reward exploration, QDTraj produces at least five times more diverse trajectories for hinge and slider tasks compared to baseline methods, and demonstrates strong generalization across 30 articulations from the PartNetMobility dataset, averaging 704 trajectories per task. The resulting primitives are validated both in simulation and on real robots, with the code released publicly.
arXiv:2602.23934v2 Announce Type: replace-cross Abstract: This paper presents a novel autonomous robotic assembly framework for constructing stable structures without relying on predefined architectu...
The paper introduces a novel end‑to‑end, size‑agnostic graph reinforcement learning framework for the one‑dimensional bin packing problem (1D‑BPP). It models packing as a Markov decision process on an item‑compatibility graph, where a graph neural network actor‑critic policy learns to merge compatible partial bins. Empirical results on the BPPLIB benchmark show that the learned policy reduces the mean optimality gap of a constructive heuristic from 2.66 % to 2.31 %, performs competitively against other learned methods, and outperforms a state‑of‑the‑art learned solver on the hardest benchmark family.
arXiv:2607. 06388v1 Announce Type: cross Abstract: Robotic throwing enables fast and efficient object placement beyond the robot's immediate workspace, but reliable throwing in cluttered environments remains underexplored.
The paper presents HSAC, a reinforcement learning method that builds covering structures without predefined plans, using graph-structured states and a mixed action space of discrete block selection and continuous placement. It extends soft actor-critic with unilateral edges in graph neural networks to efficiently explore while simulating stability. Experiments show HSAC outperforms hybrid-PPO, remains robust to hyperparameters, and successfully transfers to a real two-robot 3D‑printed arch construction.
arXiv:2511. 10276v2 Announce Type: replace-cross Abstract: Most existing robotic manipulation benchmarks focus on tabletop or household scenarios.
arXiv:2609.25351v1 Announce Type: cross Abstract: We focus on human-robot collaborative transport, a challenging task of broad relevance spanning logistics, manufacturing, and the home, in which a us...
arXiv:2608. 05588v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires repeatedly planning collision-free paths for agents that continuously receive new goals upon reaching their current ones.
arXiv:2606. 26428v1 Announce Type: cross Abstract: Multi-fingered robots promise the speed and dexterity of human hands, yet challenging problems such as precise assembly have remained out of reach.