阅读说明：本技术 一种在限定二维空间内的线束树状结构布线方法 (Wiring method of wiring harness tree-shaped structure in limited two-dimensional space ) 是由 余厚云 张辉 王梦斐 于 2019-10-11 设计创作，主要内容包括：本发明公开一种在限定二维空间内的线束树状结构布线方法,以树状结构从设计原理图中快速准确地读取线束拓扑关系,并结合电缆导线表提供的导线规格及数量信息,在限定的二维平面范围内自动完成布线,从而实现线束布线图的快速自动生成,有效提高了线束制造效率和自动化程度,有效解决了目前线束布线图主要由工艺人员手工绘制,费时费力且规范性差,维护和修改难度大等缺点。(The invention discloses a wiring method of a wiring harness tree structure in a limited two-dimensional space, which is characterized in that a tree structure is used for quickly and accurately reading the topological relation of wiring harnesses from a design schematic diagram, and wiring is automatically completed in a limited two-dimensional plane range by combining with the specification and quantity information of wires provided by a cable wire meter, so that the quick automatic generation of the wiring harness diagram is realized, the manufacturing efficiency and the automation degree of the wiring harnesses are effectively improved, and the defects that the conventional wiring harness diagram is mainly drawn by a craft worker manually, time and labor are wasted, the standardization is poor, the maintenance and modification difficulty is high and the like are effectively overcome.)

1. A wiring harness tree structure wiring method in a limited two-dimensional space is characterized by comprising the following steps:

step 1, importing a wiring harness schematic diagram, reading node names and length information of each wiring harness segment from the wiring harness schematic diagram, and acquiring a wiring harness tree-shaped structure topological relation;

step 2, sequencing all root nodes in the order from left to right in the wiring harness schematic diagram, starting from each root node, calculating the branch lengths from the root node to all the tail nodes of the root node, and finally sequencing all wiring harness sections according to the branch lengths;

step 3, calculating the minimum enveloping diameter of each wire harness section according to the wire specification and number provided by the cable wire table;

step 4, traversing all root nodes in the wiring harness schematic diagram, sequentially connecting the root nodes to form a trunk line, and distributing the trunk line at the central position in the width direction in the plane of the two-dimensional wiring board;

and 5, wiring the trunk line and the branches of each root node from the first root node according to the sequence number of each wire harness segment and the minimum envelope diameter of each wire harness segment, wherein the branches of two adjacent root nodes are respectively distributed on two sides of the trunk line.

2. The method for routing the tree structure of the wire harness in the defined two-dimensional space according to claim 1, wherein the definition of each level of the nodes of the step 1 and the naming rules thereof comprise:

(1) defining nodes with only one branch in the wiring harness schematic diagram as end nodes, wherein the end nodes are uniformly named according to terminal names marked in the wiring harness schematic diagram;

(2) finding out the last node at the leftmost side in the wire harness schematic diagram, naming the node at the other end connected with the last node as a first root node A, traversing all nodes connected with the first root node A except the last node, selecting the node with the most branches as a second root node B, and so on, determining all root nodes C, D, E and … one by one until the last root node meets the condition that all connected nodes except the previous root node are the last nodes;

(3) other child nodes in the wire harness schematic diagram are named according to the levels on the basis of the names of the root nodes.

3. The wiring harness tree structure routing method in the defined two-dimensional space according to claim 1, wherein the step of obtaining the topological relation of the wiring harness tree structure of the step 1 comprises:

step 1.1) starting from a first root node, judging whether a current root node has a child node which is not retrieved, if not, directly switching to a next root node;

step 1.2) if the current root node has the sub-node which is not searched, searching the sub-node and continuously traversing all the next-level sub-nodes of the sub-node downwards according to the tree structure until the current root node reaches the end node;

step 1.3) repeating steps 1.1) to 1.2) until the last root node is finished.

4. A wiring harness tree structure routing method within a defined two-dimensional space according to claim 3, wherein the sub-step of step 1.2) comprises:

step 1.2.1) judging whether the current child node has a next-level child node which is not retrieved;

