Complex wiring harness tooling board configuration design method

Abstract

The present invention discloses a complex harness tooling plate configuration design method, comprising the following steps: modeling a harness wiring process tree for the harness wiring process plate configuration; trunk design; branch reasoning; drawing layout; harness wiring configuration design; and space optimization. The present invention can complete the process plate configuration design of a complex harness, model the process plate wiring process tree, design the wiring configuration of the process plate according to the wiring process tree model, and perform space optimization on the wiring configuration. The generated harness tooling plate can be directly provided to operators to complete the wiring work, improve efficiency, and ensure the wiring accuracy of complex configuration harnesses, saving a lot of manpower and material technology costs for research and development units and production enterprises of aircraft, ships, etc., and has huge market application prospects.

Description

Technical Field

[0001] The invention relates to a wiring harness tooling plate design method, in particular to a complex wiring harness tooling plate configuration design method, and belongs to the technical field of large-scale equipment wiring harness routing. Background Art

[0002] Wire harness is an important and indispensable part of many products, equipment, and equipment, such as aircraft, ships, automobiles, and rail cars. Wire harness generally goes through three main stages from design to finished product: principle design, process design, and product production. In the principle design stage, the circuit principle design of the wire harness is completed and the wire table is generated; in the process design stage, the tooling drawing for process production is drawn according to the circuit schematic and wire table; finally, in the product production stage, the wire harness wiring is completed according to the tooling drawing.

[0003] The wiring process of the wire harness is generally as follows: print the paper tooling drawing and lay it flat on the wiring workbench, or project the electronic tooling drawing on the wiring platform. The tooling drawing shows the two-dimensional layout used to manufacture the wire harness. The operator needs to clearly see each node and the corresponding cable information in the tooling drawing, and strictly follow the process layout of the tooling drawing to wire the cables one by one. Therefore, the tooling drawing directly determines the efficiency and accuracy of the wiring.

[0004] Since process design is in the middle of the process from design to finished product, it plays a connecting role. An important task in process design is tooling drawing, which refers to the special process equipment used for wire harness production designed according to product configuration and size. The tooling drawing has four characteristics: the graphics are strictly consistent with the product size; the laying tracks are prohibited from crossing; the configuration is as close to the principle drawing as possible to avoid affecting the assembly; the special status of the trunk is emphasized, and the design of the drawing is centered on the trunk.

[0005] At present, there is no special automatic design system for complex wiring harness tooling drawings. Technicians still need to use Auto CAD and other general drawing tools to draw tooling drawings based on the circuit schematics and wire tables of the wiring harness. The circuit schematics only schematically represent the circuit connection relationship of the wiring harness, which is very different from the actual wiring harness layout configuration. The drawing of tooling drawings mainly relies on the experience of technicians and requires a lot of modifications and adjustments. For large equipment, such as aircraft and ships, due to the large number of wiring harnesses, complex wiring processes, complex wiring configurations and strong randomness, manual design of tooling drawings is adopted. For technicians, there are a series of problems such as difficult configuration design, difficult dimensional accuracy control, high design intensity, low efficiency, and easy errors.

[0006] Therefore, there is an urgent need for an automatic configuration method for complex wiring harness tooling drawings, which can complete the tooling drawing design of complex wiring harnesses and directly convert the principle design data into a tooling drawing that can be used as the basis for production wiring, replacing the manual redesign of the tooling drawing process, improving efficiency and ensuring accuracy. Summary of the invention

[0007] In order to solve the above-mentioned problems existing in the prior art, the present invention provides a method for designing the configuration of a complex wiring harness tooling drawing, which can complete the process drawing configuration design of a complex wiring harness, model the process drawing as a wiring trunk tree, and perform wiring configuration design of the process drawing according to the wiring trunk tree model through processing and analysis of the principle design data, and perform spatial optimization of the wiring configuration. The generated wiring harness tooling drawing can be directly provided to operators to complete the wiring work, thereby improving efficiency and ensuring the wiring accuracy of complex configuration wiring harnesses, saving a large amount of manpower and material and technical costs for research and development units and production enterprises of aircraft, ships, etc., and has huge market application prospects.

