面向3D打印的机械包装最优化处理算法研究

发布时间：2018-05-22 08:27

本文选题：NP难问题 + 装箱问题　；参考：《郑州大学》2017年硕士论文

【摘要】：3D打印技术是一种以三维数字形式立体构造物理对象的快速成型技术,它对世界各国的制造业产生重要影响,并被誉为引领“第三次工业革命”的重要技术之一。随着3D打印技术、计算机辅助设计等技术在制造业的应用不断加深,用户对设备的功能、样式、造价等方面都可以进行定制,因此产品的型号越来越丰富,并且产品的制造工艺和制造复杂度也越来越复杂。同时,机械设备的存放和运输时的包装问题和产品使用过程中设备维修问题也随之而来。本文提出的机械包装最优化处理算法,通过分析机械模型的装配信息,包括零件空间位置、运动传递方式、零件干涉情况、装配体中零件连接拓扑结构等来解决机械模型的包装问题和维修最小化路径规划问题。在解决机械模型的包装问题时,提出一种新的基于关节自由度的机械模型包装算法,其根据机械模型中每个关节的自由度构造解空间,并建立拆分方案搜索树,利用搜索算法选取候选拆解方案。调整并优化机械关节参数,最终获取在最少次数的拆分条件下获得满足目标空间利用率的最优拆分方案。在解决机械模型维修时非完全拆卸路径规划问题时,本文提出的机械维修最小化拆卸路径规划算法,将机械模型在非完全拆卸情况下,通过求取的机械模型装配序列和机械模型的拓扑结构,将目标拆卸零件在花费最少的情况下拆卸下来。实验表明,本文提出的包装最优化处理算法,针对机械模型包装问题,该算法能够极大地提高机械模型包装的空间利用率,同时相对其他算法减少了机械模型的拆卸次数;针对将机械模型的维修问题,该算法能够极大地减少机械模型维修时零件拆卸数量,降低拆卸时间花费和设备维修成本。
[Abstract]:3D printing technology is a kind of rapid prototyping technology, which constructs physical objects in three-dimensional digital form. It has an important influence on the manufacturing industry all over the world and is regarded as one of the important technologies leading the "third Industrial Revolution". With 3D printing technology, computer aided design and other technologies in the manufacturing industry continue to deepen, users can customize the function, style and cost of the equipment, so the product models are more and more abundant. And the manufacturing process and manufacturing complexity of the products are becoming more and more complex. At the same time, the storage and transportation of mechanical equipment packaging problems and equipment maintenance problems in the process of use also followed. By analyzing the assembly information of the mechanical model, including the space position of the parts, the mode of motion transfer, the interference of the parts, the algorithm of the optimization processing of the mechanical packaging is put forward in this paper. The assembly parts are connected with topological structure to solve the packaging problem of the mechanical model and the maintenance minimization path planning problem. In order to solve the packaging problem of mechanical model, a new packaging algorithm of mechanical model based on joint freedom is proposed, which constructs the solution space according to the degree of freedom of each joint in the mechanical model, and establishes the search tree of split scheme. The candidate disassembly scheme is selected by searching algorithm. The mechanical joint parameters are adjusted and optimized to obtain the optimal split scheme satisfying the target space utilization under the condition of the least number of splits. In order to solve the problem of incomplete disassembly path planning in mechanical model maintenance, this paper proposes a minimum disassembly path planning algorithm for mechanical maintenance. The assembly sequence of the mechanical model and the topological structure of the mechanical model are obtained to remove the target disassembly parts with minimal cost. The experimental results show that the proposed algorithm can greatly improve the space utilization ratio of the mechanical model packaging and reduce the number of disassembly of the mechanical model compared with other algorithms. In order to solve the problem of mechanical model maintenance, the algorithm can greatly reduce the number of parts disassembled, the cost of disassembly time and the maintenance cost of equipment.
【学位授予单位】：郑州大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP391.73;TP301.6

【相似文献】