step 1.2.2) if the current child node does not have a next-level child node which is not retrieved, returning to the previous-level child node;

step 1.2.3) if the current child node has a next-level child node which is not retrieved, retrieving the child node;

step 1.2.4) repeat steps 1.2.1) to 1.2.3) until all child nodes of the current root node are traversed.

5. The wiring harness tree structure routing method in the defined two-dimensional space according to claim 1, wherein the specific step of the wiring harness segment ordering of step 2 comprises:

step 2.1) starting from any root node, counting branches from the root node to all the end nodes of the root node;

step 2.2) calculating the length of each branch according to the length of the wire harness segment provided in the wire harness schematic diagram;

step 2.3) arranging the wire harness segments of the longest branch according to the sequence of the branch lengths from large to small, and sequentially setting the serial numbers of the wire harness segments as 1, 2, 1.

Step 2.4) next arranging secondary long branches, keeping the original serial numbers of the numbered wire harness segments unchanged, and sequentially setting the serial numbers of the unnumbered wire harness segments as m +1, m +2, n;

and 2.5) repeating the steps until finishing the sequencing of all the cable bundle segments of the current root node.

6. The wiring harness tree structure routing method in the defined two-dimensional space according to claim 1, wherein the specific steps of the step 3 comprise:

step 3.1) determining a connection path between the tail nodes according to the connection relation between the terminals provided by the cable lead table;

step 3.2) counting the specification and the number of the wires of all the wire harness sections passed by the path, and then calculating the minimum envelope diameter of each wire harness section according to the following formula (1):

n is the number of the wires contained in the wire harness section, and Max is the maximum diameter of the wires in the wire harness section.

7. The wiring harness tree structure routing method in the defined two-dimensional space according to claim 1, wherein the specific steps of the step 5 comprise:

step 5.1) determining a wiring range of a wiring harness according to the specification and the size of the two-dimensional wiring board, and initializing a plane coordinate system of the two-dimensional wiring board;

step 5.2) arranging a first node at the central position on the left side of the plane of the wiring board, and then sequentially determining the positions of other nodes to the other side according to the diameter and the length of a wire harness section between the nodes, thereby completing the wiring of the trunk line;

step 5.3) starting from the first root node, determining a routable area of a branch of the current root node according to the boundary width of the plane of the two-dimensional wiring board and the distributed positions of other branches, and setting a wiring angle, namely an included angle between the wiring direction and the extension direction of the trunk line;

step 5.4) selecting the branch with the longest length in the un-wired wire harness for wiring according to the serial number of the wire harness segment;

step 5.5) repeating the steps 5.3) to 5.4) until the wiring of all branches of the current root node is completed;

and 5.6) switching to the next root node, and repeating the steps 5.3) to 5.5), wherein the branches of two adjacent root nodes are arranged on two sides of the trunk line until the wiring of all the root node branches is completed.

8. The wiring harness tree structure routing method in a defined two-dimensional space according to claim 7, wherein the sub-step of step 5.4) comprises:

step 5.4.1) starting wiring according to the sequence number of the arranged wire harness segments by taking the current root node (StartX, StartY) as a starting point;

step 5.4.2) setting the wiring angle as theta, and if the Length of the currently distributed wire harness segment is Length, calculating terminal node coordinates (EndX, EndY) of the wire harness segment according to the following formula (2) and judging whether the terminal node coordinates exceed the routable area;

EndX＝StartX+Length·cosθ

EndY＝StartY+Length·sinθ (2)

step 5.4.3) if the node does not exceed the routable area, completing the routing of the current wire harness section, otherwise, bending the exceeding part to the OX axis along the upper boundary of the routable area in the positive direction so as to enable the whole wire harness section to be in the routable area;

and 5.4.4) repeating the steps 5.4.2) to 5.4.3) by taking the current node as a new starting point until the wiring of all the wire harness sections on the current branch is finished.

Technical Field

The invention belongs to the field of wire harness manufacturing, and relates to a wire harness tree-shaped structure wiring method in a limited two-dimensional space.

Background