[0008] The objective of the present invention is achieved through the following technical solutions:

[0009] A complex wiring harness tooling plate configuration design method includes the following steps:

[0010] S1. Modeling the wiring harness trunk-branch tree for the wiring harness process layout configuration: define the elements in the wiring harness trunk-branch tree according to the wiring harness process layout configuration characteristics; use the wiring harness trunk-branch tree to represent the wiring harness data structure; the wiring harness trunk-branch tree is a new type of nonlinear data structure that inherits the basic definition of graph and tree, adopts the tree structure described by "root-trunk-branch", and emphasizes the master-slave relationship between the trunk and branches. It consists of a set N representing nodes and a set E representing the connectivity relationship of nodes, denoted by T=<N,E> .

[0011] S2. Wire harness tooling board design:

[0012] S21. Trunk design: parse the graphics and text descriptions in the circuit schematic, combine them with the wire table data, traverse the nodes and paths in the circuit schematic, and select the wiring harness trunk;

[0013] S22. Branch reasoning: After deciding on the trunk, reason out the branches of each order connected to the trunk, and reason out the branch root node, branch trunk and branch path of each order branch in turn, until all the path information of the harness is reasoned out;

[0014] S23. Drawing layout: According to the element composition of the wiring harness wiring trunk and branch tree, based on the trunk design and branch reasoning results, extract and further process the corresponding data in the circuit schematic and wire table, and draw the data processing results into a layout drawing;

[0015] S24. Wire harness wiring configuration design: Based on the drawing layout results, the wire harness wiring configuration is designed, from the trunk, high-order branches, to the low-order branches, iterative design is carried out to ensure that the branches have no interference with the trunk and branches of the same order, and form a wiring configuration design drawing;

[0016] S25. Space optimization: According to the board size requirements, the wiring configuration design drawing completed in step S24 is space optimized to form a wiring harness wiring tooling board.

[0017] Furthermore, the wiring harness wiring trunk tree includes the following elements:

[0018] Degree of a node: The number of edges connecting a node is called the degree of the node;

[0019] External node: A node with degree 1 is called an external node;

[0020] Internal nodes: Nodes with degree greater than 1 are called internal nodes;

[0021] Root node: There is only one external node in the wiring harness wiring trunk and branch tree, which is defined as the root node;

[0022] Leaf node: The external node other than the root node is called a leaf node;

[0023] Path: From node a to node b, there is a unique set of edges that do not contain repeated edges, which is called the path from a to b, denoted by R(a,b);

[0024] Trunk: Select a leaf node f, and the path R(r,f) from the root node r to f is defined as the trunk; any path that can be defined as a trunk is called a candidate trunk, and the set consisting of all candidate trunks is called a candidate trunk set. There is only one candidate trunk set that eventually becomes the trunk;

[0025] Branching: There are only two nodes with degree 1 in the trunk, namely the root and the leaf node, and the degree of other nodes is 2; the remaining edges after removing the trunk M from the trunk-branch tree T constitute n connected edge sets, and each connected edge set and the nodes it contains are defined as a branch of the trunk-branch tree T;

[0026] Orders of a trunk-branch tree: The trunk of a trunk-branch tree is called the 1st-order trunk, and its branches are called 1st-order branches; the branch trunk of the 1st-order branch is defined as the 2nd-order trunk, the branches of the 2nd-order trunk are defined as the 2nd-order branches, and so on.

[0027] Furthermore, in the trunk design step, the volume of each path segment of each candidate trunk is calculated by traversing through the following decision formula, and the candidate trunk with the largest total volume is determined as the trunk:

[0028]

[0029] Where V(i) refers to the volume of the i-th candidate backbone, Sk is the end area of ​​the kth wire, lj is the length of the jth edge constituting the path, and 0<δ≤1 is the suppression factor.

