most citedHigh-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

6 citations · 10 across the 4 of their papers we have counts for

collaborators

5 papers

cs.RO20174 cited

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps

Shuai D Han, Nicholas M Stiffler, Athanasios Krontiris +2

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, simil…

cs.RO2017

Improving 6D Pose Estimation of Objects in Clutter via Physics-aware Monte Carlo Tree Search

Chaitanya Mitash, Abdeslam Boularias, Kostas E. Bekris

This work proposes a process for efficiently searching over combinations of individual object 6D pose hypotheses in cluttered scenes, especially in cases involving occlusions and o…

cs.MA2017

Scalable Asymptotically-Optimal Multi-Robot Motion Planning

Andrew Dobson, Kiril Solovey, Rahul Shome +2

Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of…

cs.RO2017

Efficient, High-Quality Stack Rearrangement

Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris +1

This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered…

cs.RO20176 cited

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

Shuai D. Han, Nicholas M. Stiffler, Athansios Krontiris +2

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, simil…