基于知识的装配顺序规划优化方法  

Assembly Sequence Planning Optimization Method Based on Knowledge

作　　者：柳振兴[1] 李原[1] 张开富[1] 余剑峰[1] 

机构地区：[1]西北工业大学,西安710072

出　　处：《中国机械工程》2009年第21期2571-2574,共4页China Mechanical Engineering

基　　金：国家863高技术研究发展计划资助项目(2007AA041903)

摘　　要：提出了一种基于知识的装配顺序规划优化方法,使用矩阵和集合的形式表达产品、装配资源以及产品与装配资源之间的对应关系知识,建立了信息比较全面的集成产品与装配资源的知识模型,并在装配知识模型的基础上,利用笛卡尔乘积算法,生成了可行的装配顺序,然后从装配方向的变更、装配工具的变更以及装配操作的聚合性等方面进行优化,从而得到最佳的装配顺序。最后,通过一个实例验证了该方法的有效性。An assembly sequence planning method tor mechanical products and assembly resources based on knowledge was put forward. Matrix and set were used to represent the products, assembly resources and their relationship. The knowledge model of integrating products and assembly resources was set up by means of extended matrix. Supported by above knowledge model, by making use of the Cartesian product algorithm, an approach to make constraint relationship and the assembly sequence planning method based on knowledge for mechanical products and assembly resources were both presented. In order to obtain optimal assembly sequence, three optimization factors were used to he the evaluation standards. Finally, a simple case is provided to illustrate the effectiveness of the proposed method.

关 键 词：装配知识模型 约束计算 装配顺序规划 装配顺序优化 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]