{"title":"A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology","authors":"Liyun Xiao , Tian-Ming Bu , Jiangtao Wang","doi":"10.1016/j.cad.2024.103736","DOIUrl":null,"url":null,"abstract":"<div><p>Designing the layout for complex electromechanical products involves the challenging task of automatically laying out cables. This challenge is particularly pronounced in the case of branch cables, which are more intricate due to their multiple connection terminals and branches. This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness. The method considers various engineering constraints, including obstacle avoidance, wall adherence, minimum bend radius, and gray areas. To validate our method, we implemented a branch cable auto-layout system through secondary development based on the UG platform. The experimental results indicate the effectiveness of our approach, demonstrating promising performance in terms of time and high-quality layouts. This showcases its potential for practical application in cable layout design for complex electromechanical systems.</p></div>","PeriodicalId":3,"journal":{"name":"ACS Applied Electronic Materials","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Electronic Materials","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448524000630","RegionNum":3,"RegionCategory":"材料科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
Designing the layout for complex electromechanical products involves the challenging task of automatically laying out cables. This challenge is particularly pronounced in the case of branch cables, which are more intricate due to their multiple connection terminals and branches. This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness. The method considers various engineering constraints, including obstacle avoidance, wall adherence, minimum bend radius, and gray areas. To validate our method, we implemented a branch cable auto-layout system through secondary development based on the UG platform. The experimental results indicate the effectiveness of our approach, demonstrating promising performance in terms of time and high-quality layouts. This showcases its potential for practical application in cable layout design for complex electromechanical systems.
复杂机电产品的布局设计涉及到自动铺设电缆这一具有挑战性的任务。由于分支电缆具有多个连接端子和分支,因此更加复杂。本文提出了一种基于动态编程的多项式时间布线算法,在给定线束电气定义的情况下,确定电缆布局设计中的分支点位置。该方法考虑了各种工程约束,包括避开障碍物、贴墙、最小弯曲半径和灰色区域。为了验证我们的方法,我们基于 UG 平台,通过二次开发实现了一个分支电缆自动布局系统。实验结果表明,我们的方法非常有效,在时间和高质量布局方面表现出色。这展示了该方法在复杂机电系统电缆布局设计中的实际应用潜力。