首页> 外文期刊>Computer-Aided Design >Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters
【24h】

Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

机译:通过使用运动计划和零件交互集群来改善装配优先顺序约束生成

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect each other's accessibility, and hence may impose assembly constraints. This enables the generation of accurate precedence constraints without needing to examine all possible assembly sequences. Given an assembly model, our technique generates potential disassembly layers: spatial clustering is used to generate part sets. Next, motion planning based on rapidly-exploring random trees (RRT) with multiple trees is used to evaluate the interaction between these part sets. Specifically, motion planning is used to determine which part sets can be removed from the assembly. These sets are added to the first disassembly layer and removed from the assembly. Part sets that can be removed from the simplified assembly are then added to the second layer. If the process gets stuck, parts in the parent set are regrouped, and the process continues until all disassembly layers are found. The resulting structure reveals precedence relationships among part sets, which can be used to generate feasible assembly sequences for each part set and the whole assembly. We present theoretical results related to the algorithms developed in the paper. Computational results from tests on a variety of assemblies are presented to illustrate our approach.
机译:在本文中,我们提出了一种结合运动计划和零件交互作用簇来改善装配优先约束的技术。尤其是,此技术会自动找到会相互影响彼此可访问性的零件并对其进行聚类,从而可能会施加装配约束。这样就可以生成准确的优先级约束,而无需检查所有可能的组装顺序。给定一个装配模型,我们的技术会生成潜在的拆卸层:使用空间聚类来生成零件集。接下来,基于具有多个树的快速探索随机树(RRT)的运动计划可用于评估这些零件集之间的交互作用。具体来说,运动计划用于确定可以从装配中删除哪些零件组。这些集合将添加到第一拆卸层并从装配中删除。然后可以从简化装配中删除的零件集将添加到第二层。如果过程卡住,则将父集中的零件重新组合,然后过程继续进行,直到找到所有拆卸层为止。结果结构揭示了零件集之间的优先关系,可用于为每个零件集和整个装配生成可行的装配顺序。我们提出与本文开发的算法相关的理论结果。给出了各种装配体测试的计算结果,以说明我们的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号