CN103258131A - Power circuit component optimization method based on orthogonal learning particle swarm - Google Patents

Power circuit component optimization method based on orthogonal learning particle swarm Download PDF

Info

Publication number
CN103258131A
CN103258131A CN2013101718664A CN201310171866A CN103258131A CN 103258131 A CN103258131 A CN 103258131A CN 2013101718664 A CN2013101718664 A CN 2013101718664A CN 201310171866 A CN201310171866 A CN 201310171866A CN 103258131 A CN103258131 A CN 103258131A
Authority
CN
China
Prior art keywords
particle
orthogonal
value
dimension
optimization
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.)
Pending
Application number
CN2013101718664A
Other languages
Chinese (zh)
Inventor
张军
詹志辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sun Yat Sen University
National Sun Yat Sen University
Original Assignee
National Sun Yat Sen University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by National Sun Yat Sen University filed Critical National Sun Yat Sen University
Priority to CN2013101718664A priority Critical patent/CN103258131A/en
Publication of CN103258131A publication Critical patent/CN103258131A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a power circuit component optimization method based on an orthogonal learning particle swarm, and belongs to the power electronic technology and the field of computational intelligence. An orthogonal learning particle swarm optimization with a mutation strategy is used for carrying out optimization on an optimal component design of a power electronic circuit. Firstly, a method of generating a new optimal learning object based on an orthogonal combination mode is designed, and is used for mining information of a historical optimal solution of a particle individual and information of a globally-optimal solution of a swarm in the orthogonal learning particle swarm optimization, and combining a learning object which can guide particles to develop in a better direction, secondly, a mutation operator which can improve diversity of the orthogonal learning particle swarm optimization is designed, and the defect that the orthogonal learning particle swarm optimization easily falls into local optimum is overcome. All components of the power electronic circuit serve as variables needing to be optimized and are coded into individuals of the orthogonal learning particle swarm optimization, optimization is carried out on values of the components of the power electronic circuit through specific optimization processes such as update of the speed, update of the location, mutation operation and update of the optimal learning object of the orthogonal learning particle swarm optimization, and the power circuit component optimization method based on the orthogonal learning particle swarm has important application value in the existing large-scale circuit design and optimization field.

Description