[0030] Furthermore, in the branch reasoning step, the branch root node reasoning logic is: if branch b is the path of harness t, ttns is the trunk node set of harness t, ns is the node set of branch b, node n is included in ns, and node n is also included in ttns, then node n is the root node of branch b;

[0031] The branch-trunk reasoning logic is: if r is the root node of branch t, ​​f is the leaf node of the branch, and rt is the path from r to f, then rt is a candidate trunk; if r is a candidate trunk of branch b, rs is the candidate trunk set of branch b, and when r has the highest decision probability in the candidate set rs, then r is the branch trunk of branch b.

[0032] Furthermore, the drawing lofting step includes the following processes:

[0033] 1) Construct three queues: a queue of nodes with determined positions, a queue of nodes with positions to be determined, and a queue of edges to be processed;

[0034] 2) The root nodes of the wiring harness trunk and branch tree are classified into the queue of nodes with determined positions, and the other nodes are classified into the queue of nodes with undetermined positions, and the edge set data is stored in the queue of edges to be processed;

[0035] 3) Scan the queue of pending edges. If one node n1 of edge e has the same node code as fn1 in the queue of nodes with determined positions, and another node n2 has the same node code as fn2 in the queue of pending positions, then calculate the vector In the direction of the circle, make a circle with fn1 as the center and the nominal value of the edge as the radius, and make the ray fn1fn2 so that it intersects the vector The directions are the same, and the intersection point is the staked position of fn2;

[0036] 4) After fn2 is assigned a new position, it is moved from the queue of nodes to be determined to the queue of processed nodes, and jumps to step 3 until the queue of nodes to be processed is empty, terminating the layout process, updating the concentrated node position of the wiring harness wiring trunk and branch tree edge, and the layout is completed.

[0037] Furthermore, the wiring harness routing configuration design step includes the following process:

[0038] a. Rotate all paths in the trunk to a straight line. For each order of branches, rotate all paths in the branch trunk to the same straight line. During the rotation process, pull other paths in the branch to rotate together.

[0039] b. If all lower-order branches of the i-th order branch are in a fixed state, build a data stack and a fact stack for the branch and place them in the data stack from small to large according to the level of classification;

[0040] c. Pop the top branch of the data stack, propose a hypothetical position angle, and perform overlapping verification with the elements in the trunk and fact stack. If the verification passes, it is set as the fact state and included in the fact stack. If it fails, a new hypothesis is proposed and re-verified;

[0041] d. If the position angle optimization fails, the maximum allowed angle is used as the optimal position angle, and the branch is set as the fact state and pushed into the fact stack;

[0042] e. When all elements in the data stack are transferred to the fact stack, the i-th order branch layout is completed, and the i-th order branch is set to a fixed state;

[0043] f. When all i-order branches are in a fixed state, start the i-1-order branch layout until the 1-order branch layout is completed to form a wiring configuration design diagram.

[0044] Furthermore, the definitions of the overlapping state, the factual state and the fixed state are respectively:

[0045] Overlapping state: The edge sets of two branches intersect or overlap, which is called overlapping state;

[0046] Actual state: If a branch is locked in its relative position to the trunk according to the optimal position angle, the branch is said to be in the actual state;

[0047] Fixed form: When the trunk rotates to the same straight line and all branches are in the actual state, the trunk and branch tree is said to be in a fixed form.

[0048] Furthermore, the space optimization step includes the following process:

[0049] a. All branches of the i-th order branch of the branch tree are in the on-track state, and the data stack and fact stack are built for the trunk tree, and the data stack is added according to the branch level from small to large;

[0050] b. Pop the top branch of the data stack and perform overlap verification on the track level by level. If the verification passes, the inflection point is actually inserted, and the rotation segment and subsequent edges are set in the track state and pushed into the fact stack. If the verification fails, try the next level track;

[0051] c. If the final orbit optimization fails, the orbit with the highest position is taken as the optimal orbit, and the branch is set to the on-orbit state and included in the fact stack;

