• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>The International Journal of Advanced Manufacturing Technology >Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product
【24h】

Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product

机译：基于GAAA并通过装配路径反馈优化复杂产品的装配序列计划的高效方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In the process of complex product assembly, assembly resources (fixtures, tools, operations, and so on) must enter assembly environment with parts together to rapidly finish product assembly. Assembly planning must take assembly resources into account fully. But, designer cannot plan every assembly procedure because of the lack of assembly resources during assembly design. Then, it will cause assembly failures and redesign for assembly easily. This paper investigates an efficient method of assembly sequence planning based on genetic algorithm and ants algorithm (GAAA) and optimizing by assembly path feedback to assembly process planning including assembly resources for complex products. Firstly, a new GAAA is investigated to rapidly plan assembly sequence in order to solve the nondeterministic polynomial-bounded problem in high searching and solving efficiency. Secondly, on the basis of the assembly sequence, a B-Rep filling algorithm which can form a swept volume between the part and its kinetic orientation is developed to plan assembly path interactively. Thirdly, the performance of the assembly path according to the assembly sequence is analyzed and sent back to avoid the most of assembly collisions and interventions during product assembly design. Lastly, we develop a simulating system to simulate assembly sequence and path based on component application architecture for CATIA V5. The simulating result proved that the proposed method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex products is efficient. Assembly optimal design including assembly resources can work well.
机译：在复杂的产品组装过程中，组装资源（夹具，工具，操作等）必须与零件一起进入组装环境，以快速完成产品组装。装配计划必须充分考虑装配资源。但是，由于组装设计期间缺少组装资源，设计人员无法计划每个组装过程。然后，它将导致组装失败并容易地重新设计组装。本文研究了一种基于遗传算法和蚂蚁算法（GAAA）的有效的装配序列计划方法，并通过装配路径反馈对包括复杂产品的装配资源在内的装配过程计划进行优化。首先，研究了一种新的GAAA来快速规划装配顺序，以解决不确定性多项式有界的问题，从而提高了搜索和求解效率。其次，根据装配顺序，开发了一种B-Rep填充算法，该算法可以在零件及其动力学方向之间形成掠过的体积，以交互方式规划装配路径。第三，根据组装顺序分析组装路径的性能，并将其发送回去，以避免在产品组装设计过程中发生大多数组装冲突和干预。最后，我们开发了一个基于CATIA V5的基于组件应用程序体系结构的仿真系统，以仿真装配顺序和路径。仿真结果表明，所提出的基于GAAA的装配序列计划方法以及通过装配路径反馈对复杂产品进行优化的方法是有效的。包括装配资源在内的装配优化设计可以很好地工作。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号