Computer Science ›› 2026, Vol. 53 ›› Issue (3): 240-245.doi: 10.11896/jsjkx.250300101

• Computer Graphics & Multimedia • Previous Articles     Next Articles

Smooth Layout Method of Wiring Harness in Collaborative Convergence Point

GAO Jingyi, LUO Ruiming, LUO Yuetong   

  1. School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China
  • Received:2025-03-19 Revised:2025-07-22 Published:2026-03-12
  • About author:GAO Jingyi,born in 2000,postgraduate.His main research interest is computer graphics.
    LUO Yuetong,born in 1978,Ph.D,professor,is a member of CCF(No.17933M).His main research interests include data visualization,computer-aided design and computer graphics.
  • Supported by:
    National Natural Science Foundation of China(61877016,61602146).

Abstract: With the continuous advancement of electrification and intelligence,the wiring harnesses in products such as aircraft and automobiles have become increasingly numerous and complex,making their layout and installation more challenging.Nume-rous wiring harnesses are installed through a series of convergence points known as clamps,where a single harness may pass through multiple convergence points,and a single convergence point may contain multiple harnesses.If the layout of the wiring harness within the convergence point is not reasonable,it may lead to problems such as crossing and twisting between the wiring harnesses,which does not meet the requirements for smoothness of the wiring harness.Currently,engineers mainly manually adjust the layout of harnesses within convergence points based on experience.However,due to the large number of convergence points and their mutual influence,manual adjustment is not only labor-intensive but also difficult to achieve optimal results.To address this issue,this paper proposes a smoothness-oriented collaborative wiring harness layout algorithm in convergence points.The method firstly transforms the wiring harness layout within multiple convergence points into a set of optimization problems,obtaining a preliminary layout that meets the smoothness requirements through optimization solving.It mathematically models the wiring harness smoothness problem and uses optimization algorithms to obtain the layout of the harnesses within all convergence points,ensuring the smoothness of the harnesses.Then,a compact algorithm for ensuring the layout of the wiring harness is proposed,which maintains the smoothness of the wiring harness and compactly arranges the wiring harness within the convergence point to save installation space and increase the stability of the wiring harness.The proposed algorithm has been applied to the products of our partners,and through the testing of synthetic and actual cases,the results demonstrate the effectiveness of the method.

Key words: Harness assembly layout, Convergence points, Collaborative layout, Layout compact

CLC Number: 

  • TP391.72
[1]XU B Z,CHENG G C,LI Z Z,et al.Research on AutomaticLayout of wire harness Connection Graph Based on Forces-oriented Algorithm[J].Journal of Engineering Graphics,2010,31(6):171-177.
[2]NAFISEH M,GEORGES F.An Optimization Framework forThe Design of Cable Harness Layouts in Planar Interconnected Systems[J].Journal of Mechanical Design,2021,143(1):1-29.
[3]KARLSSO T,ÅBLAD E,HERMANSSON T.Automatic Cable Harness Layout Routing in a Customizable 3D Environment[J].Computer-Aided Design,2024,169:103671.
[4]ZHAO L.Optimal Design of forklift harness[J].AutomotiveElectrical Appliances,2023(6):1-5.
[5]CHEN H M.Optimal Design and Reliability Analysis of Automotive Wiring Harness[D].Shanghai:Shanghai Jiao Tong University.2023.
[6]LUO Y T,PENG J,GAO J Y,et al.Research on multi-con-straint wiring harness layout method for wiring harness preassembly[J].Chinese Journal of Graphics,2024,45(1):1-10.
[7]CHEN L.Circle Packing theory and generalization of SchwarzLemma in general form[D].Chongqing:Chongqing University,2023.
[8]CHEN M,YANG Y.A filtered beam search based heuristic algorithm for packing unit circles into a circular container[J].Computers and Operations Research,2024,166:106636.
[9]HE K,TOLE K.Adaptive large neighborhood search for solving the circle bin packing problem[J].Computers & Operations Research,2020,123:105140.
[10]BIRGIN E G,SOBRAL F N C,Minimizing the object dimensions in circle and sphere packing problems[J].Computers & Operations Research,2008,35(7):2357-2375.
[11]TAN S Y.Numerical study of natural convection in annular units and arrangements in heat exchangers and helical coils[D].Beijing:University of Chinese Academy of Sciences.2020.
[12]ZHANG L Y,LIU Z.Bifurcation characteristics and transition law of periodic vibration of two-degree-of-freedom symmetric rigid constraint system[J].Journal of Guilin Institute of Aerospace Industry,2024,29(3):305-312,341.
[13]CHEN H S,YE J H,HU Z J,et al.L-BFGS Algorithm for Solving Non-convex Regularization Problems[J].Journal of Xiangtan University(Natural Science Edition),2023,45(6):69-77.
[14]LI Y H.Research of Integration Technology between CATIA and TOOLMANAGER Based on CAA[J].International Journal of Advanced Network,Monitoring and Controls,2016,2016(1):1-6.
[1] SONG Haichuan, QIU Sunhong, WANG Xinxing, LI Yijin, CHEN Zhenhua, CHEN Xiaodiao. Fast Contour-based Object-space Hidden Line Removal Algorithm for Mesh [J]. Computer Science, 2025, 52(4): 222-230.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!