Power circuit element optimization method based on quadrature study population
Technical field:
The present invention relates to power electronic circuit and computational intelligence two big fields, be specifically related to a kind of power circuit element optimization method based on quadrature study particle cluster algorithm.
Technical background:
Since nineteen fifty, power semiconductor device occurred, power electronic circuit had obtained development rapidly and has become a important techniques in the various fields such as industry, commerce, dwelling house, Aero-Space, military affairs and government utility.The model of power electronic circuit, design and analysis are basis and important fields of research in the electronic technology.Power electronic circuit is made up of many element under normal conditions, such as resistor, capacitor and inductor.These electric elements all need could guarantee that through optimal design final circuit can obtain better circuit performance.Along with being on the increase of power electronic circuit scale, suitable element design and parameter are regulated and the slip-stick artist have been formed a great challenge.Therefore, the element of power circuit is optimized to for a kind of important research and uses problem.Aspect power circuit unit piece optimization, traditional method has comprised that the state space method of average, electric current inject equivalent circuit method, sampled data modeling method and state plane analytical approach etc.But these methods are only applicable to specific circuit and need the user to grasp enough circuit design knowledge.In addition, these methods generally all are based on small-signal model, so circuit designers finds to use the circuit reaction under these methods prediction large-signal environment very difficult sometimes.
Because classic method can't satisfy the demand of the power circuit model development that scale increases day by day, since 1970, various optimisation techniques, such as heuristic, the technology such as the method for (or climbing the mountain) and simulated annealing that descend based on knowledge method, gradient are proposed and in succession in order to realize the robotization optimal design of Analog Circuit Design.But these methods are all relatively responsive to initial solution, therefore may fall into local optimum easily in actual use.In recent years, because the application that the evolutionary computation method is achieved success in numerous actual application problem has also occurred using methods such as genetic algorithm, ant group algorithm and particle cluster algorithm to optimize the technical scheme of power electronic circuit design.But, in actual applications, still there are a lot of inferior positions in genetic algorithm and ant group algorithm, for example need to consume a large amount of calculating and just can find more excellent circuit component value relatively, and traditional particle cluster algorithm often can not search out globally optimal solution owing to easy precocity.
In the present invention, in order to keep particle cluster algorithm convergence capabilities fast, avoid algorithm to fall into local optimum simultaneously, designed a kind of particle cluster algorithm based on the quadrature learning strategy, and be applied in the element optimal design of power circuit.The quadrature study particle cluster algorithm of the present invention's design, by the entrained information of particle learning object in the particle cluster algorithm (individual historical optimum and population global optimum just) is carried out tap/dip deep into, the mode of use orthogonal experiment makes up the learning object an of the best, the flight of guiding particle finally makes algorithm can possess stronger ability of searching optimum.In quadrature study particle cluster algorithm, when using the orthogonal experiment mode to make up best learning object, the key element correspondence of orthogonal test be the dimension of waiting the problem of finding the solution, and the varying level correspondence of each key element is two kinds of different selections: select individual historical optimum or the global optimum of population.Because the orthogonal experiment mode can comprehensively be searched for interblock space by less different key elements and the combination of varying level, therefore can be by individual historical orthogonal experiment optimum and population global optimum being combined into the learning object an of the best.On the other hand, the quadrature study particle cluster algorithm of the present invention's design also has been equipped with a mutation operation: after having finished the renewal of speed and position under the guiding of particle at best learning object, new position will select some dimensions to make a variation according to certain probability, strengthen the diversity of algorithm, be conducive to improve the ability of searching optimum of algorithm.
Summary of the invention:
The present invention is with a kind of element optimization problem that is used for power circuit with the quadrature study particle cluster algorithm of mutation operation, the advantage of this technology is: 1, based on particle swarm optimization algorithm, this technology has the characteristics of quick convergence, can find the optimum element value of power circuit very soon; 2, owing to used quadrature learning strategy and mutation operation, this technology can overcome the defective that falls into local optimum easily.Therefore technology of the present invention can the realization of fast and stable ground to the optimization of power electronic circuit element value.
The concrete step of using the tactful quadrature study particle cluster algorithm of band variation to find the solution power electronic circuit element optimization problem is described below:
The parameter of step 1) initialization quadrature study particle cluster algorithm comprises the inertia weights omega is made as 0.5, and study factor c is made as 2.0, and population scale N is made as 40, and maximum evolutionary generation G is made as 500; Generate N particle at random and form population, the position of each particle i and velocity encoded cine are expressed as X respectively i=[x I1, x I2..., x ID] and V i=[v I1, v I2..., v ID]; Wherein D is code length, and is identical with the number of elements of circuit; Position X iIn each dimension value representation should the dimension circuit component value; The locative situation of change of speed; Assess the adaptive value of all particles, make the historical optimal location P of particle i i=[p I1, p I2..., p ID] be current location X i, the position G=[g of global optimum of whole population 1, g 2..., g D] be all historical optimal location P iIn best that, the best learning object O of each particle i is set simultaneously i=[o I1, o I2..., o ID] be current individual historical optimal location P iAnd best learning object inefficacy algebraically t i=0.
Step 2) to each particle i, by its best learning object O iTo speed V iUpgrade; For V iEach the dimension v Id(1≤d≤D), more new formula is accordingly: v Id=ω * v Id+ c * r * (o Id-x Id); Wherein r is the random number between interval [0,1].
Step 3) is to each particle i, and its current location is upgraded in use location more new formula, for X iEach the dimension x Id(1≤d≤D) accordingly more new formula be: x Id=x Id+ v Id
Step 4) is used the position X after the variation strategy upgrades particle i iMake a variation, strengthen the diversity of algorithm.Concrete method is: generate a random number between [0,1] at random earlier, if the value that this random number less than variation Probability p m (pm=0.01), selects certain one dimension of particle also will tie up is being set in optional scope at random.
Step 5) is upgraded position X after the variation to particle i iCarry out the assessment of adaptive value, if new fitness function value is than its historical optimal location P iThe fitness function value better, then with P iBe set to X i, and with the best learning object inefficacy algebraically t of particle i iBe made as 0, otherwise with the best learning object inefficacy algebraically t of particle i iBe made as t i+ 1; In addition, judge new P iWhether more excellent than the position G of global optimum of population, if then G is replaced with P i
Step 6) is for particle i, if its best learning object inefficacy algebraically t iSurpass preset threshold value (value was 5 generations among the present invention program), then adopt " Orthogonal Composite mode " to produce a new best learning object, and with t iBe made as 0;
Step 7) is carried out above step 2 repeatedly), 3), 4), 5) and 6) up to satisfying end condition, then the value of each dimension is corresponding circuit component value in the solution of global optimum position G representative.
In said process, step 6) relates to the method that a kind of employing " Orthogonal Composite mode " produces a new best learning object, it is characterized in that using the method for orthogonal experiment to excavate the individual historical optimum P of particle iWith the information of the G of population global optimum and be combined into a learning object that can guide particle to evolve to better direction, concrete operation steps comprises:
(1) for particle i, suppose that the circuit component quantity that needs to optimize is D, the dimension that is to say problem to be optimized is D, generates 2 horizontal quadrature tables with D factor, this orthogonal arrage is total
Figure BSA00000892916500041
OK.
(2) produce M solution according to orthogonal arrage, separate X for each j(each dimension x of 1≤j≤M) Jd(1≤d≤D), if the corresponding value of the capable d row of j is 1 in the orthogonal arrage, then establish x Jd=p Id(be that information comes from the individual historical optimum P of particle i), otherwise the corresponding value of the capable d row of j is 2 in the orthogonal arrage, then establishes x Jd=g d(being that information comes from the G of population global optimum).
(3) to all X j(1≤j≤M) carry out adaptive value to assess, and find out optimum solution, be made as X b
(4) according to all M solution, calculate the optimal level (just finding out the optimal level of each factor by the factor-analysis approach of orthogonal experiment) of each dimension.
(5) use new solution X of optimal level combination of each dimension that step (4) calculates p(being called prediction separates), and assessment X pAdaptive value.
(6) compare X bAnd X pAdaptive value, and with O iBeing set to wherein adaptive value separates preferably.
Description of drawings:
Fig. 1 power electronic circuit synoptic diagram
Fig. 2 is based on the power circuit element optimal design process flow diagram of quadrature study population
Embodiment:
Further the method for invention is described below in conjunction with accompanying drawing.
In Fig. 1, provided the synoptic diagram of the general structure of power electronic circuit.In circuit, there are circuit components such as various resistors, capacitor and inductor.When using quadrature study particle cluster algorithm to optimize these circuit components, the variable that these circuit components need need be optimized as algorithm also is encoded in the particle.The circuit component number of supposing a circuit is D, and then the particle code length of algorithm is D, the corresponding circuit component of each dimension, and have certain span.The span of different circuit components generally by the deviser rule of thumb or the obtained value of element set.
According to the algorithm flow chart of Fig. 2, initialized the time, population is encoded to the individual X=[x that length is D with circuit component 1, x 2..., x D], the parameter that particle cluster algorithm is set is as follows: the inertia weights omega is made as 0.5, and study factor c is made as 2.0, and population scale N is made as 40, and maximum evolutionary generation G is made as 500; Generate N=40 particle at random and form population, the position of each particle i and velocity encoded cine are expressed as X respectively i=[x I1, x I2..., x ID] and V i=[v I1, v I2..., v ID]; Wherein D is code length, and is identical with the number of elements of circuit; Position X iIn each dimension value representation should the dimension circuit component value; The locative situation of change of speed; Assess the adaptive value of all particles, make the historical optimal location P of particle i i=[p I1, p I2..., p ID] be current location X i, the position G=[g of global optimum of whole population 1, g 2..., g D] be all historical optimal location P iIn best that, the best learning object O of each particle i is set simultaneously i=[o I1, o I2..., o ID] be current individual historical optimal location P iAnd best learning object inefficacy algebraically t i=0.
In the adaptive value of each individual X of assessment, corresponding adaptive value function definition is:
Φ ( X ) = Σ R L = R L _ min , δR L R L _ max Σ v in = v in _ min , δv in v in _ max [ F 1 ( R L , v in , X ) + F 2 ( R L , v in , X ) + F 3 ( R L , v in , X ) ] + F 4 ( X )
R in the above-mentioned formula L_minAnd R L_max, v In_minAnd v In_maxBe respectively the load R among Fig. 1 LWith input voltage v InMinimum value and maximal value; δ R LWith δ v InBe respectively R LAnd v InChange step.F in the formula 1To F 4It is the evaluation criterion of formulating according to the circuit design slip-stick artist.F wherein 1Be used for assessing output voltage v oError rate; F 2Be used for the switching reaction v of evaluating system d, comprise maximum upper punch and Xia Chong, and stabilization time; F 3Be used for assessing output voltage v oThe voltage stabilizing situation; F 4Be used for the dynamic behaviour of evaluating system under the large-signal condition.These evaluation criterias generally all are to be formulated according to practical situations by the slip-stick artist.
In the particle cluster algorithm operational process, in each generation, all constantly adjusted the value of the solution of each particle representative by the renewal of speed and position, makes the circuit component value optimization that it reflects.In the speed of carrying out particle i and position renewal, by its best learning object O iTo speed V iUpgrade: for V iEach the dimension v Id(1≤d≤D), more new formula is accordingly: v Id=ω * v Id+ c * r * (o Id-x Id); Wherein r is the random number between interval [0,1].After speed was upgraded, the operation that the position is upgraded was as follows: for X iEach the dimension x Id(1≤d≤D) accordingly more new formula be: x Id=x Id+ v Id
Finish after the renewal of particle's velocity and position, another important operation of technology of the present invention is to use the position X after the variation strategy upgrades particle i iMake a variation, strengthen the diversity of algorithm.Concrete method is: generate a random number between [0,1] at random earlier, if the value that this random number less than variation Probability p m (pm=0.01), selects certain one dimension of particle also will tie up is being set in optional scope at random.
Upgrade in speed, position, and after mutation operation finishes, algorithm upgrades position X after the variation to particle i iCarry out the assessment of adaptive value, if new fitness function value is than its historical optimal location P iThe fitness function value better, then with P iBe set to X i, and with the best learning object inefficacy algebraically t of particle i iBe made as 0, otherwise with the best learning object inefficacy algebraically t of particle i iBe made as t i+ 1; In addition, judge new P iWhether more excellent than the position G of global optimum of population, if then G is replaced with P i
For particle i, if its best learning object inefficacy algebraically t iSurpass preset threshold value (value was 5 generations among the present invention program), then adopt " Orthogonal Composite mode " to produce a new best learning object, and with t iBe made as 0; Here " Orthogonal Composite mode " produces the technology of a new best learning object, it is characterized in that using the method for orthogonal experiment to excavate the individual historical optimum P of particle iWith the information of the G of population global optimum and be combined into a learning object that can guide particle to evolve to better direction, in " summary of the invention " of concrete operation steps in instructions detailed description has been arranged.
Carry out the operation in each generation of particle cluster algorithm repeatedly, by the effect of quadrature learning strategy and variation strategy, make algorithm under the prerequisite that keeps the quick convergence of population, to have strengthened the diversity of population, avoid algorithm to fall into the defective of local optimum easily.In the present invention, the end condition of algorithm is the iteration in 500 generations.After algorithm was finished the iteration in 500 generations, the value of each dimension was corresponding circuit component value in the solution of resulting global optimum position G representative.