With the continuous development of electronic technology, the number of airborne (or vehicle-mounted or ship-mounted) electrical devices in the fields of aerospace, automobile, ship manufacturing and the like is increased, and the power grid is also more complicated. The various wire harnesses distributed all over the machine become bridges and ties which penetrate through the electrical systems and the electronic equipment of all parts of the machine, and the communication among all the parts is related to form a complex integrated network. Therefore, the full-size wire harness is figuratively liked to the "central nerve and blood circulation system", and thus it is seen that the wire harness has an important meaning for the function and safety of an airplane, an automobile, a ship, or the like.

Drawing a wiring diagram is an essential procedure in the manufacturing process of the wiring harness, the traditional wiring method is manually completed by a technician according to design requirements, the drawing is not standard and is inconvenient for unified management, and once errors occur or new design modification occurs, the wiring diagram needs to be redrawn, so that the efficiency in the aspect of processing the complex wiring harness is extremely low. With the higher and higher requirements of modern industry on intelligent manufacturing capability of products, the traditional manual wiring can not meet the requirements of production scheduling and digital management, so that an automatic rapid wiring technology is urgently needed to be developed.

Disclosure of Invention

In order to solve the defects of low efficiency, non-uniform standard and the like of manually drawing a wiring diagram by a technician, the invention provides the wiring method of the wiring harness tree structure in the limited two-dimensional space, which improves the wiring efficiency of the wiring harness and the drawing consistency of the wiring diagram, leads the wiring result to be more reasonable, has higher space utilization rate and can realize the digital management of wiring harness data.

In order to achieve the purpose, the invention adopts the following technical scheme:

a wiring harness tree structure routing method in a limited two-dimensional space comprises the following steps:

step 1, importing a wiring harness schematic diagram, reading node names and length information of each wiring harness segment from the wiring harness schematic diagram, and acquiring a wiring harness tree-shaped structure topological relation;

step 2, sequencing all root nodes in the order from left to right in the wiring harness schematic diagram, starting from each root node, calculating the branch lengths from the root node to all the tail nodes of the root node, and finally sequencing all wiring harness sections according to the branch lengths;

step 3, calculating the minimum enveloping diameter of each wire harness section according to the wire specification and number provided by the cable wire table;

step 4, traversing all root nodes in the wiring harness schematic diagram, sequentially connecting the root nodes to form a trunk line, and distributing the trunk line at the central position in the width direction in the plane of the two-dimensional wiring board;

and 5, wiring the trunk line and the branches of each root node from the first root node according to the sequence number of each wire harness segment and the minimum envelope diameter of each wire harness segment, wherein the branches of two adjacent root nodes are respectively distributed on two sides of the trunk line.

Further, the definition and naming rule of each level of nodes in step 1 are as follows:

(1) defining nodes with only one branch in the wiring harness schematic diagram as end nodes, wherein the end nodes are uniformly named according to terminal names marked in the wiring harness schematic diagram;

(2) finding out the last node at the leftmost side in the wire harness schematic diagram, naming the node at the other end connected with the last node as a first root node A, traversing all nodes connected with the first root node A except the last node, selecting the node with the most branches as a second root node B, and so on, determining all root nodes C, D, E and … one by one until the last root node meets the condition that all connected nodes except the previous root node are the last nodes;

(3) other child nodes in the wire harness schematic diagram are named according to the levels on the basis of the names of the root nodes. For example, the primary child nodes of the root node a are sequentially named as AA, AB, AC, etc., and the secondary child nodes generated by the root node a through the primary child node AA are sequentially named as AAA, AAB, AAC, etc. And so on until the end node is reached.

Further, the step of obtaining the topological relation of the wire harness tree structure in the step 1 is as follows:

step 1.1) starting from a first root node, judging whether a current root node has a child node which is not retrieved, if not, directly switching to a next root node;

step 1.2) if the current root node has the sub-node which is not searched, searching the sub-node and continuously traversing all the next-level sub-nodes of the sub-node downwards according to the tree structure until the current root node reaches the end node;

step 1.3) repeating steps 1.1) to 1.2) until the last root node is finished.

Further, the step of traversing the next level of child nodes in the tree structure in the step 1.2) is as follows:

