Manipulation planning among movable obstacles

被引:125
作者
Stilman, Mike [1 ]
Schamburek, Jan-Ullrich [1 ,2 ]
Kuffner, James [1 ]
Asfour, Tamim [2 ]
机构
[1] Carnegie Mellon Univ, Inst Robot, 5000 Forbes Ave, Pittsburgh, PA 15213 USA
[2] Univ Karlsruhe, Inst Comp Sci & Engn, D-76131 Karlsruhe, Germany
来源
PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-10 | 2007年
关键词
D O I
10.1109/ROBOT.2007.363986
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents the ResolveSpatialConstraints (RSC) algorithm for manipulation planning in a domain with movable obstacles. Empirically we show that our algorithm quickly generates plans for simulated articulated robots in a highly nonlinear search space of exponential dimension. RSC is a reverse-time search that samples future robot actions and constrains the space of prior object displacements. To optimize the efficiency of RSC, we identify methods for sampling object surfaces and generating connecting paths between grasps and placements. In addition to experimental analysis of RSC, this paper looks into object placements and task-space motion constraints among other unique features of the three dimensional manipulation planning domain.
引用
收藏
页码:3327 / +
页数:2
相关论文
共 19 条
[1]  
ALAMI R, 1994, WORKSH ALG FDN ROB
[2]  
[Anonymous], 1986, ICRA
[3]   Practical pushing planning for rearrangement tasks [J].
Ben-Shahar, O ;
Rivlin, E .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (04) :549-565
[4]  
CHEN PC, 1991, 1991 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-3, P444, DOI 10.1109/ROBOT.1991.131618
[5]   Complexity measures for assembly sequences [J].
Goldwasser, MH ;
Motwani, R .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1999, 9 (4-5) :371-417
[6]  
GUPTA K, 1998, INT J ROBOTICS RES, V17
[7]  
HIRANO Y, 2005, IAMGE BASED OBJECT R, P3981
[8]  
KUFFNER J, 2005, WORKSH ALG FDN ROB, P995
[9]  
LaValle S. M., 2000, WORKSH ALG FDN ROB
[10]  
LOZANOPEREZ T, 1984, INT J ROBOTICS RES, V3