Claims (3)

1. the quadrature based on the band mutation operator is learnt the method that particle cluster algorithm is optimized the power electronic circuit element, it is characterized in that avoiding algorithm to fall into the defective of local optimum easily by design quadrature learning strategy and mutation operator, this technical method may further comprise the steps:
(1) parameter of initialization quadrature study particle cluster algorithm, and N particle at random, the position of each particle i and velocity encoded cine are expressed as X respectively i=[x I1, x I2..., x ID] and V i=[v I1, v I2..., v ID]; Wherein D is code length, and is identical with the number of elements of circuit; Position X iIn each dimension value representation should the dimension circuit component value; The locative situation of change of speed; Assess the adaptive value of all particles, make the historical optimal location P of particle i i=[p I1, p I2..., p ID] be current location X i, the position G=[g of global optimum of whole population 1, g 2..., g D] be all historical optimal location P iIn best that, the best learning object O of each particle i is set simultaneously i=[o I1, o I2..., o ID] be current individual historical optimal location P i, best learning object inefficacy algebraically t i=0;
(2) to each particle i, by its best learning object O iTo speed V iUpgrade; For V iEach the dimension v Id, 1≤d≤D wherein, more new formula is accordingly: v Id=ω * v Id+ c * r * (o Id-x Id); Wherein ω is that 0.5, c is that 2.0, r is the random number between interval [0,1];
(3) to each particle i, its current location is upgraded in use location more new formula, for X iEach the dimension x Id, 1≤d≤D wherein, more new formula is accordingly: x Id=x Id+ v Id
(4) use variation tactful in the position X after the particle i renewal iMake a variation, strengthen the diversity of algorithm;
(5) to the position X after the particle i renewal variation iCarry out the assessment of adaptive value, if new fitness function value is than its historical optimal location P iThe fitness function value better, then with P iBe set to X i, and with the best learning object inefficacy algebraically t of particle i iBe made as 0, otherwise with the best learning object inefficacy algebraically t of particle i iBe made as t i+ 1; In addition, judge new P iWhether more excellent than the position G of global optimum of population, if then G is replaced with P i
(6) for particle i, if its best learning object inefficacy algebraically t iSurpass preset threshold value, value was 5 generations among the present invention program, then adopted " Orthogonal Composite mode " to produce a new best learning object, and with t iBe made as 0;
(7) carry out above step (2), (3), (4), (5) and (6) repeatedly up to satisfying end condition, then the value of each dimension is corresponding circuit component value in the solution of global optimum position G representative.
2. based on the mutation operator described in the step (4) of claim 1, it is characterized in that strengthening by the mode that increases random perturbation the diversity of algorithm; Concrete method is: earlier generate a random number between [0,1] at random, if this random number less than variation Probability p m, this pm=0.01 selects certain one dimension of particle and the value that will tie up is optionally being set in the scope at random.
3. based on the method based on a new best learning object of " Orthogonal Composite mode " generation described in the step (6) of claim 1, it is characterized in that using the method for orthogonal experiment to excavate the individual historical optimum P of particle iWith the information of the G of population global optimum and be combined into a learning object O that can guide particle to evolve to better direction i, concrete operation steps comprises:
(1) for particle i, suppose that the circuit component quantity that needs to optimize is D, the dimension that is to say problem to be optimized is D, generates 2 horizontal quadrature tables with D factor, this orthogonal arrage is total OK;
(2) produce M solution according to orthogonal arrage, separate X for each jEach the dimension x Jd, 1≤j≤M wherein, 1≤d≤D if the corresponding value of the capable d row of j is 1 in the orthogonal arrage, then establishes x Jd=P Id, namely information comes from the individual historical optimum P of particle i, otherwise the corresponding value of the capable d row of j is 2 in the orthogonal arrage, then establishes x Jd=g d, namely information comes from the G of population global optimum;
(3) to all X j, carry out the adaptive value assessment, and find out optimum solution, be made as X b
(4) according to all M solution, calculate the optimal level of each dimension, just find out the optimal level of each factor by the factor-analysis approach of orthogonal experiment;
(5) use new prediction solution X of optimal level combination of each dimension that step (4) calculates p, and assessment X pAdaptive value;
(6) compare X bAnd X pAdaptive value, and with O iBeing set to wherein adaptive value separates preferably.
CN2013101718664A 2013-04-25 2013-04-25 Power circuit component optimization method based on orthogonal learning particle swarm Pending CN103258131A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2013101718664A CN103258131A (en) 2013-04-25 2013-04-25 Power circuit component optimization method based on orthogonal learning particle swarm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2013101718664A CN103258131A (en) 2013-04-25 2013-04-25 Power circuit component optimization method based on orthogonal learning particle swarm

