汽车线束内联工艺自动规划算法  

Algorithm of inline automatic planning of automotive wiring harness

作　　者：凌欣南 张龙[2] 徐本柱[2] 

机构地区：[1]合肥江淮新发汽车有限公司,安徽合肥230601 [2]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2014年第4期407-411,448,共6页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(61070124);安徽省自然科学基金资助项目(1308085MF102);中央高校基本科研业务费专项资金资助项目(2012HGBZ0195)

摘　　要：线束内联设计是线束生产的重要环节,文章通过总结线束工艺设计中的工程语义相关定义及约束信息,建立内联回路自动提取算法模型,提出了一种线束内联自动规划方法。该方法通过主内联点选择、有向树的根结点提取,采用广度优先搜索算法遍历内联回路,获得广度优先搜索数实现对内联设计自动规划,而无需与用户进行交互。实例表明该方法是有效可行的,能较好地解决大线束图纸中装配序列规划问题。Wiring harness inline design is an important part of the wiring harness production .By sum-ming up the engineering semantics related definitions and constraint information in the design of the harness technology ,the inline circuit automatic extraction algorithm is established ,and an algorithm of inline automatic planning of automotive wiring harness is proposed .Through the selection of the main inline point and the extraction of root in the directed tree ,the inline circuit is traversed by using the breadth-first search algorithm ,and the automatic planning of the inline design can be achieved by the obtained breadth-first search node number without interacting with the user .The example shows that the algorithm is effective and feasible ,and can better solve the assembly sequence planning prob-lems in large wire drawing .

关 键 词：语义模型 线束内联回路自动提取算法 线束内联规划算法 工艺文件 

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