step 1.2.1) judging whether the current child node has a next-level child node which is not retrieved;

step 1.2.2) if the current child node does not have a next-level child node which is not retrieved, returning to the previous-level child node;

step 1.2.3) if the current child node has a next-level child node which is not retrieved, retrieving the child node;

step 1.2.4) repeat steps 1.2.1) to 1.2.3) until all child nodes of the current root node are traversed.

Further, the detailed steps of the wire harness segment ordering of step 2 are as follows:

step 2.1) starting from any root node, counting branches from the root node to all the end nodes of the root node;

step 2.2) calculating the length of each branch according to the length of the wire harness segment provided in the wire harness schematic diagram;

step 2.3) arranging the wire harness segments of the longest branch according to the sequence of the branch lengths from large to small, and sequentially setting the serial numbers of the wire harness segments as 1, 2, 1.

Step 2.4) next arranging secondary long branches, keeping the original serial numbers of the numbered wire harness segments unchanged, and sequentially setting the serial numbers of the unnumbered wire harness segments as m +1, m +2, n;

and 2.5) repeating the steps until finishing the sequencing of all the cable bundle segments of the current root node.

Further, the step of calculating the minimum envelope diameter of each beam segment in step 3 is as follows:

step 3.1) determining a connection path between the tail nodes according to the connection relation between the terminals provided by the cable lead table;

and 3.2) counting the specification and the number of the wires of all the wire harness sections passed by the path, and then calculating the minimum envelope diameter of each wire harness section according to a formula in the table 1. In table 1, N is the number of wires included in the bundle section, and Max is the maximum diameter of the wires in the bundle section.

TABLE 1 calculation formula for minimum enveloping diameter of wire harness segment

Further, the specific steps of wiring each wire harness segment in step 5 are as follows:

step 5.1) determining a wiring range of a wiring harness according to the specification and the size of the two-dimensional wiring board, and initializing a plane coordinate system of the two-dimensional wiring board;

step 5.2) arranging a first node at the central position on the left side of the plane of the wiring board, and then sequentially determining the positions of other nodes to the other side according to the diameter and the length of a wire harness section between the nodes, thereby completing the wiring of the trunk line;

step 5.3) starting from the first root node, determining a routable area of a branch of the current root node according to the boundary width of the plane of the two-dimensional wiring board and the distributed positions of other branches, and setting a wiring angle (an included angle between the wiring direction and the extension direction of the trunk line);

step 5.4) selecting the branch with the longest length in the un-wired wire harness for wiring according to the serial number of the wire harness segment arranged in the step 2;

step 5.5) repeating the steps 5.3) to 5.4) until the wiring of all branches of the current root node is completed;

and 5.6) switching to the next root node, and repeating the steps 5.3) to 5.5), wherein the branches of two adjacent root nodes are arranged on two sides of the trunk line until the wiring of all the root node branches is completed.

Further, the specific routing method of any branch in step 5.4) is as follows:

step 5.4.1) starting wiring according to the sequence number of the arranged wire harness segments by taking the current root node (StartX, StartY) as a starting point;

step 5.4.2) setting the wiring angle as theta, and if the Length of the currently distributed wire harness segment is Length, calculating terminal node coordinates (EndX, EndY) of the wire harness segment according to the following formula (2) and judging whether the terminal node coordinates exceed the routable area;

EndX＝StartX+Length·cosθ

EndY＝StartY+Length·sinθ (2)

step 5.4.3) if the node does not exceed the routable area, completing the routing of the current wire harness section, otherwise, bending the exceeding part to the OX axis along the upper boundary of the routable area in the positive direction so as to enable the whole wire harness section to be in the routable area;

and 5.4.4) repeating the steps 5.4.2) to 5.4.3) by taking the current node as a new starting point until the wiring of all the wire harness sections on the current branch is finished.

Has the advantages that:

1. the invention converts the topological relation of the wire harness into the data of the tree structure, clearly expresses the connection relation of the wire harness schematic diagram, and provides great convenience for the management, maintenance and use of the wire harness data.