Publications (1)

Publication Number Publication Date
CN103258131A true CN103258131A (en) 2013-08-21

Family

ID=48962043

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2013101718664A Pending CN103258131A (en) 2013-04-25 2013-04-25 Power circuit component optimization method based on orthogonal learning particle swarm

Country Status (1)

Country Link
CN (1) CN103258131A (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105930918A (en) * 2016-04-11 2016-09-07 北京交通大学 Overall distribution-particle swarm optimization algorithm applied to multimodal MPPT (maximum power point tracking)
CN106971161A (en) * 2017-03-27 2017-07-21 深圳大图科创技术开发有限公司 Face In vivo detection system based on color and singular value features
CN108108532A (en) * 2017-12-06 2018-06-01 华南理工大学 With the method for particle cluster algorithm optimization power electronic circuit
CN109146055A (en) * 2018-09-03 2019-01-04 北京珈信科技有限公司 Modified particle swarm optimization method based on orthogonalizing experiments and artificial neural network
CN109614224A (en) * 2018-11-12 2019-04-12 华南理工大学 A kind of method of optimization for power electronic circuit
CN113779856A (en) * 2021-09-15 2021-12-10 成都中科合迅科技有限公司 Discrete particle swarm algorithm modeling method for electronic system function online recombination
CN113778941A (en) * 2021-09-15 2021-12-10 成都中科合迅科技有限公司 Function reconfigurable analog electronic system and method based on group intelligent algorithm

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101446997A (en) * 2008-12-31 2009-06-03 中山大学 Power electronic circuit optimization method based on particle swarm algorithm

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101446997A (en) * 2008-12-31 2009-06-03 中山大学 Power electronic circuit optimization method based on particle swarm algorithm

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
ZHI-HUI ZHAN等: "Orthogonal Learning Particle Swarm Optimization for Power Electronic Circuit Optimization with Free Search Range", 《EVOLUTIONARY COMPUTATION(CEC),2011 IEEE CONGRESS ON》 *
ZHI-HUI ZHAN等: "Orthogonal Learning Particle Swarm Optimization", 《IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION》 *
刘衍民: "粒子群算法的研究及应用", 《中国博士学位论文全文数据库 信息科技辑》 *
秦全德: "粒子群算法研究及应用", 《中国博士学位论文全文数据库 经济与管理科学辑》 *
钟文亮等: "带启发性变异的粒子群优化算法", 《计算机工程与设计》 *

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105930918A (en) * 2016-04-11 2016-09-07 北京交通大学 Overall distribution-particle swarm optimization algorithm applied to multimodal MPPT (maximum power point tracking)
CN105930918B (en) * 2016-04-11 2019-07-02 北京交通大学 Overall distribution-particle swarm optimization algorithm applied to multimodal MPPT
CN106971161A (en) * 2017-03-27 2017-07-21 深圳大图科创技术开发有限公司 Face In vivo detection system based on color and singular value features
CN108108532A (en) * 2017-12-06 2018-06-01 华南理工大学 With the method for particle cluster algorithm optimization power electronic circuit
WO2019109757A1 (en) * 2017-12-06 2019-06-13 华南理工大学 Method for using particle swarm algorithm to optimize power electronic circuit
CN109146055A (en) * 2018-09-03 2019-01-04 北京珈信科技有限公司 Modified particle swarm optimization method based on orthogonalizing experiments and artificial neural network
CN109614224A (en) * 2018-11-12 2019-04-12 华南理工大学 A kind of method of optimization for power electronic circuit
CN109614224B (en) * 2018-11-12 2021-07-20 华南理工大学 Power electronic circuit optimization method
CN113779856A (en) * 2021-09-15 2021-12-10 成都中科合迅科技有限公司 Discrete particle swarm algorithm modeling method for electronic system function online recombination
CN113778941A (en) * 2021-09-15 2021-12-10 成都中科合迅科技有限公司 Function reconfigurable analog electronic system and method based on group intelligent algorithm
CN113778941B (en) * 2021-09-15 2023-06-27 成都中科合迅科技有限公司 Functional recombinant analog electronic system and method based on group intelligent algorithm

Similar Documents

Publication Publication Date Title
CN103258131A (en) Power circuit component optimization method based on orthogonal learning particle swarm
Mi et al. Short-term power load forecasting method based on improved exponential smoothing grey model
Xu et al. Parameter estimation algorithms for dynamical response signals based on the multi‐innovation theory and the hierarchical principle<? show [AQ ID= Q1]?>
Li et al. Brief introduction of back propagation (BP) neural network algorithm and its improvement
Lam et al. Two-step stability analysis for general polynomial-fuzzy-model-based control systems
Bu et al. Stability of first and high order iterative learning control with data dropouts
CN110619389A (en) Load prediction method and system of combined cooling heating and power system based on LSTM-RNN
CN108803601B (en) Robust prediction tracking control method for mobile robot with communication constraint
Ma et al. Model predictive control of building energy systems with balanced model reduction
CN104318303A (en) Coking furnace temperature predication method of RBF (Radial Basis Function) neural network optimized by genetic algorithm
Liu et al. An improved smoothing technique‐based control vector parameterization method for optimal control problems with inequality path constraints
CN103413038A (en) Vector quantization based long-term intuitionistic fuzzy time series prediction method
Liu et al. Efficient Kriging-based aerodynamic design of transonic airfoils: some key issues
Mahata et al. Optimal design of wideband fractional order digital integrator using symbiotic organisms search algorithm
Xiao et al. Modeling mechanism and extension of GM (1, 1)
Zhou et al. An improved metabolism grey model for predicting small samples with a singular datum and its application to sulfur dioxide emissions in China
CN103810324B (en) A kind of build-up tolerance Optimization Design optimized based on cost objective
Du et al. Prediction of chaotic time series of rbf neural network based on particle swarm optimization
CN107480381B (en) The method of response surface model is built based on simulated annealing and applies its system
Tan et al. Stability of hybrid impulsive and switching stochastic systems with time-delay
Xiao et al. Parameter identification of direct‐drive permanent magnet synchronous generator based on EDMPSO‐EKF
Chen et al. Finite‐time adaptive quantized control of stochastic nonstrict‐feedback constrained nonlinear systems with multiple unmodeled dynamics
Wang et al. Generalized predictive control based on particle swarm optimization for linear/nonlinear process with constraints
Gao et al. A novel optimization approach for oil and gas production process considering model parameters uncertainties
CN109085751B (en) Hexapod robot navigation method based on multi-granularity reinforcement learning

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20130821