activity
20142026
most citeddRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning

93 citations · 407 across the 82 of their papers we have counts for

collaborators
Showing 2017Show all

7 papers · 1 filter

cs.RO2017★ 4 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.RO2017

Fast Model Identification via Physics Engines for Data-Efficient Policy Search

Shaojun Zhu, Andrew Kimmel, Kostas E. Bekris +1

This paper presents a method for identifying mechanical parameters of robots or objects, such as their mass and friction coefficients. Key features are the use of off-the-shelf phy…

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.RO2017★ 6 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…