CN105868463B - A kind of complex product complexity Dynamics Optimization method - Google Patents
A kind of complex product complexity Dynamics Optimization method Download PDFInfo
- Publication number
- CN105868463B CN105868463B CN201610182505.3A CN201610182505A CN105868463B CN 105868463 B CN105868463 B CN 105868463B CN 201610182505 A CN201610182505 A CN 201610182505A CN 105868463 B CN105868463 B CN 105868463B
- Authority
- CN
- China
- Prior art keywords
- constrained
- constrained parameters
- num
- state value
- constraint
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/36—Circuit design at the analogue level
- G06F30/367—Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods
Abstract
The present invention relates to a kind of complex product complexity Dynamics Optimization methods.This method comprises the following steps: (1) establishing the complexity model of complex product, extract the constraint equation in the complexity model and composition Constrained equations CN (P)=0, wherein P is constrained parameters set in complex model；(2) after the change of complex product function, constrained parameters stable state value set P in Constrained equations CN (P)=0 is soughtS；(3) constrained parameters stable state value set P in judgment step (2)SIt whether is empty set, if so, Dynamics Optimization fails, otherwise Dynamics Optimization success, the constrained parameters equilibrium valve of complex product is PS.Compared with prior art, the present invention is with method is simple, operational precision is high, high reliability.
Description
Technical field
The present invention relates to a kind of Dynamics Optimization methods, more particularly, to a kind of complex product complexity Dynamics Optimization side
Method.
Background technique
Complex product refer to research and development it is at high cost, scale is big, it is with high content of technology, be related to multidisciplinary technological know-how, manufacture assembly
A kind of very more product of required resource, customer demand, system composition, product technology, manufacturing process, project management etc. are all non-
It is often complicated.
Only constantly the follow up variation of external environment of complex product just adapts to market and the new demand of consumer, therefore
Complex product just needs to be continuously updated optimization, and the update optimization of complex product does not redesign new complex product,
It is carried out on the basis of existing Complex Product System, including the update optimization to existing Complex Product Structure and function.Mesh
The complexity of preceding complex product is increasingly regarded as the important point of penetration of research complex product, therefore answering by complex product
Polygamy becomes to study the update optimization of complex product as next current new research tendency.
Summary of the invention
It is complicated that it is an object of the present invention to overcome the above-mentioned drawbacks of the prior art and provide a kind of complex products
Property Dynamics Optimization method.
The purpose of the present invention can be achieved through the following technical solutions:
A kind of complex product complexity Dynamics Optimization method, this method comprises the following steps:
(1) the complexity model for establishing complex product extracts the constraint equation in the complexity model and composition constraint side
Journey group CN (P)=0, wherein P is constrained parameters set in complex model；
(2) after the change of complex product function, constrained parameters stable state value set P in Constrained equations CN (P)=0 is soughtS；
(3) constrained parameters stable state value set P in judgment step (2)SIt whether is empty set, if so, Dynamics Optimization fails,
Otherwise Dynamics Optimization success, the constrained parameters equilibrium valve of complex product are PS。
Constraint equation described in the step (1) includes the structure link constraint equation and functional restraint of complex product
Equation.
The step (2) includes following sub-step:
(201) obtaining constraint equation number in Constrained equations CN (P)=0 is to constrain in Num and constrained parameters set
Number of parameters is g, is executed step (202)；
(202) compare the size of Num and g, if Num is equal to g, execute step (203), if Num is greater than g, execute step
(204), it if Num is less than g, executes step (207)；
(203) constrained parameters stable state value set in Constrained equations CN (P)=0 is sought using the gloomy iterative method of newton pressgang
PS, and terminate；
(204) g constraint equation is arbitrarily chosen from Constrained equations CN (P)=0 forms the first equation group CNg(P)=
0, remaining (Num-g) a constraint equation forms second equation group CNNum-g(P)=0 step (205), are executed；
(205) the first equation group CN is sought using the gloomy iterative method of newton pressgangg(P)=0 constrained parameters stable state value set inIt executes step (206)；
(206) constraint IF parameter stable state value setWhether second equation group CN is metNum-g(P)=0 precision is wanted
It asks, if then assignmentAnd terminate, otherwise PSFor empty set and terminate；
(207) obtaining complex product function, the steady-state value before changing of each constrained parameters is simultaneously in constrained parameters set P before changing
Composition constrains stable state value set before changingIt executes step (208)；
(208) Num constrained parameters and the new constrained parameters set P ' of composition are chosen from constrained parameters set P, from change
Preceding constraint stable state value setExtract the corresponding steady-state value before changing of constrained parameters of remaining (g-Num) and the set of compositionIt will setIn value bring into Constrained equations CN (P)=0, obtain third equation group CN (P ')=0, execute
Step (209)；
(209) the constrained parameters steady-state value P ' of third equation group CN (P ')=0 is sought using the gloomy iterative method of newton pressgangSAnd
It saves, executes step (210)；
(210) the constrained parameters stable state value set of Constrained equations CN (P)=0 is obtainedAnd it ties
Beam.
The gloomy iterative method of newton pressgang described in step (203), step (205) and step (208) includes following sub-step:
(a) corresponding Constrained equations are denoted as F (X)=[f1(X),f2(X)…fn(X)]=0, wherein X=[x1,x2…
xn] it is corresponding constrained parameters set, f1It (X) is the 1st constraint equation, f2It (X) is the 2nd constraint equation, fn(X) it is n-th
Constraint equation, x1For the 1st constrained parameters, x2For the 2nd constrained parameters, xnFor n-th of constrained parameters, n is in Constrained equations
The number of constrained parameters in constraint equation number and constrained parameters set executes step (b)；
(b) each constrained parameters initial value set is at constrained parameters initial value collection in assignment k=0, selection constrained parameters set X
It closes, is denoted asWhereinFor the 1st constrained parameters initial value,For the 2nd constrained parameters initial value,For n-th of constrained parameters initial value, execute step (c)；
(c) it calculatesIt executes step (d)；
(d) judgeIt whether there is, it is no to then follow the steps (g) if executing step (e)；
(e) following formula is calculated:
Wherein, XkFor constrained parameters kth time iteration value set, Xk+1For+1 iteration value set of constrained parameters kth, F (Xk)
For Constrained equations kth time iterative value, execute step (f)；
(f) iteration difference ε is calculatedk+1=Xk+1-Xk, while judging εk+1 Tεk+1< AcustopIt is whether true, if assignment is about
Beam parameter stable state value set PS=Xk+1And terminate, otherwise assignment k=k+1 and return step (c), wherein AcustopFor setting essence
Degree；
(g) constrained parameters stable state value set PSFor empty set, terminate.
Step (206) constraint IF parameter stable state value setWhether second equation group CN is metNum-g(P)=0 precision
It is required that specifically:
(2061) the constraint function set CN in second equation group is extractedNum-g(P)=0, by constrained parameters stable state value setIn value bring constraint function set CN intoNum-g(P), constraint function accuracy value is sought
(2062) judge Δ < Acuacp, if so, constrained parameters stable state value setMeet second equation group CNNum-g(P)
=0 required precision, otherwise constrained parameters stable state value setIt is unsatisfactory for second equation group CNNum-g(P)=0 required precision
Wherein AcuacpTo give constraint function precision.
Compared with prior art, the present invention has the advantage that
(1) invention improves the feasibility and research knot of research using complex product complexity model as research object
The vindicability of fruit；
(2) constraint equation includes the structure link constraint equation and functional restraint functional equation of complex product, is produced in complexity
After the change of product function, structure links the dynamics that constrained parameters equilibrium valve in constraint equation and functional restraint function is complex product
Optimization as a result, reacting entire Dynamics Optimization process by specific value, intuitive is strong, and optimum results are more preferable；
(3) the gloomy iterative method of newton pressgang not only ensure that higher calculating speed, but also improve the accuracy of calculated result, and calculate
The space complexity of method is also smaller.
Detailed description of the invention
Fig. 1 is the flow chart of complex product complexity Dynamics Optimization method of the present invention.
Specific embodiment
The present invention is described in detail with specific embodiment below in conjunction with the accompanying drawings.
Embodiment
As shown in Figure 1, a kind of complex product complexity Dynamics Optimization method the following steps are included:
Step 1: establishing the complexity model of complex product, extract the constraint equation in the complexity model and composition constrains
Equation group CN (P)=0, wherein P is constrained parameters set in complex model, and the constraint equation includes the structure of complex product
Link constraint equation and functional restraint equation；
Step 2: after the change of complex product function, seeking constrained parameters stable state value set in Constrained equations CN (P)=0
PS；
Step 3: constrained parameters stable state value set P in judgment step (2)SIt whether is empty set, if so, Dynamics Optimization is lost
It loses, otherwise Dynamics Optimization success, the constrained parameters equilibrium valve of complex product is PS。
Wherein, the complex model of complex product is established in the step 1 using existing method, embodiment is with engine
For, the complex model of engine is established, the complexity model of complex product is to link constraint and function to Complex Product Structure
The mathematical expression of constraint, this to obtain the complex model of engine so have to extract suitable knot from engine
Structure links constraint function and functional restraint function, by the complexity model of these constraint function complicated composition products, sends out for after
The Dynamics Optimization of motivation complexity does basis.Four strokes of process, that is, engine completed from the duty of engine are sent out to study
The complexity of motivation because four strokes of engine are not only related to the core institution of engine, also with the function of engine
It is closely related, the feature ginseng from the structure for being related to engine of the constraint meeting maximum possible obtained in four strokes of engine
Number and functional parameter functionally, to the complexity model of the covering complex product of maximum depth, to more fully verify
The correctness of complex product complexity model.The constraint equation table of comparisons such as table obtained in acting process from four-stroke engine
Shown in 1:
The constraint equation table of comparisons of the acting process of 1 four-stroke engine of table
Restricted parameter set is combined into complex model:
P={ l, d, sr, W, n, T, dcyl,dpis,dubsh,dcsft,dcrod,hcsft,rcsft,heng),
Constrained equations are as follows:
The step 2 includes following sub-step:
(201) obtaining constraint equation number in Constrained equations CN (P)=0 is to constrain in Num and constrained parameters set
Number of parameters is g, is executed step (202)；
(202) compare the size of Num and g, if Num is equal to g, execute step (203), if Num is greater than g, execute step
(204), it if Num is less than g, executes step (207)；
(203) constrained parameters stable state value set in Constrained equations CN (P)=0 is sought using the gloomy iterative method of newton pressgang
PS, and terminate；
(204) g constraint equation is arbitrarily chosen from Constrained equations CN (P)=0 forms the first equation group CNg(P)=
0, remaining (Num-g) a constraint equation forms second equation group CNNum-g(P)=0 step (205), are executed；
(205) the first equation group CN is sought using the gloomy iterative method of newton pressgangg(P)=0 constrained parameters stable state value set inIt executes step (206)；
(206) constraint IF parameter stable state value setWhether second equation group CN is metNumThe precision of-g (P)=0 is wanted
It asks, if then assignmentAnd terminate, otherwise PSFor empty set and terminate；
(207) obtaining complex product function, the steady-state value before changing of each constrained parameters is simultaneously in constrained parameters set P before changing
Composition constrains stable state value set before changingIt executes step (208)；
(208) Num constrained parameters and the new constrained parameters set P ' of composition are chosen from constrained parameters set P, from change
Preceding constraint stable state value setExtract the corresponding steady-state value before changing of constrained parameters of remaining (g-Num) and the set of compositionIt will setIn value bring into Constrained equations CN (P)=0, obtain third equation group CN (P ')=0, execute
Step (209)；
(209) the constrained parameters steady-state value P ' of third equation group CN (P ')=0 is sought using the gloomy iterative method of newton pressgangSAnd
It saves, executes step (210)；
(210) the constrained parameters stable state value set of Constrained equations CN (P)=0 is obtainedAnd it ties
Beam.
The gloomy iterative method of newton pressgang described in step (203), step (205) and step (208) includes following sub-step:
(a) corresponding Constrained equations are denoted as F (X)=[f1(X),f2(X)…fn(X)]=0, wherein X=[x1,x2…
xn] it is corresponding constrained parameters set, f1It (X) is the 1st constraint equation, f2It (X) is the 2nd constraint equation, fn(X) it is n-th
Constraint equation, x1For the 1st constrained parameters, x2For the 2nd constrained parameters, xnFor n-th of constrained parameters, n is in Constrained equations
The number of constrained parameters in constraint equation number and constrained parameters set executes step (b)；
(b) each constrained parameters initial value set is at constrained parameters initial value collection in assignment k=0, selection constrained parameters set X
It closes, is denoted asWhereinFor the 1st constrained parameters initial value,For the 2nd constrained parameters initial value,For n-th of constrained parameters initial value, execute step (c)；
(c) it calculatesIt executes step (d)；
(d) judgeIt whether there is, it is no to then follow the steps (g) if executing step (e)；
(e) following formula is calculated:
Wherein, XkFor constrained parameters kth time iteration value set, Xk+1For+1 iteration value set of constrained parameters kth, F (Xk)
For Constrained equations kth time iterative value, execute step (f)；
(f) iteration difference ε is calculatedk+1=Xk+1-Xk, while judging εk+1 Tεk+1< AcustopIt is whether true, if assignment is about
Beam parameter stable state value set PS=Xk+1And terminate, otherwise assignment k=k+1 and return step (c), wherein AcustopFor setting essence
Degree；
(g) constrained parameters stable state value set PSFor empty set, terminate.
Step (206) constraint IF parameter stable state value setWhether second equation group CN is metNum-g(P)=0 precision
It is required that specifically:
(2061) the constraint function set CN in second equation group is extractedNum-g(P)=0, by constrained parameters stable state value setIn value bring constraint function set CN intoNum-g(P), constraint function accuracy value is sought
(2062) judge Δ < Acuacp, if so, constrained parameters stable state value setMeet second equation group CNNum-g(P)
=0 required precision, otherwise constrained parameters stable state value setIt is unsatisfactory for second equation group CNNum-g(P)=0 required precision
Wherein AcuacpTo give constraint function precision.
Claims (4)
1. a kind of complex product complexity Dynamics Optimization method, which is characterized in that this method comprises the following steps:
(1) the complexity model for establishing complex product extracts constraint equation and composition Constrained equations in the complexity model
CN (P)=0, wherein P be complex model in constrained parameters set, the complex product be four-stroke engine, described four
The constraint equation of the acting process of Stroke Engine specifically:
Restricted parameter set is combined into complex model:
P={ l, d, sr, W, n, T, dcyl,dpis,dubsh,dcsft,dcrod,hcsft,rcsft,heng),
Constrained equations are as follows:
(2) after the change of complex product function, constrained parameters stable state value set P in Constrained equations CN (P)=0 is soughtS；
(3) constrained parameters stable state value set P in judgment step (2)SIt whether is empty set, if so, Dynamics Optimization fails, otherwise
Dynamics Optimization success, the constrained parameters equilibrium valve of complex product are PS；
The step (2) includes following sub-step:
(201) obtaining constraint equation number in Constrained equations CN (P)=0 is constrained parameters in Num and constrained parameters set
Number is g, is executed step (202)；
(202) compare the size of Num and g, if Num is equal to g, execute step (203), if Num is greater than g, execute step (204),
If Num is less than g, execute step (207)；
(203) constrained parameters stable state value set P in Constrained equations CN (P)=0 is sought using the gloomy iterative method of newton pressgangS, and tie
Beam；
(204) g constraint equation is arbitrarily chosen from Constrained equations CN (P)=0 forms the first equation group CNg(P)=0, remaining
(Num-g) a constraint equation forms second equation group CNNum-g(P)=0 step (205), are executed；
(205) the first equation group CN is sought using the gloomy iterative method of newton pressgangg(P)=0 constrained parameters stable state value set inIt holds
Row step (206)；
(206) constraint IF parameter stable state value setWhether second equation group CN is metNum-g(P)=0 required precision, if
Then assignmentAnd terminate, otherwise PSFor empty set and terminate；
(207) obtain complex product function before changing in constrained parameters set P each constrained parameters steady-state value before changing and composition
Stable state value set is constrained before changingIt executes step (208)；
(208) Num constrained parameters and the new constrained parameters set P ' of composition are chosen from constrained parameters set P, from before changing about
Beam stable state value setExtract the corresponding steady-state value before changing of constrained parameters of remaining (g-Num) and the set of composition
It will setIn value bring into Constrained equations CN (P)=0, obtain third equation group CN (P ')=0, execute step
(209)；
(209) the constrained parameters steady-state value P ' of third equation group CN (P ')=0 is sought using the gloomy iterative method of newton pressgangSAnd save,
It executes step (210)；
(210) the constrained parameters stable state value set of Constrained equations CN (P)=0 is obtainedAnd terminate.
2. a kind of complex product complexity Dynamics Optimization method according to claim 1, which is characterized in that the step
Suddenly constraint equation described in (1) includes the structure link constraint equation and functional restraint equation of complex product.
3. a kind of complex product complexity Dynamics Optimization method according to claim 1, which is characterized in that step
(203), the gloomy iterative method of newton pressgang described in step (205) and step (208) includes following sub-step:
(a) corresponding Constrained equations are denoted as F (X)=[f1(X),f2(X)…fn(X)]=0, wherein X=[x1,x2…xn] be
Corresponding constrained parameters set, f1It (X) is the 1st constraint equation, f2It (X) is the 2nd constraint equation, fnIt (X) is n-th of constraint
Equation, x1For the 1st constrained parameters, x2For the 2nd constrained parameters, xnFor n-th of constrained parameters, n is to constrain in Constrained equations
The number of constrained parameters in equation number and constrained parameters set executes step (b)；
(b) assignment k=0 chooses each constrained parameters initial value set in constrained parameters set X and remembers at the initial value set of constrained parameters
MakeWhereinFor the 1st constrained parameters initial value,For the 2nd constrained parameters initial value,It is
N constrained parameters initial value executes step (c)；
(c) it calculatesIt executes step (d)；
(d) judgeIt whether there is, it is no to then follow the steps (g) if executing step (e)；
(e) following formula is calculated:
Wherein, XkFor constrained parameters kth time iteration value set, Xk+1For+1 iteration value set of constrained parameters kth, F (Xk) it is about
Beam equation group kth time iterative value, executes step (f)；
(f) iteration difference ε is calculatedk+1=Xk+1-Xk, while judging εk+1 Tεk+1< AcustopIt is whether true, if constraint EQ is joined
Number stable state value set PS=Xk+1And terminate, otherwise assignment k=k+1 and return step (c), wherein AcustopFor setting accuracy；
(g) constrained parameters stable state value set PSFor empty set, terminate.
4. a kind of complex product complexity Dynamics Optimization method according to claim 1, which is characterized in that step
(206) constraint IF parameter stable state value setWhether second equation group CN is metNum-g(P)=0 required precision, specifically:
(2061) the constraint function set CN in second equation group is extractedNum-g(P)=0, by constrained parameters stable state value setIn
Value bring constraint function set CN intoNum-g(P), constraint function accuracy value is sought
(2062) judge Δ < Acuacp, if so, constrained parameters stable state value setMeet second equation group CNNum-g(P)=0
Required precision, otherwise constrained parameters stable state value setIt is unsatisfactory for second equation group CNNum-g(P)=0 required precision is wherein
AcuacpTo give constraint function precision.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610182505.3A CN105868463B (en) | 2016-03-28 | 2016-03-28 | A kind of complex product complexity Dynamics Optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610182505.3A CN105868463B (en) | 2016-03-28 | 2016-03-28 | A kind of complex product complexity Dynamics Optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105868463A CN105868463A (en) | 2016-08-17 |
| CN105868463B true CN105868463B (en) | 2019-07-05 |
Family
ID=56625834
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610182505.3A Expired - Fee Related CN105868463B (en) | 2016-03-28 | 2016-03-28 | A kind of complex product complexity Dynamics Optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105868463B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101639681A (en) * | 2008-07-29 | 2010-02-03 | 深圳市大族激光科技股份有限公司 | Method for optimizing performance parameters of movement mechanism of electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7340704B2 (en) * | 2005-06-23 | 2008-03-04 | International Business Machines Corporation | Method and system for optimized automated case-splitting via constraints in a symbolic simulation framework |
-
2016
- 2016-03-28 CN CN201610182505.3A patent/CN105868463B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101639681A (en) * | 2008-07-29 | 2010-02-03 | 深圳市大族激光科技股份有限公司 | Method for optimizing performance parameters of movement mechanism of electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 可重构轮式机器人在典型崎岖地面上动力学仿真研究;赵晋锋 等;《中国科技论文在线》;20121231;第1-14页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105868463A (en) | 2016-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110850740B (en) | H-infinity control method of aircraft engine based on improved Smith predictor | |
| CN107066640B (en) | Variable configuration aircraft model iterative design method based on protection mapping | |
| JP2019507405A (en) | How to configure collaborative simulation for integrated systems | |
| CN109800449A (en) | A kind of aero-engine compression member characteristic revision method neural network based | |
| CN103149840B (en) | Semanteme service combination method based on dynamic planning | |
| CN104679945B (en) | System comprehensive estimation method based on colored Petri network | |
| CN103116698A (en) | GM (1, 1) model prediction method based on cubic spline | |
| CN105868463B (en) | A kind of complex product complexity Dynamics Optimization method | |
| CN104598302B (en) | AADL model schedulability verification methods based on resource contention model | |
| CN111680823A (en) | Wind direction information prediction method and system | |
| CN106292289B (en) | The mixing elite Stochastic search optimization method of process industry control loop object | |
| CN111539138A (en) | Method for solving time domain response sensitivity of structural dynamics peak value based on step function | |
| CN114676615B (en) | Tool compensation profile construction error assessment method, device, equipment and medium | |
| CN109635330A (en) | A kind of complex optimization control problem based on direct method accurately and quickly method for solving | |
| CN113718071B (en) | Control method of blast furnace blower | |
| CN104898587A (en) | Industrial process modeling system and method based on parallel diffusion-type intelligent search algorithm | |
| CN110442935A (en) | Automated arm productive temp design and optimization method | |
| CN104715112A (en) | Batched drilling method | |
| CN103020984B (en) | Based on the 3 d human motion data complementing method of sparse expression | |
| Breitsprecher et al. | Architecture and realization of a selflearning engineering assistance system for the use within sheetbulk metal forming | |
| CN106294908A (en) | Sound lining method for designing | |
| CN104317913A (en) | Screening method and screening device of attribute combination | |
| Tan et al. | Integration of work sequence and embodied interaction for collaborative work based human-robot interaction | |
| CN107516012A (en) | A kind of structured descriptor calculated based on organic compound molecule three-dimensional structure | |
| JP2008163900A (en) | Fuel spray simulation method, device and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190705 |