[0052] d. All elements in the data stack are transferred to the fact stack, then the i-th order trunk-branch tree branch layout is completed, and the branch of this order is set to the compressed state;

[0053] e. All i-order branches are in a compressed state, and the i-1-order trunk-branch tree layout is started until the 1-order branch layout is completed, completing the space optimization.

[0054] Furthermore, the definitions of the orbital state and the compressed state are:

[0055] On-track state: The trunk, branch, and tree branches complete the track merging operation according to the optimal track and lock the configuration, which is called the on-track state;

[0056] Compression state: When all branches of the trunk and branch tree are in orbit, the trunk and branch tree is said to be in a compression state.

[0057] The present invention has the following beneficial effects:

[0058] 1. A new data structure of wire harness - wiring trunk-branch tree model is proposed. According to the wiring structure characteristics of wire harness, wiring trunk-branch tree modeling is carried out, and the wiring trunk-branch tree is used to represent various information of wire harness wiring.

[0059] 2. According to the wiring trunk-branch tree model and combined with the wire table, the drawing data of the circuit schematic is analyzed. Based on the analysis results, the nodes and the tracks connecting the nodes in the circuit schematic are analyzed, and then the segmented paths of the entire wiring harness are extracted from the circuit schematic.

[0060] 3. Extract the wiring harness trunk, branches, and branch trunks and low-order branches of each branch from each node and segmented path of the wiring harness; then perform wiring harness routing process configuration design.

[0061] 4. According to the drawing size requirements, the wiring harness wiring process configuration is spatially optimized. The space-optimized process drawing can be directly provided to the operator for wiring harness wiring. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] Figure 1 It is a schematic diagram of the overall process of a complex wiring harness tooling plate configuration design method of the present invention;

[0063] Figure 2 This is an example of a typical wiring harness wiring trunk and branch tree structure diagram;

[0064] Figure 3 A schematic diagram of the main decision-making results;

[0065] Figure 4 It is a schematic diagram of the drawing lofting results;

[0066] Figure 5 Design a schematic diagram for the wiring harness configuration;

[0067] Figure 6 An example of a wiring configuration design drawing formed for a wiring harness wiring configuration design;

[0068] Figure 7 Added schematic diagram for spatial optimization inflection points;

[0069] Figure 8 for Figure 7 The spatial optimization results of the middle branch;

[0070] Fig. 9 for Figure 6 The space optimization results. DETAILED DESCRIPTION

[0071] The technical solution of the present invention is further described below in conjunction with the accompanying drawings and embodiments:

[0072] A complex wiring harness tooling plate configuration design method includes the following steps:

[0073] S1. Model the wiring harness trunk and branch tree for the wiring harness process layout configuration: define the elements in the wiring harness trunk and branch tree according to the wiring harness process layout configuration characteristics; use the wiring harness trunk and branch tree to represent the wiring harness data structure.

[0074] The wiring harness wiring trunk tree is a new data structure that inherits and improves the basic definition of graph and tree and incorporates the concept of process diagram trunk. It consists of a set N representing nodes and a set E representing the connectivity of nodes, denoted by T=<N,E> , where N is the finite set of nodes of the tree T, and E is a finite unordered tuple consisting of elements in N, called an edge set. The wiring harness trunk and branch tree contains the following elements:

[0075] Degree of a node: The number of edges connecting a node is called the degree of the node.

[0076] External node: A node with degree 1 is called an external node;

[0077] Internal nodes: Nodes with degree greater than 1 are called internal nodes;

[0078] Root node: There is only one external node in the wiring harness wiring trunk and branch tree, which is defined as the root node;

[0079] Leaf node: The external node other than the root node is called a leaf node;

[0080] Path: A path from node a to node b that contains only a set of edges that do not contain repeated edges is called the path from a to b, denoted by R(a,b).

[0081] Trunk: Select a leaf node f, and the path R(r,f) from the root node r to f can be defined as the trunk. Among them, any path that can be defined as a trunk is called a candidate trunk, and the set consisting of all candidate trunks is called a candidate trunk set. There is only one candidate trunk set that eventually becomes the trunk.

