C-Space Cell Defragmentation For General Translational Assembly Planning

2001 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS(2001)

引用 4|浏览5
暂无评分
摘要
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.
更多
查看译文
关键词
geometric reasoning, assembly planning, motion planning, complete algorithms, configuration space computation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要