33 citations · 215 across the 36 of their papers we have counts for
5 papers · 1 filter
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…
SEAR: A Polynomial-Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee
Shuai D. Han, Edgar J. Rodriguez, Jingjin Yu
We study the labeled multi-robot path planning problem in continuous 2D and 3D domains in the absence of obstacles where robots must not collide with each other. For an arbitrary n…
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…
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…
Average Case Constant Factor Time and Distance Optimal Multi-Robot Path Planning in Well-Connected Environments
Jingjin Yu
Fast algorithms for optimal multi-robot path planning are sought after in real-world applications. Known methods, however, generally do not simultaneously guarantee good solution o…