[0082] Branching: There are only two nodes with degree 1 in the trunk, namely the root and the leaf node, and the degree of other nodes is 2. The edges remaining after removing the trunk M from the trunk-branch tree T constitute n maximum connected branch groups, and each connected edge set and the nodes it contains are defined as a branch of the trunk-branch tree T.

[0083] The order of the trunk and branch tree: The trunk and branch tree directly converted from the schematic drawing is defined as a 1st-order trunk. The trunk of the 1st-order trunk is called the 1st-order trunk, and the branches can be called 1st-order branches. The branch trunk of the 1st-order branch is defined as a 2nd-order trunk, and the branches of the 2nd-order trunk are defined as 2nd-order branches, and so on.

[0084] S2. Wire harness tooling board design:

[0085] S21. Trunk design: parse the graphics and text descriptions in the circuit schematic, combine them with the wire table data, traverse the nodes and paths in the circuit schematic, and select the wiring harness trunk.

[0086] The edges that must be included in the trunk selection are called necessary edges. The first-order trunk necessary edges are the edges with the largest diameter; the necessary edges of other order branches are the edges connected to the root node.

[0087] The trunk judgment adopts the "large volume first" strategy, and the volume of each path of each candidate trunk is traversed and calculated through the following decision formula, and the candidate trunk with the largest total volume is determined as the trunk:

[0088]

[0089] Where V(i) refers to the volume of the i-th candidate backbone, S k is the end area of ​​the kth wire, lj is the length of the jth edge constituting the path, and 0<δ≤1 is the suppression factor.

[0090] S22. Branch reasoning: After deciding on the trunk, reason out the branches of each order connected to the trunk. For each order of branches, reason out the branch root node, branch trunk and branch path in turn until all the path information of the wiring harness is reasoned out.

[0091] Among them, the branch root node reasoning logic is:

[0092] Explanation: If branch b is the path of harness t, ttns is the set of trunk nodes of harness t, ns is the set of nodes of branch b, node n is contained in ns, and node n is also contained in ttns, then node n is the root node of branch b.

[0093] The branch-trunk reasoning logic is: and

[0094] Explanation: If r is the root node of branch t, ​​f is the leaf node of the branch, and rt is the path from r to f, then rt is a candidate trunk; if r is a candidate trunk of branch b, rs is the set of candidate trunks of branch b, and when r has the highest decision probability in the candidate set rs, then r is the branch trunk of branch b.

[0095] S23. Drawing layout: According to the element composition of the wiring harness wiring trunk and branch tree, based on the trunk design and branch reasoning results, extract and further process the corresponding data in the circuit schematic and wire table, and draw the data processing results into a layout drawing.

[0096] (1) Construct three queues: a queue of nodes with determined positions, a queue of nodes with positions to be determined, and a queue of edges to be processed;

[0097] (2) The root node of the wiring harness wiring trunk and branch tree is classified into the queue of nodes with determined positions, and the other nodes are classified into the queue of nodes with undetermined positions, and the edge set data is stored in the queue of edges to be processed;

[0098] (3) Scan the queue of pending edges. If one node n1 of edge e has the same node code as fn1 in the queue of nodes with determined positions, and another node n2 has the same node code as fn2 in the queue of pending positions, then calculate the vector In the direction of the circle, make a circle with fn1 as the center and the nominal value of the edge as the radius, and make the ray fn1fn2 so that it intersects the vector The directions are the same, and the intersection point is the staked position of fn2;

[0099] (4) After fn2 is assigned a new position, it is moved from the queue of nodes to be determined to the queue of processed nodes, and the process jumps to step 3 until the queue of nodes to be processed is empty. The layout process is terminated, the position of the concentrated nodes on the trunk and branch tree edges of the wiring harness wiring is updated, and the layout is completed.