2. According to the wiring harness layout method, on the basis of combining the graphic file with the form data, 1:1 layout of the wiring harness design schematic diagram is achieved, traditional manual operation is replaced, manufacturing efficiency and accuracy of the wiring harness are improved, and meanwhile, the wiring harness wiring process is digitized, so that design change and storage in the later period are facilitated.

3. The invention can automatically generate wiring paths according to the scale range of the two-dimensional wiring plane, draw the wiring harness wiring diagram meeting the actual field requirement, and has good compatibility for wiring workshops with different space sizes.

Drawings

FIG. 1 is a schematic diagram of a wiring harness of the present invention;

FIG. 2 is a diagram illustrating the result of naming nodes in a wire harness schematic according to the present invention;

FIG. 3 is a wiring harness tree topology diagram of a root node C of the present invention;

FIG. 4 is a wiring harness layout of the present invention;

FIG. 5 is a flow chart of the automatic routing algorithm of the present invention.

Detailed Description

The invention is further illustrated with reference to the following figures and examples.

Fig. 1 is a schematic diagram of a wiring harness introduced into the wiring system, and the schematic diagram of the wiring harness is marked with terminal names such as 10XP, 11XP and the like. Meanwhile, the wire harness schematic diagram also provides length information of each wire harness segment, such as L (A-10XP) ═ 200 (unit: mm) and the like.

Fig. 2 is a result of naming nodes at different levels in the wire harness schematic diagram, and the specific naming mode is as follows:

(1) naming the end node: the nodes with only one branch in the wiring harness schematic diagram are defined as end nodes, and the end nodes are uniformly named according to terminal names marked in the wiring harness schematic diagram, such as 10XP, 11XP and the like.

(2) Naming a root node: the last node 10XP at the leftmost side in the wire harness schematic diagram is found, and the node at the other end connected with the last node is named as a first node a. And traversing all the nodes connected with the first root node A except the tail node, and selecting the node with the most branches as a second root node B. And by analogy, all root nodes are determined one by one until the last root node D meets the condition that all the child nodes except the previous root node C are the end nodes.

(3) Naming child nodes: after the root node naming is completed, the other child nodes are named finally. Among them, the children of the root node A, B, D are all end nodes and do not need to be renamed. The root node C has a branch containing multiple levels of child nodes, and the next level of child nodes of C on the branch is named CA. Further, the child node CA has a next-level child node CAA.

Fig. 3 is a wiring harness tree topology relationship established by taking the root node C in fig. 2 as an example, and the specific steps are as follows:

(1) judging whether the root node C has child nodes, if not, directly switching to the next root node D, and if so, entering the next step;

(2) any child node of the root node C, e.g., 16XP, is retrieved. Since child node 16XP is the last node, it does not have the next level child node, and therefore returns to root node C;

(3) any new child node of the root node C, e.g. a CA, continues to be retrieved. The child node CA has a next level child node;

(4) any child node of the CA, e.g. 15XP, is retrieved. Since child node 15XP is the last node, it has no next level child node, and therefore returns CA;

(5) any new child node of the CA, e.g., CAA, continues to be retrieved. The subnode CAA has a next level subnode;

(6) any child node of the CAA, e.g. 13XP, is retrieved. Since child node 13XP is the last node, it does not have the next level child node, and therefore returns CAA;

(7) any new child node of the CAA, e.g. 14XP, is retrieved continuously. Since child node 14XP is the last node, it does not have the next level child node, and therefore returns CAA;

(8) the CAA does not have a new next-level child node, so the CA continues to return upwards;

(9) the CA also has no new next-level child node, so the CA continues to return to the root node C upwards;

(10) any new child node, e.g., 17XP, of the root node C continues to be retrieved. Since child node 17XP is the last node, it does not have the next level child node, and therefore returns to root node C;

(11) since root node C does not have a new next level child node, go to the next root node D.

According to the topological relation of the wire harness structure established in fig. 3, and in combination with the length information of each wire harness segment included in fig. 1 and 2, the wire harness segments on each branch are sorted by taking the root node C as an example, and the specific steps are as follows:

(1) counting branches from the root node C to all end nodes thereof, wherein the branch from the root node C to the end node 13XP is C → 13XP (C-CA-CAA-13 XP);

