C-space cell defragmentation for general translational assembly planning

被引：0
|
作者：
Schwarzer, F [1 ]
Schweikard, A [1 ]
机构：
[1] Tech Univ Munich, D-80290 Munich, Germany
来源：
2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS | 2001年
关键词：
geometric reasoning; assembly planning; motion planning; complete algorithms; configuration space computation;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present an exact and practical incremental method for general translational assembly planning. In practical cases, an exact and complete representation of the relevant free regions in the high-dimensional assembly configuration space becomes amenable by incrementally computing an arrangement of cells in d-dimensional space. Here we introduce a novel reduction scheme, D-node reduction, that allows for online defragmentation of the computed cell decomposition and thus significant speedup and reduction of storage requirements. Experimental results for both two and three-dimensional assemblies show the practicality of the proposed approach and illustrate the impact of the new reduction scheme.
引用
收藏
页码：1537 / 1542
页数：6
相关论文
共 50 条
  • [1] C-Space Compression for Robots Motion Planning
    Medina, Oded
    Taitz, Ariel
    Ben Moshe, Boaz
    Shvalb, Nir
    [J]. INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2013, 10
  • [2] Efficient assembly sequence planning using stereographical projections of C-Space obstacles
    Thomas, U
    Barrenscheen, M
    Wahl, FM
    [J]. PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP2003), 2003, : 96 - 102
  • [3] General translational assembly planning
    Schweikard, A
    Schwarzer, F
    [J]. 1997 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION - PROCEEDINGS, VOLS 1-4, 1997, : 612 - 619
  • [4] Motion planning with narrow C-space passages
    Eldershaw, C
    Yim, M
    Zhang, Y
    Roufas, K
    Duff, D
    [J]. IROS 2003: PROCEEDINGS OF THE 2003 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, 2003, : 1608 - 1613
  • [5] C-Space Tunnel Discovery for Puzzle Path Planning
    Zhang, Xinya
    Belfer, Robert
    Kry, Paul G.
    Vouga, Etienne
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2020, 39 (04):
  • [6] View planning via maximal C-space entropy reduction
    Wang, PP
    Gupta, K
    [J]. ALGORITHMIC FOUNDATIONS OF ROBOTICS V, 2003, 7 : 149 - 165
  • [7] On-line path planning with optimal C-space discretization
    Henrich, D
    Wurll, C
    Worn, H
    [J]. 1998 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS - PROCEEDINGS, VOLS 1-3: INNOVATIONS IN THEORY, PRACTICE AND APPLICATIONS, 1998, : 1479 - 1484
  • [8] Burs of Free C-space: a Novel Structure for Path Planning
    Lacevic, Bakir
    Osmankovic, Dinko
    Ademovic, Adnan
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2016, : 70 - 76
  • [9] A general method for C-space evaluation and its application to articulated robots
    Curto, B
    Moreno, V
    Blanco, FJ
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2002, 18 (01): : 24 - 31
  • [10] Global Trajectory Planning Based on DWMR Dynamics in Circular C-space
    Kim, Yunjeong
    Kim, Byung Kook
    [J]. INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2019, 17 (10) : 2624 - 2633
12345