在固定拓扑结构中自动布置分支电缆的新型多项式时间算法

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Computer-Aided Design Pub Date : 2024-06-05 DOI:10.1016/j.cad.2024.103736
Liyun Xiao , Tian-Ming Bu , Jiangtao Wang
{"title":"在固定拓扑结构中自动布置分支电缆的新型多项式时间算法","authors":"Liyun Xiao ,&nbsp;Tian-Ming Bu ,&nbsp;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":50632,"journal":{"name":"Computer-Aided Design","volume":"175 ","pages":"Article 103736"},"PeriodicalIF":3.0000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology\",\"authors\":\"Liyun Xiao ,&nbsp;Tian-Ming Bu ,&nbsp;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\":50632,\"journal\":{\"name\":\"Computer-Aided Design\",\"volume\":\"175 \",\"pages\":\"Article 103736\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer-Aided Design\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0010448524000630\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer-Aided Design","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010448524000630","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

摘要

复杂机电产品的布局设计涉及到自动铺设电缆这一具有挑战性的任务。由于分支电缆具有多个连接端子和分支,因此更加复杂。本文提出了一种基于动态编程的多项式时间布线算法,在给定线束电气定义的情况下,确定电缆布局设计中的分支点位置。该方法考虑了各种工程约束,包括避开障碍物、贴墙、最小弯曲半径和灰色区域。为了验证我们的方法,我们基于 UG 平台,通过二次开发实现了一个分支电缆自动布局系统。实验结果表明,我们的方法非常有效,在时间和高质量布局方面表现出色。这展示了该方法在复杂机电系统电缆布局设计中的实际应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer-Aided Design
Computer-Aided Design 工程技术-计算机:软件工程
CiteScore
5.50
自引率
4.70%
发文量
117
审稿时长
4.2 months
期刊介绍: Computer-Aided Design is a leading international journal that provides academia and industry with key papers on research and developments in the application of computers to design. Computer-Aided Design invites papers reporting new research, as well as novel or particularly significant applications, within a wide range of topics, spanning all stages of design process from concept creation to manufacture and beyond.
期刊最新文献
Editorial Board Plate Manufacturing Constraint in Topology Optimization Using Anisotropic Filter Feature-aware Singularity Structure Optimization for Hex Mesh Fast algorithm for extracting domains and regions from three-dimensional triangular surface meshes Higher-degrees Hybrid Non-uniform Subdivision Surfaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1