(2) the branch lengths are calculated according to the harness segment lengths, for example, the branch length L (C → 13XP) from the root node C to the end node 13XP is:

L(C→13XP)＝L(C-CA)+L(CA-CAA)+L(CAA-13XP)

＝700+200+500

＝1400

the calculation results of the branch lengths of the root node C are shown in table 2 below.

TABLE 2 Branch Length for root node C

Root node	End node	Branch length (mm)
			C	13XP	1400
C	14XP	1450
			C	15XP	2700
C	16XP	400
			C	17XP		500

(3) According to the branch length sequence, the wire harness sections passed by each branch are sequenced, and the method specifically comprises the following steps:

(a) firstly, arranging branches C → 15XP (C-CA-15XP) with the longest length, and respectively setting the serial number of a harness segment C-CA as 1 and the serial number of the harness segment CA-15XP as 2;

(b) then arranging the next long branch C → 14XP (C-CA-CAA-14XP), wherein the harness segment C-CA is already numbered 1, and only sequentially setting the serial number of the harness segment CA-CAA to be 3 and the serial number of the harness segment CAA-14XP to be 4;

(c) by analogy, the sorting results of the bundle segments passed by all branches of the root node C are shown in table 3 below.

TABLE 3 wire harness segments and their ordering for node C

Table 4 is a portion of the cable wire table corresponding to the schematic diagram of the wire harness shown in fig. 1, and the diameter of each wire harness segment can be calculated from the wire specifications and the number of wires provided in the table.

Table 4 part cable guide table

Taking the wire harness segment of the root node C as an example, the specific steps are as follows:

(1) determining paths of all branches passing through the root node C according to the connection relation between the terminals provided by the cable lead table;

(2) the number and specification of the wires of each wire bundle section belonging to the root node C on the paths are counted, and then the minimum envelope diameter of each wire bundle section is calculated according to the formula in the following table 1. In table 1, N is the number of wires included in the bundle section, and Max is the maximum diameter of the wires in the bundle section.

TABLE 1 calculation formula for minimum enveloping diameter of wire harness segment

For example, taking the wire harness segment C-CA as an example, the specific sub-steps are as follows:

(a) the path from the incoming terminal 10XP to the outgoing terminal 13XP is 10XP-A-B-C-CA-CAA-13XP and passes through the wire harness section C-CA. The wire W00001 on this path is of specification φ 1.27, thus adding 1 to the column of wire specification φ 1.27;

(b) repeating the process until the number of all the wires of various specifications passing through the cable harness section C-CA is counted, as shown in the following table 5;

(c) according to the formula in table 1 above, the number of wires N is 43+8+18+3 is 72, and the maximum diameter Max of the wires is 5mm, so the diameter of the bundle segment C-CA is:

(3) the diameters of the other line segment bundles of the root node C can be further calculated according to the method of step (2), and the calculation result is shown in table 6 below.

TABLE 6 respective wire harness segment diameters of node C

Finally, fig. 5 shows the automatic wiring of the wiring harness schematic diagram shown in fig. 1, and the result is shown in fig. 4, which includes the following steps:

(1) initializing a two-dimensional wiring board plane coordinate system

The two-dimensional wiring board is rectangular, the width is fixed to 1600mm, and the length can be spliced and extended according to the required wiring length. An origin O of a planar coordinate system is set at a central position near the left side of the wiring board, an OX axis normal direction coincides with a direction in which the length of the wiring board extends rightward, and an OY axis normal direction is perpendicular to the OX axis direction.

(2) Arranging trunk lines

The first root node A is arranged at the origin of the plane of the wiring board, and the coordinate of A is (0, 0). Reading the harness a-B to be 3800 in length, and the second root node B is set at the coordinates (3800, 0). By analogy, coordinates of the third node C and the fourth node D are sequentially obtained as (4600, 0) and (6100, 0).

(3) Placing branches of root node A

(a) Arranging the branch of A above the main line, taking the area with X >0 and 0< Y <750 in the plane as a routable area, and setting the initial value of a wiring angle (the included angle between the wiring direction and the positive direction of an OX axis) to be 160 degrees;