[0100] S24. Wire harness routing configuration design: Based on the drawing layout results, the wire harness routing configuration is designed, from the trunk, high-order branches, to the low-order branches, iterative design is carried out to ensure that the branches have no interference with the trunk and the same-order branches, and form a routing configuration design drawing.

[0101] (1) Configuration design rules: Configuration design is the process of finding the minimum position angle while ensuring that there is no interference between the branch and the trunk and branches of the same order. The corresponding position angle is called the optimal position angle.

[0102] a. All the edges of the trunk are in the same straight line;

[0103] b. It is forbidden for the edges of branches to cross or overlap with the trunk or sibling branches;

[0104] c. The optimal position angle must be within the specified angle range;

[0105] d. When there is no optimal position angle within the angle range, the optimal position angle is the maximum allowable position angle.

[0106] (2) Various states included in the composition design:

[0107] a. Overlapping state: The edge sets of two branches intersect or overlap, which is called overlapping state;

[0108] b. Actual state: If a branch is locked in relative position with the trunk according to the optimal position angle, the branch is said to be in the actual state;

[0109] c. Fixed form: When the main trunk rotates to the same straight line and all branches are in the actual state, the trunk and branch tree is said to be in a fixed form. A trunk and branch tree without branches is in a fixed form when the trunk rotates to the same straight line.

[0110] (3) The process of configuration design is as follows:

[0111] a. Rotate all paths in the trunk to a straight line. For each order of branches, rotate all paths in the branch trunk to the same straight line. During the rotation process, pull other paths in the branch to rotate together.

[0112] b. If all lower-order branches of the i-th order branch are in a fixed state, construct two branch stacks for the branch - a data stack and a fact stack, and put them into the data stack from small to large according to the level of classification;

[0113] c. Pop the top branch of the data stack, propose a hypothetical position angle, and perform overlapping verification with the elements in the trunk and fact stack. If the verification passes, it is set as the fact state and included in the fact stack. If it fails, a new hypothesis is proposed and re-verified;

[0114] d. If the position angle optimization fails, the maximum allowed angle is used as the optimal position angle, and the branch is set as the fact state and pushed into the fact stack;

[0115] e. When all elements in the data stack are transferred to the fact stack, the i-th order branch layout is completed, and the i-th order branch is set to a fixed state;

[0116] f. When all i-order branches are in a fixed state, start the i-1-order branch layout until the 1-order branch layout is completed to form a wiring configuration design diagram.

[0117] S25. Space optimization: According to the board size requirements, the wiring configuration design drawing completed in step S24 is space optimized to form a wiring harness wiring tooling board.

[0118] (1) Space optimization rules:

[0119] a. The only edges that can be inserted into the inflection point of the i-th order branch are the 0-level edges of its trunk;

[0120] b. After merging, it is forbidden for the edges of the branches to overlap with the trunk or branches of the same order;

[0121] c. If there is no optimal track in the list of available tracks, the optimal track is the track with the highest allowed position.

[0122] (2) New states added during space optimization:

[0123] a. On-track state: The trunk, branch, and tree branches complete the track merging operation according to the optimal track and lock the configuration, which is called the on-track state;

[0124] b. Compression state: When all branches of the trunk and branch tree are in orbit, the trunk and branch tree is said to be in compression state. The initial state of the trunk and branch tree without branches is compression state.

[0125] (3) The process of space optimization is as follows:

[0126] a. All branches of the i-th order branch of the branch tree are in the on-track state, and the data stack and fact stack are built for the trunk tree, and the data stack is added according to the branch level from small to large;

[0127] b. Pop the top branch of the data stack and perform overlap verification on the track level by level. If the verification passes, the inflection point is actually inserted, and the rotation segment and subsequent edges are set in the track state and pushed into the fact stack. If the verification fails, try the next level track;

[0128] c. If the final orbit optimization fails, the orbit with the highest position is taken as the optimal orbit, and the branch is set to the on-orbit state and included in the fact stack;

