검색 상세

Two-Phase Multi-Arm Object Rearrangement Planning using Tree Search

목차

1 Introduction 1
2 Related works 4
3 Preliminaries 6
3.1 Dependency graph 6
3.2 Strongly connected graph 7
3.3 Feedback vertex set 8
3.4 Buffer allocation 9
4 Problem Description 10
4.1 Assumptions 10
4.2 Problem definition 10
5 Multi-Arm Tabletop Object Rearrangement 16
5.1 The proposed method: MATO 17
5.1.1 Heuristic solver 19
5.1.2 Best-first tree search 21
5.2 Analysis of MATO 28
5.3 Buffer allocation 29
6 Experiments 31
7 Conclusion 37
Bibliography 38

more