(b) according to the serial number of the arranged wire harness segments, the longest branch A → 11XP is distributed firstly. The coordinates of the end node 11XP are calculated as (-282, 103) according to equation (2), exceeding the range of the routable area. Then, the wiring angle is gradually reduced at intervals of 20 degrees until the wiring angle is adjusted to 80 degrees, the coordinate of 11XP is (52, 295), and the wiring angle is in the range of the routable region;

(c) the wiring angle was reduced to 60 ° on the basis of branch a → 11XP, and the other branch a → 10XP was wired. The coordinates of the end node 10XP are calculated as (100, 173) according to equation (2), and are within the routable area without adjustment.

(4) Arranging branches of a root node B

(a) According to the wiring rule, the branch of B is arranged below the trunk line. Taking a region with X >0, -750 < Y <0 in a two-dimensional plane as a routable region, and setting the initial value of a wiring angle to be 160 degrees;

(b) the root node B only has one branch B → 12XP, and the coordinates of the tail node 12XP are calculated as (3300, -171) according to the formula (2), and are within the range of the routing area without adjustment.

(5) Placing branches of root node C

(a) According to the wiring rule, the branch of C is arranged above the trunk line. Since the coordinate of the nearest end node 10XP on the same side is (100, 173), in order to avoid interference with a wired branch, a region with X >100 and 0< Y <750 in a two-dimensional plane is taken as a routable region of a branch of the root node C, and the initial value of a wiring angle is set to be 160 degrees;

(b) according to the serial number of the arranged wire harness segments, the wire harness segments C-CA are firstly arranged. Calculating the coordinates (3942, 239) of the child nodes CA according to the formula (1), wherein the child nodes CA are located in the range of the routable area and do not need to be adjusted;

(c) next, the bundle segment CA-15XP is routed. The coordinates of the end node 15XP are calculated as (2063, 924) according to equation (2) keeping the previous layout angle unchanged, exceeding the range of the routable area. Bending the excess part to the OX axis along the upper boundary of the wiring area, wherein the coordinates of the bending point are (2539, 750), and the coordinates of the end node 15XP are recalculated to be (3047, 750) after bending;

(d) according to Table 6, the diameter of the bundle segment CA-15XP is 47.42. The routable region is thus readjusted, on the basis of the inflection point, to be translated in a positive 100 along the OX axis and in a negative 50 along the OY axis, i.e. the region in the two-dimensional plane X >2639, 0< Y <700 is taken as a new routable region;

(e) the bundle segments CA-CAA are next routed, reducing the routing angle to 140. Calculating the coordinates of the sub-node CAA as (3789, 368) according to the formula (2), wherein the coordinates are within the range of the routing area and do not need to be adjusted;

(f) and keeping the wiring angle unchanged, and continuing wiring the beam segments CAA-14 XP. Calculating the coordinate of 14XP as (3369, 723) according to the formula (2), wherein the coordinate is in the range of the wiring-possible area and does not need to be adjusted;

(g) the harness segments CAA-13XP are next routed, reducing the routing angle to 120. The coordinates of 13XP were calculated as (3540, 802) according to equation (2), exceeding the range of the routable area. Bending the excess part to the OX axis along the upper boundary of the wiring area, wherein the coordinates of a bending point are (3601, 700), and the coordinates of the last node 13XP are recalculated to be (3719, 700) after bending;

(h) and continuing to sequentially finish the wiring of the wire harness segments C-17XP and C-16XP according to the signals by analogy.

(6) Arranging branches of root node D

According to the wiring rule, the branches of the root node D are arranged below the trunk line, and the wiring process is similar to the above-described steps.

The foregoing has described only preferred embodiments of the present invention. Other advantages and modifications will readily occur to those skilled in the art from the foregoing description. Therefore, the present invention is not limited to the above embodiments, and one aspect of the present invention will be described in detail and exemplarily by way of example only. General changes and substitutions by those skilled in the art within the technical scope of the present invention are included within the scope of the present invention within the scope not departing from the gist of the present invention.