[0129] d. All elements in the data stack are transferred to the fact stack, then the i-th order trunk-branch tree branch layout is completed, and the branch of this order is set to the compressed state;

[0130] e. All i-order branches are in a compressed state, and the i-1-order trunk-branch tree layout is started until the 1-order branch layout is completed, completing the space optimization.

Claims

1. A complex wiring harness tooling plate configuration design method, characterized in that: The following steps are involved: S1. Modeling the wiring harness process tree for the wiring harness process layout configuration: defining each element in the wiring harness process tree according to the wiring harness process layout configuration characteristics; Use a wiring harness process tree to represent the wiring harness data structure; The wiring harness wiring trunk-branch tree is a tree structure described by "root-trunk-branch". It is a nonlinear data structure that emphasizes the master-slave relationship between the trunk and the branches. It consists of a set N representing the nodes and a set E representing the connectivity relationship of the nodes, denoted by T=<N,E> ; S2. Wire harness tooling board design: S21. Trunk design: parse the graphics and text descriptions in the circuit schematic diagram, combine them with the wire table data, traverse the nodes and paths in the circuit schematic diagram, and select the wiring harness trunk; in the trunk design step, the volume of each path of each candidate trunk is traversed and calculated by the following decision formula, and the candidate trunk with the largest total volume is decided as the trunk: Where V(i) refers to the volume of the i-th candidate backbone, S k is the end area of ​​the kth wire, lj is the length of the jth edge constituting the path, and 0<δ≤1 is the suppression factor; S22. Branch reasoning: After the trunk is determined, the branches of each order connected to the trunk are inferred, and the branch root node, branch trunk and branch path of each order branch are inferred in turn until all the path information of the harness is inferred; in the branch reasoning step, the branch root node reasoning logic is: if branch b is the path of harness t, ttns is the trunk node set of harness t, ns is the node set of branch b, node n is included in ns, and node n is also included in ttns, then node n is the root node of branch b; The branch-trunk reasoning logic is: if r is the root node of branch t, ​​f is the leaf node of the branch, and rt is the path from r to f, then rt is a candidate trunk; if r is a candidate trunk of branch b, rs is the candidate trunk set of branch b, and when r is the one with the highest decision probability in the candidate set rs, then r is the branch trunk of branch b; S23. Drawing layout: According to the element composition of the wiring harness wiring process tree, based on the trunk design and branch reasoning results, extract and further process the corresponding data in the circuit schematic and the wire table, and draw the data processing results into a layout drawing; the drawing layout step includes the following processes: 1) Construct three queues: a queue of nodes with determined positions, a queue of nodes with positions to be determined, and a queue of edges to be processed; 2) The root node of the wiring harness routing process tree is classified into the queue of nodes with determined positions, the other nodes are classified into the queue of nodes with undetermined positions, and the edge set data is stored in the queue of edges to be processed; 3) Scan the queue of pending edges. If one node n1 of edge e has the same node code as fn1 in the queue of nodes with determined positions, and another node n2 has the same node code as fn2 in the queue of pending positions, then calculate the vector In the direction of the circle, make a circle with fn1 as the center and the nominal value of the edge as the radius, and make the ray fn1fn2 so that it intersects the vector The directions are the same, and the intersection point is the staked position of fn2; 4) After fn2 is assigned a new position, it is moved from the queue of nodes to be determined to the queue of processed nodes, and the process jumps to step 3 until the queue of nodes to be processed is empty, terminating the layout process, updating the node position of the edge concentration of the wiring harness routing process tree, and the layout ends; S24. Wire harness wiring configuration design: Based on the drawing layout results, the wire harness wiring configuration is designed, and the design is iteratively performed from the trunk, high-order branches, to low-order branches to ensure that the branches have no interference with the trunk and branches of the same order, and a wiring configuration design drawing is formed; the wire harness wiring configuration design step includes the following processes: a. Rotate all paths in the trunk to a straight line. For each order of branches, rotate all paths in the trunk of the branch to the same straight line. During the rotation process, pull other paths in the branch to rotate together. b. If all lower-order branches of the i-th order branch are in a fixed state, build a data stack and a fact stack for the branch and place them in the data stack from small to large according to the classification level; c. Pop the top branch of the data stack, propose a hypothetical position angle, and perform overlapping verification with the elements in the trunk and fact stack. If the verification passes, it is set to the fact state and included in the fact stack. If it fails, a new hypothesis is proposed and re-verified; d. If the position angle optimization fails, the maximum allowed angle is used as the optimal position angle, and the branch is set as the fact state and pushed into the fact stack; e. When all elements in the data stack are transferred to the fact stack, the i-th order branch layout is completed, and the i-th order branch is set to a fixed state; f. When all i-order branches are in a fixed state, start the i-1-order branch layout until the 1-order branch layout is completed to form a wiring configuration design diagram; S25. Space optimization: According to the size requirements of the drawing, the wiring configuration design drawing completed in step S24 is space optimized to form a wiring harness wiring tooling drawing; the space optimization step includes the following process: a. If all branches of the i-th order branch of the process tree are in the on-track state, build a data stack and a fact stack for the process tree, and add them to the data stack in ascending order of branch level; b. Pop the top branch of the data stack and perform overlap verification on the track level by level. If the verification passes, the inflection point is actually inserted, and the rotation segment and subsequent edges are set in the track state and pushed into the fact stack. If the verification fails, try the next level track; c. If the final orbit optimization fails, the orbit with the highest position is taken as the optimal orbit, and the branch is set to the on-orbit state and put into the fact stack; d. All elements in the data stack are transferred to the fact stack, then the i-th order process tree branch layout is completed, and the branch of this order is set to a compressed state; e. All i-order branches are in a compressed state, and the i-1-order process tree layout is started until the 1-order branch layout is completed and the space optimization is completed.

