CN112766574B - Method for optimizing wiring path in whole machine - Google Patents
Method for optimizing wiring path in whole machine Download PDFInfo
- Publication number
- CN112766574B CN112766574B CN202110077666.7A CN202110077666A CN112766574B CN 112766574 B CN112766574 B CN 112766574B CN 202110077666 A CN202110077666 A CN 202110077666A CN 112766574 B CN112766574 B CN 112766574B
- Authority
- CN
- China
- Prior art keywords
- wiring
- matrix
- space position
- path
- diagonal difference
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The invention discloses a method for optimizing an internal wiring path of a complete machine, which comprises the following steps: step 1.1, defining a complete machine space position matrix by utilizing a complete machine product development diagram, and designating nodes which must pass through; step 1.2, removing the wiring relation of repeated space positions according to the content of a wiring BOM table and combining the space position matrix of the whole machine to form a space position matrix with unequal dimensions; step 2.1, forming a minimum space wiring vector path with the minimum dimension according to a wiring rule; step 2.2, topological space position matrix is in the space position matrix of the whole machine, diagonal difference value operation is carried out according to the minimum space position matrix, and a diagonal difference value matrix set is generated after repeated iteration; and 2.3, applying a wiring vector path concept, taking wiring basic rules as evaluation, forming a diagonal difference matrix vector path set, and completing the optimization of the wiring path in the whole machine. The invention reduces artificial experience interference, improves consistency of batch products and accelerates production efficiency.
Description
Technical Field
The invention belongs to the field of wiring path selection, and particularly relates to a method for optimizing an internal wiring path of a complete machine.
Background
The embedded complete machine product is connected with an external connector and a bottom Board (BUS) through a wire harness, so that the electrical performance of the product is realized, and the wire harness connection process is called the internal wiring of the complete machine. The trend of the wire harness in the embedded complete machine connection process is called a wiring path. The internal wiring of the whole machine is carried out by adopting a manual wire binding method at present: and manually classifying and bundling scattered wires on a plurality of connectors one by one according to the wiring relation shown on the wiring table, and then planning and constructing wiring paths according to personal experience. The wiring of the whole machine finished by the method is large in single-piece processing often, obvious in personal style and poor in consistency, and when the wiring is disordered and repaired, the problem points are difficult to quickly locate, so that mass production is not facilitated. In summary, the method of the wiring path inside the whole machine must be optimized, so that the interference of human experience is eliminated, the consistency of batch production is realized, and the production efficiency is accelerated.
Disclosure of Invention
Aiming at the defects, the invention aims to provide a method for optimizing the internal wiring path of a complete machine. The method reduces artificial experience interference, improves consistency of batch products, accelerates production efficiency, and simultaneously solves the defect that the traditional wiring method cannot quickly find problems during troubleshooting and repairing.
The invention is realized by the following technical scheme:
an optimization method for an internal wiring path of a complete machine comprises the following steps:
step 1, algorithm preparation stage
Step 1.1, defining a complete machine space position matrix by utilizing a complete machine product development diagram, and designating space position nodes which must pass through;
step 1.2, removing the wiring relation of repeated space positions according to the content of a wiring BOM table and combining the space position matrix of the whole machine to form a space position matrix with unequal dimensions;
step 2, algorithm execution stage
Step 2.1, according to a wiring rule, designating a wiring vector path of the minimum space position matrix with the smallest dimension in the step 1.2, and forming a minimum space wiring vector path with the smallest dimension;
step 2.2, topological the space position matrix formed in the step 1.2 is arranged in a space position matrix of the whole machine, diagonal difference value operation is carried out according to the minimum space position matrix, and a diagonal difference value matrix set is generated after repeated iteration;
and 2.3, applying a wiring vector path concept, taking wiring basic rules as evaluation, forming a diagonal difference matrix vector path set, and combining the vector paths of the diagonal difference matrices from head to tail sequentially according to the volume from large to small to finish the internal wiring path optimization of the whole machine.
Preferably, step 1.1 specifically comprises: unfolding the whole product model by taking a wiring plane as a view center, and dividing the wiring plane in a position network mode; specifying points on the routing plane that must be traversed while taking these points as nodes on the location network; and the wiring starting end and the wiring terminating end in the wiring BOM table are also used as nodes on the position network, so that the definition of the spatial position matrix of the whole machine is completed.
Preferably, step 1.2 specifically comprises: and screening the connection relation in the connection BOM table by using an Adodc control, taking a connection starting end as a primary variable, taking a connection terminal end as a secondary variable, reducing under the condition of the same wiring starting node, removing the connection relation of repeated space positions, and simultaneously establishing a space position matrix with unequal dimensions according to the logic connection relation in the connection BOM table.
Preferably, step 2.1 specifically comprises: comparing the space position matrixes with unequal dimensions established in the step 1.2, and taking the matrix with the smallest display volume on the wiring plane as the smallest space position matrix; setting the general vector expression form of the minimum space position matrix as
(a i b j ，a i+m b j+n ) Wherein->
Representing the logical connection relationship between the wire start and the wire end, a i b j Representing the wiring space position matrix coordinates of the wiring starting end, a i+m b j+n Representing the wiring space position matrix coordinates of the wiring terminal, m and n represent the space position matrix coordinate increment, and setting a j b j+n 、a i+m b j Representing bending points in the minimum space position matrix wiring vector path, forming the minimum space wiring vector path, wherein the expression form is as follows, and black arrows represent wire harness trend:
further, step 2.2 specifically includes: taking the space position matrixes with unequal dimensions formed in the step 1.2 as the subtracted number, taking the minimum space position matrix as the subtracted number, and carrying out diagonal difference value operation, wherein the space position expression form is as follows:
wherein, a is i b j -a i+m b j+n The matrix that is the positive diagonal is the minimum spatial position matrix; a is a i-p b j-q -a i+m b j+n The matrix being the positive angle is the next smallest spatial position matrix; the difference operation according to the diagonal difference matrix is as follows:
let the complete machine space position matrix be n×m order matrix, the minimum space position matrix be i×j order matrix, the next smallest space position matrix be p×q order matrix, the diagonal difference matrix x×y order matrix can be expressed as:
wherein "-" represents diagonal position difference operation, and t represents the number of space position matrixes including the minimum space position matrix which can be decomposed into space position matrixes with unequal dimensions;
the diagonal difference matrix set is obtained as follows:
further, step 2.3, according to the basic requirement of the wiring process that the wiring path between the wiring starting end and the wiring terminating end needs to be arranged along a straight line and the bending number of the path arranged between the wiring starting end and the wiring terminating end is less than or equal to the optimal, the diagonal difference matrix vector path is optimally compared as follows:
specifying diagonal difference matrices, e.g.
Diagonal difference matrix vector path 1 like +.>
Diagonal difference matrix vector path 2 like +.>
In the diagonal difference matrix vector path 1, the requirement that the wiring path needs to be arranged along a straight line is met, and a is i-1 b j-q 、a i b j 、a i+m b j Three bending points; in the diagonal difference matrix vector path 2, the requirement that the wiring path needs to be arranged along a straight line is met, and a is i-p b j-1 、a i+m b j Two bending points; according to the requirement that the bending number of the laid paths is less than that of the optimal, the diagonal difference matrix vector path 2 is better than the diagonal difference matrix vector path 1, and the diagonal difference matrix vector path 2 and the minimum space wiring vector path are connected end to form a sub-small space wiring vector path; and repeatedly iterating the process to form a diagonal difference matrix vector path set, merging the diagonal difference matrix vector path set and the minimum space wiring vector path end to obtain a complete machine space wiring vector path, and completing the optimization of the internal wiring path of the complete machine.
Compared with the prior art, the invention has the following beneficial technical effects:
1. defining a spatial location matrix: according to the space position matrix defined by the development diagram of the whole machine product, abstract wiring work is visualized, and meanwhile, in order to remove the wiring relation of repeated space positions, the wire outlet points of the same electric connector can be compressed into the same wire connection starting end, and the wiring workload is reduced by 10% -30%.
2. Defining a set of diagonal difference matrices: by carrying out difference operation between the space position matrixes with different dimensions and the minimum space position matrix, a diagonal difference matrix set is generated, the space position matrix of the whole machine with a large quantity is divided into a plurality of diagonal difference matrixes, and meanwhile, the influence of the construction experience of the process personnel on the wiring effect is eliminated under the limiting condition of the wiring basic requirement. The above measures unify the consistency of the design method of the wiring path of the whole product, quicken the production efficiency of the design stage of the wiring process, and meanwhile, in the processes of troubleshooting and repairing, the wiring network can be rapidly divided according to the fault phenomenon, the problem is searched, and the local maintenance scheme is formulated.
Drawings
The method of fig. 1 performs steps;
FIG. 2 is an expanded view of the whole machine product, and is divided into wiring planes;
FIG. 3 is a matrix of the spatial locations of the whole machine;
FIG. 4 diagonal difference matrix set
In fig. 5 (a) space routing vector path layout; (b) internal wiring paths of the complete machine.
Detailed Description
The invention will now be described in further detail with reference to specific examples, which are intended to illustrate, but not to limit, the invention.
The internal wiring path method of the whole machine, namely a Routing Optimization Algorithm for the Electronic machine, is called ROAE algorithm for short. As shown in fig. 1, the steps are as follows:
(1) Algorithm preparation stage: defining a complete machine space position matrix by utilizing a complete machine product development diagram, and designating space position nodes which need to pass through; and removing the wiring relation of the repeated space positions according to the content of the wiring BOM table and combining the space position matrix of the whole machine to form a space position matrix with unequal dimensions.
(2) Algorithm execution phase: taking a space position matrix with the smallest dimension as an object, and designating a wiring vector path according to a wiring rule to form a minimum space wiring vector path with the smallest dimension; carrying out diagonal difference value operation on the space position matrix topology formed in the step (1) in a complete machine space position matrix, and generating a diagonal difference value matrix set after repeated iteration; and (3) applying a wiring vector path concept, taking wiring basic rules as evaluation, forming a diagonal difference matrix vector path set, and merging with the space wiring vector path with the smallest dimension from head to tail to form a next-smallest space wiring vector path. And repeatedly iterating to finish the optimization of the internal wiring path of the whole machine.
The step (1) specifically comprises the following steps:
(1-1) defining a complete machine space position matrix by using a complete machine product development diagram, and designating space position nodes which must pass through.
And (3) unfolding the whole product model by taking the main wiring plane as the center, and dividing the wiring plane in a position network mode. Points that must be traversed are specified on the routing plane, with these points being taken as nodes on the location network. And similarly, the wiring starting end and the wiring terminating end shown in the wiring BOM table are also used as nodes on the position network, so that the definition of the spatial position matrix of the whole machine is completed.
(1-2) removing the repeated spatial position wiring relation according to the content of the wiring BOM table and combining the spatial position matrix to form a spatial position matrix with unequal dimensions.
And screening the connection relation in the connection BOM table by using an Adodc control, taking a connection starting end as a primary variable, taking a connection terminal end as a secondary variable, reducing under the condition of the same wiring starting node, removing the connection relation of repeated space positions, and simultaneously establishing a space position matrix with unequal dimensions according to the logic connection relation shown in the connection BOM table.
The ROAE algorithm preparation phase ends so far.
The step (2) specifically comprises the following steps:
(2-1) designating a wiring vector path of the minimum spatial position matrix with the smallest dimension based on the wiring rule, and forming a minimum spatial wiring vector path with the smallest dimension.
The wiring process is first basically required to be implemented using an algorithm. The wiring process is basically implemented in a spatial position matrix and can be categorized into two points: the wiring path between the wiring starting end and the wiring terminating end is required to be arranged along a straight line; the bending number of the paths arranged between the wiring starting end and the wiring terminating end is preferably small.
Comparing the space position matrixes with unequal dimensions, which are established in the step (1-2), to obtain a matrix with the smallest display volume on the wiring plane as a minimum space position matrix. Setting the general vector expression form as
(a i b j ，a i+m b j+n ) Wherein
Representing the logical connection relationship between the wire start and the wire end, a i b j Representing the wiring space position matrix coordinates of the wiring starting end, a i+m b j+n Representing the wiring space position matrix coordinates of the wiring terminal, m and n represent the space position matrix coordinate increment, and setting a i b j+n 、a i+m b j Representing bending points in the minimum space position matrix wiring vector path, forming the minimum space wiring vector path, the expression form of which is shown as follows, and black arrows represent the trend of the wire harness.
(2-2) topological the space position matrix formed in the step (1) in a complete machine space position matrix, performing diagonal difference operation, and generating a diagonal difference matrix set after repeated iteration
Taking the space position matrixes with unequal dimensions formed in the step (1-2) as the subtracted number, taking the minimum space position matrix as the subtracted number, and carrying out diagonal difference value operation, wherein the space position expression form is as follows:
wherein, a is i b j -a i+m b j+n The matrix that is the positive diagonal is the minimum spatial position matrix; a is a i-p b j-q -a i+m b j+n The matrix being the positive angle is the next smallest spatial position matrix. The difference operation according to the diagonal difference matrix is as follows:
therefore, a complete machine space position matrix can be decomposed into a plurality of diagonal difference matrixes and a minimum space position matrix which are connected end to end.
The above examples can be integrated, that is, when the spatial position matrix of the whole machine is an n×m-order matrix, the minimum spatial position matrix is an i×j-order matrix, the next-smallest spatial position matrix is a p×q-order matrix, and the diagonal difference matrix x×y-order matrix can be expressed as:
wherein "-" only represents the operation of the diagonal position difference value, and "t" represents the number of the space position matrixes including the minimum space position matrix and the whole space position matrix can be decomposed into space position matrixes with unequal dimensions.
When k=2, the next smallest spatial position matrix [ p q ]]Spatial position matrix of complete machine [ n m ]]Equal and complete machine space position matrix [ n m ]]Can be decomposed into a diagonal difference matrix x y] 1 And a minimum spatial location matrix i x j.
When k=3, the next smallest spatial position matrix [ p q ]]Diagonal difference matrix [ x y ] which can be decomposed into k=2] 1 And a minimum spatial position matrix i x j, a whole machine spatial position matrix [ n m ]]Can be decomposed into two diagonal difference matrices x y] 1 、[x y] 2 And a minimum spatial location matrix i x j.
When k=t, the complete spatial location matrix [ n m ] can be decomposed into k-2 diagonal difference matrices and a minimum spatial location matrix i×j. The diagonal difference matrix set is:
i.e. complete machine space position matrix [ n m ]]Can be decomposed into
And a minimum spatial location matrix i x j.
The complete machine space position matrix is decomposed into a plurality of diagonal difference matrixes, which are collectively called a diagonal difference matrix set, wherein the diagonal difference matrix with the smallest volume is called a minimum space position matrix.
And (2-3) applying a wiring vector path concept, taking wiring basic rules as evaluation, forming a diagonal difference matrix vector path set, and completing the optimization of the wiring path in the whole machine.
According to the concept of the minimum space routing vector path in the step (2-1), the minimum space routing vector path is actually the vectorized expression of the diagonal difference matrix with the minimum volume, namely the minimum space position matrix. When the space matrix can only be decomposed into two diagonal difference matrixes, namely a minimum space matrix and a diagonal difference matrix, the whole space wiring vector path is the sum of the diagonal difference matrix vector path and the minimum space wiring vector path which are connected end to end; when the space position matrix can only be decomposed into three diagonal difference matrices, namely a minimum space position matrix, a next-smallest diagonal difference matrix and a diagonal difference matrix, the whole space wiring vector path is the sum of a diagonal difference matrix vector path and a next-smallest diagonal difference matrix vector path and the minimum space wiring vector path after being connected end to end. When the space matrix can be decomposed into a plurality of diagonal difference matrices, the iteration is repeated according to the process.
When the practical algorithm is executed, according to the basic requirement of the wiring process described in the step (2-1), when the diagonal difference matrix vector path is connected with the minimum space wiring vector path end to end, the formed vector path is preferred, and the specific method is as follows:
specifying diagonal difference matrix forms as
Diagonal difference matrix vector path 1 shape is +.>
Diagonal difference matrix vector path 2 shape is +.>
In the diagonal difference matrix vector path 1, the requirement that the wiring path needs to be arranged along a straight line is met, and a is i-1 b j-q 、a i b j 、a i+m b j Three bending points. In the diagonal difference matrix vector path 2, the requirement that the wiring path needs to be arranged along a straight line is met, and a is i-p b j-1 、a i+m b j Two bending points. According to the requirement that the wiring basic requirement is that the bending number of the laid paths is less than or equal to the optimal value, the diagonal difference matrix vector path 2 is better than the diagonal difference matrix vector path 1, and the diagonal difference matrix vector path is connected with the minimum space wiring vector path end to form the sub-small space wiring vector path. And (3) repeatedly iterating the vector path optimizing process to form an optimal diagonal difference matrix vector path set, and completing the space wiring vector path layout of the space position matrix with unequal dimensions in the step (1-2).
And thus, the space position matrix optimization path layout of the whole machine is completed, and the internal wiring path optimization of the whole machine is completed.
Examples
Step one: preparation stage of ROAE algorithm: defining a complete machine space position matrix, and generating space position matrixes with unequal dimensions.
The wiring plane is divided by using the development diagram of the whole product as in fig. 2 in combination with the characteristics of the whole product. The network division line of the wiring plane needs to pass through the main feature points and the spatial position nodes that must pass through.
As shown in the wiring BOM table in table 1, the wiring start end is the electrical connector identified by XA1-XA7, the wiring end is the slot of the backplane identified by bus_1, bus_2, bus_3, and the pins of the wiring process path filter 1, filter 2 are known to be the wiring start end, the wiring end and the path position through which the warp and weft wires need to pass when dividing the wiring plane. It should be noted that, in the application process of the algorithm, in order to reduce unnecessary calculation amount, on the premise of meeting the practical situation of the wiring construction process, the distribution, feature points near the warp and the weft and spatial position nodes which must pass are normalizedAnd processing, wherein the positions of the algorithm are calculated according to the longitude and latitude intersection points when the algorithm is applied. The divided wiring plane is shown in fig. 2. Defining the warp and weft network lines, and forming the weft: a, a 1 、a 2 、a 3 、a 4 Warp yarn: b 1 、b 2 、b 3 、b 4 、b 4 . In this embodiment, the spatial location nodes related to the present algorithm are: a, a 1 b 1 、a 1 b 2 、a 1 b 5 、a 2 b 1 、a 2 b 2 、a 2 b 3 、a 2 b 5 、a 3 b 3 、a 3 b 4 、a 4 b 5 . The wiring space position matrix is shown in fig. 3.
Taking the electronic version wiring BOM table shown in Table 1 as input, taking the spatial position node in FIG. 3 as a normalization processing center, and according to the method of step (1-2) (specifically using a wiring relation screening program), performing reduction under the condition of the same wiring departure node on the wiring relation shown in the wiring BOM table, as shown in Table 2. Forming a spatial position matrix with unequal dimensions.
The link relation screening program is as follows:
TABLE 1 XXX connection BOM Table
TABLE 2 reduced XXX wiring BOM Table
Step two: the ROAE algorithm execution phase: specifying a routing vector path for the minimum spatial location matrix; generating a diagonal difference matrix set according to the method of the step (2-2) (specifically, applying a diagonal difference operation program), as shown in fig. 4; according to the method (specifically, a wiring vector path drawing program) in the step (2-3), the diagonal difference matrix set path drawing is completed, the space wiring vector path layout of the space position matrix with different dimensions is realized as shown in fig. 5 (a), and the internal wiring path optimization of the whole machine is completed as shown in fig. 5 (b).
Diagonal difference calculation program:
wiring vector path drawing program:
the method has the advantages of clear implementation process, clear steps and strong logic: the method has clear implementation process steps, and the input condition and the output conclusion of each stage are clear. For the wiring process of the large-scale complete machine product, an electronic version wiring BOM can be imported, the screening process is realized by using a VB programming program under a Visual Basic 6.0 platform, the wiring vector path drawing part is realized by using a general OpenGL programming program, the computing program universality is high, and the optimized internal wiring path of the complete machine is automatically completed, so that the time is saved by 50% -70% compared with the original method. For the wiring process of the whole product with small size or simple wiring relation, the optimal wiring path can be calculated manually according to the steps shown in the invention, and the time length is saved by 10% -20% compared with the original method.
Claims (3)
1. The method for optimizing the internal wiring path of the whole machine is characterized by comprising the following steps:
step 1, algorithm preparation stage
Step 1.1, defining a complete machine space position matrix by utilizing a complete machine product development diagram, and designating space position nodes which must pass through;
step 1.2, removing the wiring relation of repeated space positions according to the content of a wiring BOM table and combining the space position matrix of the whole machine to form a space position matrix with unequal dimensions;
step 2, algorithm execution stage
Step 2.1, according to a wiring rule, designating a wiring vector path of the minimum space position matrix with the smallest dimension in the step 1.2, and forming a minimum space wiring vector path with the smallest dimension;
step 2.2, topological the space position matrix formed in the step 1.2 is arranged in a space position matrix of the whole machine, diagonal difference value operation is carried out according to the minimum space position matrix, and a diagonal difference value matrix set is generated after repeated iteration;
step 2.3, applying a wiring vector path concept, taking wiring basic rules as evaluation, forming a diagonal difference matrix vector path set, combining the vector paths of the diagonal difference matrices from head to tail in sequence according to the volume from large to small, and completing the optimization of the wiring path in the whole machine;
the step 1.2 specifically comprises the following steps: screening connection relations in the connection BOM table by using an Adodc control as input, reducing the same wiring starting node by using a connection starting end as a primary variable and a connection ending end as a secondary variable, removing the connection relations of repeated space positions, and simultaneously establishing a space position matrix with unequal dimensions according to the logic connection relations in the connection BOM table;
the step 2.1 specifically comprises the following steps: comparing the space position matrixes with unequal dimensions established in the step 1.2, and taking the matrix with the smallest display volume on the wiring plane as the smallest space position matrix; setting the general vector expression form of the minimum space position matrix as
Wherein->
Representing the logical connection between the connection start and the connection end, < >>
Representing the wiring space position matrix coordinates of the wiring starting end, < >>
Representing the wiring space position matrix coordinates of the wiring terminal, m and n representing the space position matrix coordinate increment, and setting +.>
、/>
Representing bending points in the minimum space position matrix wiring vector path, forming the minimum space wiring vector path, wherein the expression form is as follows, and black arrows represent wire harness trend:
Step 2.2 is specifically: taking the space position matrixes with unequal dimensions formed in the step 1.2 as the subtracted number, taking the minimum space position matrix as the subtracted number, and carrying out diagonal difference value operation, wherein the space position expression form is as follows:
wherein, by
The matrix that is the positive diagonal is the minimum spatial position matrix; to->
The matrix being the positive angle is the next smallest spatial position matrix; the difference operation according to the diagonal difference matrix is as follows:
set the space position matrix of the whole machine as
Order matrix, minimum space position matrix is +.>
The order matrix, the sub-small space position matrix is +.>
Order matrix, diagonal difference matrix->
The rank matrix can be expressed as:
wherein "-" represents diagonal position difference operation, and t represents the number of space position matrixes including the minimum space position matrix which can be decomposed into space position matrixes with unequal dimensions;
the diagonal difference matrix set is obtained as follows:
2. the method for optimizing the internal wiring path of the complete machine according to claim 1, wherein step 1.1 specifically comprises: unfolding the whole product model by taking a wiring plane as a view center, and dividing the wiring plane in a position network mode; specifying points on the routing plane that must be traversed while taking these points as nodes on the location network; and the wiring starting end and the wiring terminating end in the wiring BOM table are also used as nodes on the position network, so that the definition of the spatial position matrix of the whole machine is completed.
3. The method for optimizing the internal wiring path of the complete machine according to claim 1, wherein step 2.3, according to the basic wiring process requirement that the wiring path between the wiring starting end and the wiring terminating end needs to be arranged along a straight line and the bending number of the wiring path arranged between the wiring starting end and the wiring terminating end is less than optimal, the diagonal difference matrix vector path is optimally compared as follows:
specifying diagonal difference matrices, e.g.
Diagonal difference matrix vector path 1 as
Diagonal difference matrix vector path 2 is e.g +.>
；
In the diagonal difference matrix vector path 1, the requirement that the wiring path needs to be arranged along a straight line is met, and a is i-1 b j-q 、a i b j 、a i+m b j Three bending points; diagonal difference momentIn the array vector path 2, a is arranged to meet the requirement that the wiring path is required to be arranged along a straight line i-p b j-1 、a i+m b j Two bending points; according to the requirement that the bending number of the laid paths is less than that of the optimal, the diagonal difference matrix vector path 2 is better than the diagonal difference matrix vector path 1, and the diagonal difference matrix vector path 2 and the minimum space wiring vector path are connected end to form a sub-small space wiring vector path; and repeatedly iterating the process to form a diagonal difference matrix vector path set, merging the diagonal difference matrix vector path set and the minimum space wiring vector path end to obtain a complete machine space wiring vector path, and completing the optimization of the internal wiring path of the complete machine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110077666.7A CN112766574B (en) | 2021-01-20 | 2021-01-20 | Method for optimizing wiring path in whole machine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110077666.7A CN112766574B (en) | 2021-01-20 | 2021-01-20 | Method for optimizing wiring path in whole machine |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112766574A CN112766574A (en) | 2021-05-07 |
| CN112766574B true CN112766574B (en) | 2023-06-09 |
Family
ID=75701893
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110077666.7A Active CN112766574B (en) | 2021-01-20 | 2021-01-20 | Method for optimizing wiring path in whole machine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112766574B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117787172A (en) * | 2023-12-27 | 2024-03-29 | 苏州异格技术有限公司 | Construction method and device of wiring resource diagram, computer equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102346795A (en) * | 2011-09-16 | 2012-02-08 | 华中科技大学 | Automatic quick wiring method for electric and electronic virtual experiments |
| CN109033611A (en) * | 2018-07-20 | 2018-12-18 | 福州大学 | A kind of wiring method of VLSI multi-terminal obstacle |
| CN109357678A (en) * | 2018-10-16 | 2019-02-19 | 北京航空航天大学 | A kind of multiple no-manned plane paths planning method based on heterogeneousization dove colony optimization algorithm |
| CN111723543A (en) * | 2020-06-18 | 2020-09-29 | 西安微电子技术研究所 | Electromagnetic compatibility design method of electric cylinder, electromagnetic compatibility electric cylinder and application |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5233761B2 (en) * | 2009-03-12 | 2013-07-10 | 富士通株式会社 | Wiring route creation support method, wiring route creation support program, and wiring route creation support device |
-
2021
- 2021-01-20 CN CN202110077666.7A patent/CN112766574B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102346795A (en) * | 2011-09-16 | 2012-02-08 | 华中科技大学 | Automatic quick wiring method for electric and electronic virtual experiments |
| CN109033611A (en) * | 2018-07-20 | 2018-12-18 | 福州大学 | A kind of wiring method of VLSI multi-terminal obstacle |
| CN109357678A (en) * | 2018-10-16 | 2019-02-19 | 北京航空航天大学 | A kind of multiple no-manned plane paths planning method based on heterogeneousization dove colony optimization algorithm |
| CN111723543A (en) * | 2020-06-18 | 2020-09-29 | 西安微电子技术研究所 | Electromagnetic compatibility design method of electric cylinder, electromagnetic compatibility electric cylinder and application |
Non-Patent Citations (2)
| Title |
|---|
| FPGA开关块拓扑的评估;高海霞 等;《西安电子科技大学学报》;第30卷(第06期);第752-755页 * |
| Near-Field Radiation Calculation of Irregular Wiring Twisted-Wire Pairs Based on Mode Decomposition;Junjun Wang等;《IEEE Transactions on Electromagnetic Compatibility》;第59卷(第2期);第600-608页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112766574A (en) | 2021-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111444571B (en) | BIM-based electromechanical air duct flange batch processing and drawing method | |
| CN112766574B (en) | Method for optimizing wiring path in whole machine | |
| CN108182301B (en) | Cable network branch diagram manufacturing method based on topological diagram automatic layout | |
| KR101761030B1 (en) | Simulation apparatus and method of virtual process for virtual factory | |
| CN108536937A (en) | The physical modeling of multi-way cable net and wiring emulation mode under a kind of virtual environment | |
| CN107292055B (en) | Method for assisting PCB design by establishing mathematical geometric model | |
| CN113987856A (en) | Complex multi-constraint structure grid generation method based on frame field | |
| CN114385816A (en) | Conversation flow mining method and device, electronic equipment and computer storage medium | |
| TWI746271B (en) | Scada web hmi system | |
| CN110503727B (en) | Batch rapid splicing method for CAD arbitrary multi-section lines | |
| CN104750882A (en) | Method for generating pinboard graph used for manufacture of electrical wiring harness | |
| CN115329411A (en) | Ship electrical drawing layout method based on prior rule and deep neural network | |
| CN115344969A (en) | Cable network path planning method and system based on satellite three-dimensional model | |
| CN111611761A (en) | Method, apparatus and computer-readable storage medium for generating circuit layout pattern | |
| CN115130187B (en) | Grasshopper-based machine learning basic data generation method | |
| CN111476461A (en) | Rapid calculation method for setting parameters of large power grid | |
| CN109949420A (en) | Delaunay Triangulation mesh refinement method, GPU and system suitable for GPU | |
| CN112926281B (en) | Intelligent module analysis method of digital integrated circuit | |
| CN117216916A (en) | E3 model-based aerospace cable process rapid design method and system | |
| CN115146423A (en) | Cable network ring-opening design method | |
| CN114154259A (en) | Three-dimensional tower modeling method based on contour input | |
| JP4579521B2 (en) | Sub-harness configuration information automatic generation method and program for causing computer to execute the method | |
| CN116382206A (en) | Scheduling method for distributed flow shop group with preparation time | |
| JPH01106265A (en) | Method for specifying ordering of automatic wiring network | |
| JP2767801B2 (en) | Object surface shape data creation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |