Research on multi-constrained harness layout algorithm for harness pre-assembly
The harness is composed of a group of harness segments connected in a tree structure.It is a wiring component connecting electrical equipment in aircraft,automobile,and other products.To improve assembly efficiency,complex wiring harnesses need to be pre-assembled on an assembly board.This involves placing the wiring harnesses on the assembly board in a way that meets process constraints such as angle,distance,intersection,and boundary.This presents a multi-constrained harness layout problem.The paper drew upon a graph layout method,transformed the wiring harness layout into an optimization problem,and employed SGD to optimize a randomly selected pair of harness segments each time,gradually iterating and converging.Due to harness segments being rigid bodies with constant length,moving one segment could affect other segments,leading to oscillations in the SGD iteration process and making convergence difficult.Therefore,a bidirectional transmission segment movement algorithm was proposed to minimize the impact on other segments while ensuring that the segment moved to the target position.Both synthetic cases and a real case of an aircraft wiring harness were used for effectiveness verification,and the results showed that various process constraints could be met,and production requirements for wire harness pre-assembly could be satisfied.
NETL
NSTL
万方数据
