A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology

• Published in: Computer aided design Vol. 175; p. 103736
• Main Authors: Xiao, Liyun, Bu, Tian-Ming, Wang, Jiangtao
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.10.2024
• Subjects: Automatic cable layout; Branching cables; Dynamic programming; Optimized cable routing; UG secondary development; Branching cables; Optimized cable routing; Automatic cable layout; Dynamic programming; UG secondary development
• ISSN: 0010-4485; 1879-2685
• DOI: 10.1016/j.cad.2024.103736

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. •Design of a polynomial-time dynamic programming algorithm for branching cable layout.•Consider constraints like wall adherence, gray areas, and minimum bend radius.•Implementation on the UG platform to fully realize automatic wiring functionality.