CN110889173B - Assembly unit classification method based on assembly relation grading - Google Patents
Assembly unit classification method based on assembly relation grading Download PDFInfo
- Publication number
- CN110889173B CN110889173B CN201910980034.4A CN201910980034A CN110889173B CN 110889173 B CN110889173 B CN 110889173B CN 201910980034 A CN201910980034 A CN 201910980034A CN 110889173 B CN110889173 B CN 110889173B
- Authority
- CN
- China
- Prior art keywords
- assembly
- functional
- relation
- function
- parts
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses an assembly unit dividing method based on assembly relation grading, which comprises the following steps: step 1, acquiring an assembly relation value table of an assembly body, and determining a grade relation value between any two functional pieces according to the assembly relation and the value of each functional piece; step 2, calculating the level relation value of each assembly relation and each function piece according to the level relation value among the function pieces; step 3, determining the weight sum of the hierarchical relation of all the assembly relations to any functional piece, and selecting a basic piece from all the functional pieces from large to small according to the weight sum of the hierarchical relation; and 4, dividing the assembly units according to the grade relation value between each base piece and each non-base piece. The dividing method is simple to implement and high in feasibility; the method has strong applicability, and functional parts of different assemblies can divide assembly units by the method; the surrounding graphic structural characteristics do not need to be converted, the surrounding graphic structural characteristics are easy to convert into computer languages, and the degree of automation is high.
Description
Technical Field
The application relates to the technical field of assembly unit division, in particular to an assembly unit division method based on assembly relation grading.
Background
For an assembly body with a large number of parts and complex assembly process, if assembly sequence planning is directly performed, the problem of 'combined explosion' is inevitably generated, and one of the effective ways for solving the problem is to unitize the complex assembly body and divide the complex assembly body into a plurality of assembly units (or sub-assemblies) with fewer parts, so that the assembly sequence planning process of a complex product is simplified and the product research and development efficiency is shortened.
The method for unitizing the complex assembly in the prior art can be roughly divided into a clustering method, a process information dividing method and a graph and tree structure theory dividing method example reasoning method. The assembly body assembly unit dividing method obtained by the clustering method has the advantage of good universality, but meanwhile, the assembly unit result obtained by dividing is poor in pertinence, and the engineering application value is low. The process information dividing method has the defects that the process information of different assemblies is different, the universality is lacking, and the reference value to other products is low; meanwhile, the problem of low automation degree exists. The method of dividing the assembled units by using the graph and tree structure theory simplifies the expression form of the assembled body, but the graph and tree structure features are difficult to convert into computer languages, so the automation degree is not high.
Disclosure of Invention
Aiming at the technical problems in the prior art, the invention provides an assembly unit dividing method based on assembly relation grading.
The technical scheme for solving the technical problems is as follows: an assembly unit classification method based on assembly relation grading comprises the following steps:
and 4, dividing the assembly units according to the grade relation value between the base part and the non-base part.
A non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the assembly cell partitioning method based on assembly relationship ranking described above.
The beneficial effects of the invention are as follows: defining the level relation value between any two functional pieces according to the assembly relation and the value of each functional piece in the assembly relation value table of the assembly body, and further determining the level relation value of each assembly relation and each functional piece, so as to select a basic piece and finish the division of an assembly unit; the method has strong applicability, and functional parts of different assemblies can divide assembly units by the method; the surrounding graphic structural characteristics do not need to be converted, the surrounding graphic structural characteristics are easy to convert into computer languages, and the degree of automation is high.
On the basis of the technical scheme, the invention can be improved as follows.
Further, the step 1 includes:
finding a slave function P according to the Floyd algorithm i Reach function P j And determining the level relation value between any two functional pieces as the number of the functional pieces included in the shortest path, and establishing a level matrix between the functional pieces.
The step 1 comprises the following steps:
step 101, obtaining an initial grade matrix D between the functional parts according to the assembly relation and weight of each functional part (0) ：
D (0) ＝(d (0) i·j ) n×n ；
Wherein i and j are the number of the functional parts, i, j=1, 2,3 …, n, n are the total number of the functional parts of the assembly; l (L) i·j Representing functional part P i And functional part P j Weights of the assembly relations between the two; d, d (0) i·j Representing the functional part P i Reaching the functional part P j The number of functions that the initial shortest path passes through;
step 102, according to d (0) i·j Determining the function P i Reaching the functional part P j Number d of functions of first-order shortest path (1) i·j ：
When only the function parts { P } are assembled 1 P in } 1 As transfer points or when transfer points are not needed:
d (1) i·j ＝min{d (0) i·j ，d (0) i·1 +d (0) 1·j }。
step 103, according to said function P i Reaching the functional part P j The number of the functions of any stage of shortest path passing through is determined, and a grade matrix D between the functions is established (n) ＝(d (n) i·j ) n×n ：
When only the function parts { P } are assembled 1 、P 2 ......P n 0 or at least one function as a transfer point: d, d (n) i·j ＝min{d (n) i·j ，d (n) i·n +d (n) n·j Building matrix D (n) ＝(d (n) i·j ) n×n 。
The formula for calculating the level relation value of the assembly relation and each functional piece in the step 2 is as follows:
The step 3 comprises the following steps:
step 301, calculating the assembly relation P i·j For the functional part P k Weight size of (2)
The method comprises the following steps:
step 302, calculating all the assembly relations for any one of the functional parts P k Weight sum w of (2) k The method comprises the following steps:
step 303, selecting N from each function according to the order from the higher to the lower of the weight sum of the hierarchical relationship of each function P And a base member.
The dividing number N P The method meets the following conditions:
the step 4 comprises the following steps:
and classifying the non-basic parts into the assembly units which the basic parts with the lowest level relation value belong to, and classifying the non-basic parts into the assembly units with the lowest total number of the functional parts if at least two basic parts with the lowest level relation value exist.
The step 4 comprises the following steps:
step 5, judging whether the divided assembly units can be assembled without interference, if so, indicating that the division scheme of the assembly units is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
The step 5 comprises the following steps:
step 501, judging whether all assembly directions of the assembly body are orthogonal, if yes, executing step 502, otherwise, executing step 503;
step 502, calculating the assembly in each direction k 1 (k 1 Orthogonal interference matrix on =x, -x, y, -y, z, -z)
step 503, calculating the assembly in each direction k 2 (k 2 ＝x,y,z,r 1 ,r 2 ,…,r n ) Non-orthogonal interference matrix on
step 504, judging whether one item with all zero rows or columns exists between the assembly units in the interference matrix, and if so, indicating that the assembly unit division scheme is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
The beneficial effects of adopting the further scheme are as follows: the method has the advantages that a grade matrix between the functional parts and the assembly relation is constructed, the basic parts are determined according to the weight size sequence, then the assembly units are divided, the balance inspection and the interference inspection among the assembly units are further carried out on the division results, the feasibility of the assembly units is guaranteed, and the whole division method is practical and feasible through practical verification, so that the reasonable and efficient division of the assembly units of the complex assembly body can be realized.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of an assembly unit classification method based on assembly relationship grading according to an embodiment of the present application;
FIG. 2 is a flowchart of an embodiment of an assembly cell partitioning method based on assembly relationship ranking provided in an embodiment of the present application;
FIG. 3 is a schematic diagram of an embodiment of a connection relationship of a structural assembly according to an embodiment of the present application;
fig. 4 is an undirected view of an assembly structure of an embodiment of an assembly unit classifying method based on assembly relation grading according to an embodiment of the present application.
Detailed Description
The principles and features of the present invention are described below with reference to the drawings, the examples are illustrated for the purpose of illustrating the invention and are not to be construed as limiting the scope of the invention.
As shown in fig. 1, a flowchart of an assembly unit classifying method based on assembly relationship grading provided by the present invention, as can be seen from fig. 1, the method includes:
And 2, calculating the level relation value of each assembly relation and each function piece according to the level relation value among the function pieces.
And step 3, determining the weight sum of the hierarchical relation of all the assembly relations to any functional piece, and selecting the basic piece from all the functional pieces according to the order of the weight sum of the hierarchical relation from large to small.
And 4, dividing the assembly units according to the grade relation value between each base piece and each non-base piece.
The invention provides an assembly unit dividing method based on assembly relation grading, which is characterized in that an assembly relation value table of an assembly body is a table showing assembly relation of which two functional pieces are assembled and weight corresponding to the assembly relation, and the grade relation value between any two functional pieces is defined according to the assembly relation and the value of each functional piece in the assembly relation value table of the assembly body, so that the grade relation value between each assembly relation and each functional piece is determined, a basic piece is selected, and the division of an assembly unit is completed; the method has strong applicability, and functional parts of different assemblies can divide assembly units by the method; the surrounding graphic structural characteristics do not need to be converted, the surrounding graphic structural characteristics are easy to convert into computer languages, and the degree of automation is high.
First embodiment
Specifically, in step 1, finding a slave function according to Floyd (Floyd) algorithmP i Reach function P j And determining the level relation value between any two functional pieces as the number of the functional pieces included in the shortest path, and establishing a level matrix between the functional pieces. Fig. 3 is a schematic diagram of an embodiment of a connection relationship of a structural assembly according to the present invention, where a value of a hierarchical relationship between two functional elements refers to a level between two functional elements in an assembly, where the two functional elements can be directly or indirectly connected through the assembly relationship and the functional elements, and the number of the passed functional elements is the level between the two functional elements in a shortest path for connecting the two functional elements.
The method specifically comprises the following steps:
step 101, obtaining an initial grade matrix D between the functional parts according to the assembly relation and the weight of each functional part (0) ：
D (0) ＝(d (0) i·j ) n×n (2)
Wherein i and j are the number of the order of the functional parts, i, j=1, 2,3. L (L) i·j Representing functional part P i And functional part P j Weights of the assembly relations between the two; d, d (0) i·j Representing functional part P i Reach function P j The number of functions that the initial shortest path passes through.
Step 102, according to d (0) i·j Determining function P i Reach function P j Number d of functions of first-order shortest path (1) i·j ：
When only the function parts { P } are assembled 1 P in } 1 As transfer points or without transfer points, the slave function P i Reach function P j The number of functional parts through which the first-order shortest path passes is counted as:
d (1) i·j ＝min{d (0) i·j ，d (0) i·1 +d (0) 1·j }。
step 103, according to the function part P i Reach function P j The number of the functions of any stage of shortest path passing through is determined until d is determined (n) i·j Establishing a grade matrix D between functional pieces (n) ＝(d (n) i·j ) n×n ：
When only the function parts { P } are assembled 1 、P 2 ......P n 0 or at least one of the functional members P as a transfer point i Reach function P j The number of functional parts through which the n-level shortest path passes is counted as: d, d (n) i·j ＝min{d (n) i·j ，d (n) i·n +d (n) n·j And construct matrix D (n) ＝(d (n) i·j ) n×n 。
And 2, calculating the level relation value of each assembly relation and each function piece according to the level relation value among the function pieces.
The level of the assembly relation and the functional piece refers to any assembly relation L in the assembly body i·j All can be connected with any functional piece P through the part and the assembly relation k Connection, k=1, 2,3., n, realizing the fitting relationship L i·j And functional part P k In the shortest path of connection, the number of passing functions is the level relation value of the assembly relation and the function.
Specifically, the formula for calculating the level relation value of the assembly relation and each functional piece is as follows:
wherein, the liquid crystal display device comprises a liquid crystal display device,
representing functional part P i And functional part P j Is to be assembled in relation to P i·j For functional part P k Is a hierarchical relationship value of (a).
And step 3, sequentially determining the weight sum of the hierarchical relation of all the assembly relations to any functional piece, and selecting the basic piece from all the functional pieces according to the order of the weight sum of the hierarchical relation from large to small.
The importance degree of the functional piece in the assembly body can be judged according to the total weight of all the assembly relations to the grade relation of the functional piece. Specifically, step 3 includes:
step 301, calculating an assembly relationship P i·j For functional part P k Weight size of (2)
The method comprises the following steps:
for functional part P k Different grades of assembly relations are given different weights, and the weights are assigned to the functional parts P as the assembly relations k Is the inverse of the hierarchical relationship value.
Step 302, calculating all assembly relationships for any one functional part P k Weight sum w of (2) k The method comprises the following steps:
w k the larger the representation function P k The more important it is in the assembly.
Step 303, determining the number N of divisions of the assembly unit P N is selected from the functional pieces according to the order of the weight sum of the hierarchical relation of the functional pieces from big to small P A base part divided into a number N P The method meets the following conditions:
the base part is the base part of the assembly unit, one and only one for each assembly unit. In the specific implementation process, the method is preliminarySelecting the maximum value satisfying the formula (6) as the dividing number N P The later stage can be reduced and adjusted according to the actual situation, for example, when the number of the functional parts among the assembly units is too large, the assembly time difference among the assembly units at the later stage can be too large, so that unbalance among assembly unit production lines is caused, and the dividing number N can be reduced according to the number of the functional parts of the assembly units P The number of functions, the assembly time, etc. of each assembly unit are not greatly different as much as possible.
And 4, dividing the assembly units according to the grade relation value between each base piece and each non-base piece.
And classifying the non-basic parts into the assembly units to which the basic parts with the lowest hierarchical relationship belong, and classifying the basic parts with the lowest hierarchical relationship into the assembly units with the least total number of functional parts if two or more basic parts with the lowest hierarchical relationship exist.
Specifically, step 4 further includes:
step 5, judging whether the divided assembly units can be assembled without interference, if so, indicating that the division scheme of the assembly units is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
And carrying out interference check on the assembly unit division result to ensure that the assembly unit of the unit division result can be assembled without interference. For an assembly body with all assembly directions being orthogonal, an orthogonal interference matrix based on orthogonal axes can be established, and the interference checking directions are +/-x, +/-y and +/-z. For an assembly in which all assembly directions are not orthogonal, the interference checking directions are 6 orthogonal directions and non-orthogonal directions, the non-orthogonal directions are selected according to the assembly requirement and the process characteristics of the part, the non-orthogonal directions are selected as the assembly directions of the part only when a certain part cannot be assembled in the orthogonal directions, and the assembly direction coordinate system of the assembly is (x, y, z, r) 1 ,r 2 ,…,r n ) Direction k 2 (k 2 ＝x,y,z,r 1 ,r 2 ,…,r n ). The method specifically comprises the following steps:
step 501, it is determined whether all assembly directions of the assembly are orthogonal, if yes, step 502 is executed, and if no, step 503 is executed.
Step 502, calculating the assembly in each direction k 1 (k 1 Orthogonal interference matrix on =x, -x, y, -y, z, -z)
Wherein, the liquid crystal display device comprises a liquid crystal display device,
representing functional part P j In the direction k 1 During assembly, the functional part P i Interference conditions of (a):
step 503, calculating the assembly in each direction k 2 (k 2 ＝x,y,z,r 1 ,r 2 ,…,r n ) Non-orthogonal interference matrix on
Wherein, the liquid crystal display device comprises a liquid crystal display device,
representing functional part P j In the direction k 2 During assembly, the functional part P j Interference conditions of (a):
in general, the direction k 2 Non-orthogonal interference matrix presence of (2)
And->
Two, it can be known from the formula (9) that only the functional part P needs to be judged j In the direction k 2 Assembling and functional part P i Interference condition of->
Can get +.>
They are equivalent, i.e.)>
Solving the non-orthogonal interference matrix +.>
After that, by transposing it +.>
I.e. < ->
Step 504, judging whether one item with all zero rows or columns exists among the assembly units in the interference matrix, and if so, indicating that the assembly unit division scheme is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
Second embodiment
The embodiment 2 provided by the invention is a specific application embodiment of the assembly unit classification method based on assembly relation grading. The assembly body in this specific application embodiment is an independent rear suspension structure.
Tables 1 and 2 below are a function code information table of the independent rear suspension and an assembly relation value table of the independent rear suspension assembly, respectively.
TABLE 1 functional part code information Table
TABLE 2 Assembly relationship value Table of independent rear suspension Assembly
The slave function P is calculated from the fitting relation value of the independent rear suspension assembly in the formula 1 and the table 2 i Reach function P j Number d of functions of initial shortest path passing (0) i·j Thereby obtaining an initial grade matrix D between the functional pieces (0) ＝(d (0) i·j ) n×n 。
When only the function parts { P } are assembled 1 P in } 1 As transfer points or when no transfer points are required, the slave function P i Reach function P j The number of functional parts through which the first-order shortest path passes is counted as: d, d (1) i·j ＝min{d (0) i·j ，d (0) i·1 +d (0) 1·j And then construct rank matrix D (1) ＝(d (1) i·j ) n×n 。
When only the function parts { P } are assembled 1 、P 2 0 or 1 or more functional elements among the functional elements P as transfer points i Reach function P j The number of functional parts through which the second-stage shortest path passes is counted as: d, d (2) i·j ＝m in{d (1) i·j ，d (1) i·2 +d (1) 2·j And then construct rank matrix D (2) ＝(d (2) i·j ) n×n 。
According to the method, until a grade matrix D is constructed (n) ＝(d (n) i·j ) n×n D at this time (n) i·j Representing that the function part set { P } can only be used 1 、P 2 、......P n 0 or 1 or more functional elements among the functional elements P as transfer points i Reach function P j The number of functional parts through which the n-level shortest path passes is counted as: d, d (n) i·j ＝min{d (n-1) i·j ，d (n-1) i·n +d (n -1) n·j }。
According to the embodiment of the invention, the matrix D finally obtained by the steps is obtained (28) Namely, a grade matrix among functional components in the assembly body, wherein the grade matrix is shown as a formula (11):
according to the above formula (11) and formula (3), the assembly relation can be solved for each part grade matrix E as shown in the following formula (12):
each column in the level matrix E represents the fitting relation L 1 ～L 37 Each row represents a function P 1 ～P 28 。
The importance degree of the functional piece in the assembly body can be judged according to the weight sum of all the assembly relations. The sum of weights of all the assembly relationships to the respective functional pieces is calculated according to the formula (4) and the formula (5) as shown in the following table 3:
TABLE 3 sum of weights of all assembly relations for each function
As can be seen from Table 1, in example 2 of the present invention, the number of independent rear suspension functions was 28, and the number of assembly units N of the assembly was calculated according to the formula (6) p Less than or equal to 5, and preliminarily selecting five functional parts P5 before the sum of the assembly relation weights from the table 3 1 、P 7 、P 20 、P 28 And P 5 As the basis of the five assembly units, respectively.
After the number of assembly units is determined, calculating all assembly relations for any functional part P according to the formula (5) k Weight sum w of (2) k According to w k And selecting the base part from large to small, and demarcating the assembly unit of the functional part through the hierarchical relationship between the non-base part and the base part. The non-basic parts are classified into the assembly units to which the basic parts with the lowest hierarchical relationship belong, and if two or more basic parts with the lowest hierarchical relationship exist, the basic parts are classified into the assembly units with fewer total functional parts. After the division is completed, balance inspection and interference inspection between the assembly units are required.
According to D (28) The preliminary assembled unit division results are shown in table 4 below:
table 4 the assembly cell division preliminary scheme 5 the number of functions between assembly cells is too large, which may cause the assembly time difference between the assembly cells at the later stage to be too large, resulting in unbalance between assembly cell production lines, so the number of assembly cells should be reduced in consideration of the balance between production lines, and the number of functions, assembly time, etc. of each assembly cell should be made as small as possible. Since the independent rear suspension and the assembly are of a bilateral symmetry structure, it can be seen from Table 3 that P is present in 5 base members 28 And P 5 The sum of weights of (2) is 23.9, so P is considered to be 28 And P 5 Deleting from base part, reserving P 1 、P 7 And P 20 The number of fitting units is thus adjusted to 3. Three functions are selected accordingly: p (P) 1 、P 7 And P 20 Respectively serving as basic components of the assembly units, and dividing functional components of non-basic components again, wherein the final scheme of dividing the assembly units is shown in the following table 5:
TABLE 5 Assembly Unit division Final scheme
Fig. 4 is an undirected view of the assembly structure of an embodiment of the assembly unit classification method based on assembly relationship grading, and fig. 4 shows a final assembly unit classification scheme more clearly.
After the division of the assembly units is completed, interference check needs to be carried out on the result so as to ensure that the assembly units in the division scheme can be assembled without interference. According to the interference condition analysis between the assembly units, the three assembly directions are all orthogonal directions, so that only an orthogonal interference matrix is required to be established, and the interference matrix between the specific assembly units is shown as the following formulas (13) to (15):
as can be seen from the analysis of the assembly interference conditions of the independent rear suspension assembly units of the formulas (13) to (15), the first column of the formula (15) is all 0, namely, when Z1 is assembled along the Z direction, no interference exists between the first column and both Z2 and Z3; the second row of equation (15) is all 0, i.e., Z2 has no interference with both Z1 and Z3 when assembled in the-Z direction; the third row of equation (15) is all 0, i.e., Z3 does not interfere with both Z1 and Z2 when assembled in the-Z direction. Thus, the assembly cell division scheme is feasible.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
The foregoing description of the preferred embodiments of the invention is not intended to limit the invention to the precise form disclosed, and any such modifications, equivalents, and alternatives falling within the spirit and scope of the invention are intended to be included within the scope of the invention.
Claims (7)
1. An assembly unit classification method based on assembly relation grading is characterized by comprising the following steps:
step 1, acquiring an assembly relation value table of an assembly body, and determining a grade relation value between any two functional pieces according to the assembly relation and the weight of each functional piece in the assembly relation value table;
step 2, calculating the level relation value of each assembly relation and each function piece according to the level relation value among the function pieces;
step 3, determining the weight sum of the hierarchical relation of all the assembly relations to any functional piece, and selecting a basic piece from the functional pieces according to the order of the weight sum of the hierarchical relation from large to small;
step 4, dividing assembly units according to the grade relation values between the base parts and the non-base parts;
the step 1 comprises the following steps:
step 101, obtaining an initial grade matrix D between the functional parts according to the assembly relation and weight of each functional part (0) :
D (0) ＝(d (0) i·j ) n×n ；
Wherein i and j are the number of the functional parts, i, j=1, 2,3 …, n, n are the total number of the functional parts of the assembly; l (L) i·j Representing functional part P i And functional part P j Weights of the assembly relations between the two; d, d (0) i·j Representing the functional part P i Reaching the functional part P j The number of functions that the initial shortest path passes through;
step 102, according to d (0) i·j Determining the function P i Reaching the functional part P j Number d of functions of first-order shortest path (1) i·j ：
When only the function parts { P } are assembled 1 P in } 1 As transfer points or when transfer points are not needed:
d (1) i·j ＝min{d (0) i·j ，d (0) i·1 +d (0) 1·j }；
step 103, according to said function P i Reaching the functional part P j The number of the functions of any stage of shortest path passing through is determined, and a grade matrix D between the functions is established (n) ＝(d (n) i·j ) n×n ：
When only the function parts { P } are assembled 1 、P 2 ......P n 0 or at least one function as a transfer point: d, d (n) i·j ＝min{d (n) i·j ，d (n) i·n +d (n) n·j Building matrix D (n) ＝(d (n) i·j ) n×n ；
The formula for calculating the level relation value of the assembly relation and each functional piece in the step 2 is as follows:
the step 3 comprises the following steps:
step 301, calculating the assembly relation P ij For the functional part P k Weight size of (2)
The method comprises the following steps:
step 302, calculating all the assembly relations for any one of the functional parts P k Weight sum w of (2) k The method comprises the following steps:
step 303, selecting N from each function according to the order from the higher to the lower of the weight sum of the hierarchical relationship of each function P And each of the base members.
2. The method according to claim 1, wherein the step 1 comprises:
according toThe Floyd algorithm finds the slave function P i Reach function P j And determining the level relation value between any two functional pieces as the number of the functional pieces included in the shortest path, and establishing a level matrix between the functional pieces.
3. The method according to claim 1, wherein the number of divisions N P The method meets the following conditions:
4. the method according to claim 1, wherein the step 4 comprises:
and classifying the non-basic parts into the assembly units which the basic parts with the lowest level relation value belong to, and classifying the non-basic parts into the assembly units with the lowest total number of the functional parts if at least two basic parts with the lowest level relation value exist.
5. The method according to claim 1, wherein said step 4 is followed by:
step 5, judging whether the divided assembly units can be assembled without interference, if so, indicating that the division scheme of the assembly units is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
6. The method according to claim 5, wherein said step 5 comprises:
step 501, judging whether all assembly directions of the assembly body are orthogonal, if yes, executing step 502, otherwise, executing step 503;
step 502, calculating the assembly in each direction k 1 (k 1 Orthogonal interference matrix on =x, -x, y, -y, z, -z)
step 503, calculating the assembly in each direction k 2 (k 2 ＝x,y,z,r 1 ,r 2 ,…,r n ) Non-orthogonal interference matrix on
step 504, judging whether one item with all zero rows or columns exists between the assembly units in the interference matrix, and if so, indicating that the assembly unit division scheme is feasible; and if not, re-executing the steps 1-4 to divide the assembly units.
7. A non-transitory computer-readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the steps of the assembly cell division method based on assembly relationship ranking as claimed in any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910980034.4A CN110889173B (en) | 2019-10-15 | 2019-10-15 | Assembly unit classification method based on assembly relation grading |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910980034.4A CN110889173B (en) | 2019-10-15 | 2019-10-15 | Assembly unit classification method based on assembly relation grading |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110889173A CN110889173A (en) | 2020-03-17 |
| CN110889173B true CN110889173B (en) | 2023-07-07 |
Family
ID=69746163
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910980034.4A Active CN110889173B (en) | 2019-10-15 | 2019-10-15 | Assembly unit classification method based on assembly relation grading |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110889173B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111931336B (en) * | 2020-06-30 | 2021-09-24 | 武汉理工大学 | Complex welding part unit dividing method and device and readable storage medium |
| CN113312806B (en) * | 2021-07-30 | 2021-10-19 | 武汉理工大学 | Welding unit dividing method and device |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3973756A (en) * | 1972-01-24 | 1976-08-10 | Cegedur Gp | Railing and method of assembly |
| JP2008046924A (en) * | 2006-08-17 | 2008-02-28 | Hitachi Ltd | Assembly information generator |
| JP2009122726A (en) * | 2007-11-12 | 2009-06-04 | Hitachi Ltd | Workability analyzing device |
| CN101714182A (en) * | 2008-12-29 | 2010-05-26 | 北京航空航天大学 | Integration method of collaborating assembly design, process planning and simulation verification of complicated product |
| CN102129494A (en) * | 2011-03-04 | 2011-07-20 | 华中科技大学 | Product assembly representation method based on engineering connection relationship |
| CN102254053A (en) * | 2010-05-20 | 2011-11-23 | 北京大学 | Parameterization design method and system based on assembly assembling |
| CN104504471A (en) * | 2014-12-22 | 2015-04-08 | 华北电力大学 | Assembly sequence planning method and assembly sequence planning system |
| CN104573194A (en) * | 2014-12-20 | 2015-04-29 | 西安工业大学 | Recognition method for subassembly in assembly sequence planning |
| CN107256009A (en) * | 2017-06-30 | 2017-10-17 | 武汉理工大学 | A kind of Digital product model Intelligent assembly system based on deep learning |
| CN107590348A (en) * | 2017-09-28 | 2018-01-16 | 合肥工业大学 | A kind of auto parts low-carbon Integrated Design System and its method based on CAD platforms |
| CN109522613A (en) * | 2018-10-26 | 2019-03-26 | 北京理工大学 | A kind of assembly method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3898485B2 (en) * | 2001-10-11 | 2007-03-28 | 株式会社トヨタケーラム | Drawing drawing display device, drawing drawing display method, and recording medium |
-
2019
- 2019-10-15 CN CN201910980034.4A patent/CN110889173B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3973756A (en) * | 1972-01-24 | 1976-08-10 | Cegedur Gp | Railing and method of assembly |
| JP2008046924A (en) * | 2006-08-17 | 2008-02-28 | Hitachi Ltd | Assembly information generator |
| JP2009122726A (en) * | 2007-11-12 | 2009-06-04 | Hitachi Ltd | Workability analyzing device |
| CN101714182A (en) * | 2008-12-29 | 2010-05-26 | 北京航空航天大学 | Integration method of collaborating assembly design, process planning and simulation verification of complicated product |
| CN102254053A (en) * | 2010-05-20 | 2011-11-23 | 北京大学 | Parameterization design method and system based on assembly assembling |
| CN102129494A (en) * | 2011-03-04 | 2011-07-20 | 华中科技大学 | Product assembly representation method based on engineering connection relationship |
| CN104573194A (en) * | 2014-12-20 | 2015-04-29 | 西安工业大学 | Recognition method for subassembly in assembly sequence planning |
| CN104504471A (en) * | 2014-12-22 | 2015-04-08 | 华北电力大学 | Assembly sequence planning method and assembly sequence planning system |
| CN107256009A (en) * | 2017-06-30 | 2017-10-17 | 武汉理工大学 | A kind of Digital product model Intelligent assembly system based on deep learning |
| CN107590348A (en) * | 2017-09-28 | 2018-01-16 | 合肥工业大学 | A kind of auto parts low-carbon Integrated Design System and its method based on CAD platforms |
| CN109522613A (en) * | 2018-10-26 | 2019-03-26 | 北京理工大学 | A kind of assembly method and device |
Non-Patent Citations (5)
| Title |
|---|
| Assembly sequences merging based on assembly unit partitioning;Wang, Y;《Int J Adv Manuf Technol 》;20090314;第45卷;第808-820页 * |
| Research on mapping between product function model and assembly model;Jianping Tian;《International Technology and Innovation Conference 2009 (ITIC 2009)》;20100723;第1-5页 * |
| 单元化装配规划关键技术研究;周炜;《中国优秀博士学位论文全文数据库工程科技Ⅰ辑 》;20111215(第12(2011)期);全文 * |
| 基于单元模型的产品装配模型重构方法研究;于良;《中国优秀硕士学位论文全文数据库工程科技Ⅰ辑》;20170615(第6(2017)期);全文 * |
| 基于装配关系的装配单元划分方法研究;李欢欢;《沈阳理工大学学报》;20171231;第36卷(第6期);第51-55页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110889173A (en) | 2020-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Palczewski et al. | Influence of various normalization methods in PROMETHEE II: an empirical study on the selection of the airport location | |
| US8943068B2 (en) | Dynamic graph system for a semantic database | |
| CN110889173B (en) | Assembly unit classification method based on assembly relation grading | |
| CN111966574B (en) | Architecture scheme evaluation method of avionics computing platform | |
| JP2014513826A5 (en) | ||
| CN112541735A (en) | Medium-low voltage distribution network project optimization method and device | |
| Anwar et al. | Optimization of many objective pickup and delivery problem with delay time of vehicle using memetic decomposition based evolutionary algorithm | |
| CN107944691B (en) | Comprehensive analysis system for evaluating spatial situation | |
| CN106844533B (en) | Data packet aggregation method and device | |
| US20130204818A1 (en) | Modeling method of neuro-fuzzy system | |
| JP7030583B2 (en) | Matching device using syllabus | |
| CN114091908A (en) | Power distribution network comprehensive evaluation method, device and equipment considering multi-mode energy storage station | |
| CN110598930B (en) | Bus route optimization adjustment method and device | |
| CN109460490B (en) | Method, device, equipment and storage medium for determining center vertex in social network | |
| CN102306353A (en) | Method and system for estimating credibility of simulation system | |
| CN115221366B (en) | Method and device for identifying key nodes in urban rail transit network | |
| CN109857632A (en) | Test method, device, terminal device and readable storage medium storing program for executing | |
| Hidayat et al. | Sensitivity Analysis of Decision Support Systems for Selection of Achievement Students Using the TOPSIS Method | |
| CN113222323B (en) | Method, device, equipment and storage medium for evaluating coordinated development of composite system | |
| Watanabe et al. | NK model-based analysis of technological trajectories: a study on the technological field of computer graphic processing systems | |
| CN110033184B (en) | Metadata-based business process recommendation method and device | |
| JP5404867B1 (en) | Keyword type determination apparatus, method, and program | |
| Saaty et al. | Recent developments in the analytic hierarchy process | |
| US20150363891A1 (en) | Reciprocal distribution calculating method and reciprocal distribution calculating system for cost accounting | |
| CN117611018A (en) | Effectiveness deduction evaluation method based on unmanned cluster scale and index dynamic adjustment |
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 |