Jul 2026· 2026 23rd International Conference on Ubiquitous Robots (UR)· pp. 409-416· 0 citations· 20 references
Abstract
We propose a stack-aware task and motion planning (TAMP) framework that rearranges heterogeneous objects within confined and cluttered environments. These settings involve vertical stacking and variations in object size and shape, which increase planning complexity. However, existing TAMP approaches typically assume uniform object geometries or rely on 2D abstractions that ignore detailed 3D stacking dependencies, leading to inefficient plans and frequent failures in tightly packed environments with densely stacked objects. To overcome these challenges, we introduce a rank-based task planner that assigns each potential relocation a lexicographically ordered score based on four factors: object rank, the number of objects stacked above it, buffer space clearance, and the number of blocking objects. The planner then selects the relocation with the lowest combined score, thereby reducing symbolic distance to the goal. During execution, the planner repairs the plan reactively by preserving valid subplans and applying local adjustments when collisions occur. Experimental results from both simulations and real robot experiments demonstrate higher success rates, reduced planning times, and improved object efficiency under tight spatial and stacking constraints.
Household robots have been a longstanding research topic, but they still lack human-like intelligence, particularly in manipulating open-set objects and navigating large environments efficiently and accurately. To push this boundary, we consider a scalable multi-object collection problem in large scene graphs, where th...
Ruochu Yang, Yu Zhou, Fumin Zhang et al.· 2026 23rd International Conf...· 0 citations
Experimental results demonstrate that current methods struggle to complete the ESRP task efficiently, highlighting ESRP as a challenging frontier for embodied agents in scene understanding and long-horizon task planning.
Can-Zhi Chen, Zan Wang, Si-Qi Zhu et al.· IEEE Robotics and Automation...· 0 citations
The Class-Based Heuristic A* (CBHA*) algorithm, which integrates a General Move Constraint to capture minimum displacement costs when vacant units are scarce, is introduced, demonstrating that class-triggered adaptive heuristics constitute a principled mechanism for efficient spatial planning that generalizes structura...
Sanyar Ahmadi, P. Asadzadeh, Amanj Khorramian· 0 citations
This work introduces tentative object pruning, an approach that leverages this property by constructing multiple simplified tasks with reduced object sets and searching them in parallel until a valid, satisficing solution is found.
Anita de Mello Koch, Naman Shah, Cameron S. Allen et al.· 0 citations
Semantic-Dense Placement Planning (SDPP) is proposed, an accessibility-preserving approach that ranks candidate poses using a semantic-density score combining inter-object semantic similarity with spatial proximity and significantly improves semantic placement quality over state-of-the-art baselines.
Benno Wingender, Nils Dengler, Nicolas Busch et al.· 0 citations
This work proposes a plug-and-play fix to automatically generate scene-specific, task-specific, adaptively updating abstractions on top of existing planning and control stacks, and shows that LENS improves classical planning, model-based control, and a vision-language-action model, across a diverse set of highly clutte...