Name
Abstract | ||
|---|---|---|
Rearranging objects on a planar surface arises in a variety of robotic applications, such as product packaging. Using two arms can improve efficiency but introduces new computational challenges. This paper studies the structure of dual-arm rearrangement for synchronous, monotone tabletop setups and develops an optimal mixed integer model. It then describes an efficient and scalable algorithm, which first minimizes the cost of object transfers and then of moves between objects. This is motivated by the fact that, asymptotically, object transfers dominate the cost of solutions. Moreover, a lazy strategy minimizes the number of motion planning calls and results in significant speedups. Theoretical arguments support the benefits of using two arms and indicate that synchronous execution, in which the two arms perform together either transfers or moves, introduces only a small overhead. Experiments support these points and show that the scalable method can quickly compute solutions close to the optimal for the considered setup. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-44051-0_45 | arXiv: Robotics |
Field | DocType | Volume |
Motion planning,Integer,Control engineering,Planar,Computational science,Scalable algorithms,Engineering,Monotone polygon,Scalability | Journal | abs/1810.12202 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rahul Shome | 1 | 34 | 6.07 |
| Kiril Solovey | 2 | 71 | 10.30 |
| Yu Jingjin | 3 | 14 | 14.10 |
| Kostas E. Bekris | 4 | 938 | 99.49 |
| Dan Halperin | 5 | 1291 | 105.20 |