2. A complex wiring harness tooling plate configuration design method as claimed in claim 1, characterized in that: The harness routing process tree contains the following elements: Degree of a node: The number of edges connecting a node is called the degree of the node; External node: A node with degree 1 is called an external node; Internal nodes: Nodes with degree greater than 1 are called internal nodes; Root node: There is only one external node in the wiring harness routing process tree that is defined as the root node; Leaf node: The external node other than the root node is called a leaf node; Path: From node a to node b, there is a unique set of edges that do not contain repeated edges, which is called the path from a to b, denoted by R(a,b); Trunk: Select a leaf node f, and the path R(r,f) from the root node r to f is defined as the trunk; any path defined as the trunk is called a candidate trunk, and the set consisting of all candidate trunks is called a candidate trunk set. There is only one candidate trunk set that eventually becomes the trunk; Branch: There are only two nodes with degree 1 in the trunk, namely the root and the leaf node, and the degree of other nodes is 2; the remaining edges after removing the trunk M from the process tree T constitute n connected edge sets, and each connected edge set and the nodes it contains are defined as a branch of the process tree T; Order of process tree: The trunk of the process tree is called the 1st-order trunk, and its branches are called 1st-order branches; the branch trunk of the 1st-order branch is defined as the 2nd-order trunk, the branch of the 2nd-order trunk is defined as the 2nd-order branch, and so on.

3. A complex wiring harness tooling plate configuration design method as claimed in claim 1, characterized in that: The definitions of overlapping state, factual state and fixed state are: Overlapping state: The edge sets of two branches intersect or overlap, which is called overlapping state; Actual state: If a branch is locked in relative position with the trunk according to the optimal position angle, the branch is said to be in the actual state; Fixed state: When the trunk rotates to the same straight line and all branches are in the actual state, the process tree is said to be in a fixed state.

4. A complex wiring harness tooling plate configuration design method as claimed in claim 1, characterized in that: The definitions of the orbital state and the compressed state are: On-track state: The process tree branch completes the track merging operation according to the optimal track and locks the configuration. The branch is said to be in the on-track state; Compressed state: When all branches of the process tree are on track, the process tree is said to be in a compressed state.

Images