CN110008641B - Multi-objective structure optimization method for magnetic gear brushless direct current motor - Google Patents

Multi-objective structure optimization method for magnetic gear brushless direct current motor Download PDF

Info

Publication number
CN110008641B
CN110008641B CN201910337534.6A CN201910337534A CN110008641B CN 110008641 B CN110008641 B CN 110008641B CN 201910337534 A CN201910337534 A CN 201910337534A CN 110008641 B CN110008641 B CN 110008641B
Authority
CN
China
Prior art keywords
generation
individual
gene
population
magnetic gear
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
Application number
CN201910337534.6A
Other languages
Chinese (zh)
Other versions
CN110008641A (en
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.)
Suzhou Vocational University
Original Assignee
Suzhou Vocational 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 Suzhou Vocational University filed Critical Suzhou Vocational University
Priority to CN201910337534.6A priority Critical patent/CN110008641B/en
Publication of CN110008641A publication Critical patent/CN110008641A/en
Application granted granted Critical
Publication of CN110008641B publication Critical patent/CN110008641B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00Computer-aided design [CAD]
    • G06F30/20Design optimisation, verification or simulation
    • G06F30/23Design optimisation, verification or simulation using finite element methods [FEM] or finite difference methods [FDM]
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/60Other road transportation technologies with climate change mitigation effect
    • Y02T10/64Electric machine technologies in electromobility

Abstract

The invention discloses a multi-objective structure optimization method of a magnetic gear brushless direct current motor, which takes volume minimization and efficiency maximization as optimization targets, and in the analysis process, relevant limiting conditions such as current, slip, magnetic flux density, power factor and the like are considered, and stator slot number, rotor slot number, outer diameter of a rotor end ring and inner diameter of the rotor end ring are selected as optimization targets, so that the performance of the magnetic gear brushless direct current motor system is improved. The method mainly comprises the steps that the chaotic search reverse learning difference method integrates the chaotic search and the reverse learning method into the differential evolution method, and besides the searching capability of the differential evolution method can be improved, only two control parameters need to be specified, so that the chaotic search reverse learning difference method has robustness, the framework has the capability of on-line parameter adjustment, has better structural optimization capability for the magnetic gear brushless direct current motor, and can effectively improve the dynamic characteristics of a driving system.

Description

Multi-objective structure optimization method for magnetic gear brushless direct current motor
Technical Field
The invention relates to the technical field of electric transmission, in particular to a multi-objective structure optimization method of a magnetic gear brushless direct current motor.
Background
Compared with mechanical gears, the magnetic gear has the advantages of low noise, high efficiency, convenience in maintenance, high reliability, overload protection and the like. The magnetic gear has wide application in the field of electric transmission of high-force density driving devices and the like, and is particularly suitable for occasions without lubrication, noise, friction energy consumption, oil pollution, water and dust. The magnetic gear and the brushless direct current motor are integrated to form the magnetic gear brushless direct current motor, and the magnetic gear brushless direct current motor is applied to an electric automobile, has high power density, high torque density and wide speed range, and comprises low-speed climbing and high-speed running, high efficiency, wide fixed power area, fixed rotating speed area and high reliability. Therefore, how to improve the efficiency of the magnetic gear brushless direct current motor becomes a very important subject, and in order to formulate and improve the lowest efficiency of the induction motor, the invention provides a method for applying the chaotic search reverse learning difference method to the magnetic gear brushless direct current motor so as to optimize the structure and improve the performance of the magnetic gear brushless direct current motor.
The chaotic search reverse learning difference method integrates the chaotic search and the reverse learning method into the differential evolution method so as to overcome the defects of the differential evolution method on the selection of crossing factors, proportion parameters and variation operation elements, and besides the search capability of the differential evolution method can be improved, only two control parameters need to be specified, so that the chaotic search reverse learning difference method has robustness. Through searching related patents and documents at home and abroad, a multi-objective structure optimization method for applying the chaotic search reverse learning difference method to the magnetic gear brushless direct current motor is not available.
Disclosure of Invention
The technical problem to be solved by the invention is to overcome the defects of the prior art and provide a multi-objective structure optimization method of a magnetic gear brushless direct current motor, which takes volume minimization and efficiency maximization as analysis targets, and in the analysis process, relevant limiting conditions such as current, slip, magnetic flux density, power factor and the like are considered, and the number of stator grooves, the number of rotor grooves, the outer diameter of a rotor end ring and the inner diameter of the rotor end ring are selected as optimization targets, so that the magnetic gear brushless direct current motor system is more in line with an electric vehicle and the like.
The invention adopts the following technical scheme for solving the technical problems:
the multi-objective structure optimization method of the magnetic gear brushless direct current motor provided by the invention is characterized by comprising the following steps of:
step S1, initializing
Selecting the number of stator slots, the number of rotor slots, the outer diameter of a rotor end ring and the inner diameter of the rotor end ring in the structural parameters of the magnetic gear brushless direct current motor as structural parameters, and generating initial 4 groups simultaneously; selecting any one of the structural parameters as one of the groups, wherein the initial group generation is randomly started in the search space, and the implementation is as shown in formula (1)
wherein ,sigma, the initial population i ∈(0,1]In the initial population, all individuals produce the random numbers in the manner shown in formula (1); n (N) p Is the size of the group, X i,max and Xi,min Respectively representing the upper limit value and the lower limit value of the ith individual;
step S2, mutation operation
In the differential evolution method, the operation mode of the variation operand is carried out in a vector difference mode, and in the group of the G generation, any two individuals define the vector difference of the formula (2),
wherein ,Djk In the form of a vector difference,the j and k individuals in the G generation population, respectively;
by the vector difference concept, the next generation candidate individuals are generated by individuals by using a variation operand, as shown in formula (3);
wherein ,is the i-th individual estimate in the G+1 generation population, < >>Is the p-th individual in the G generation population, F is the scale factor;
simultaneously performs the crossover operation of the following formula (4),
wherein i=1 p And g=1..m, g e (0, m) natural number, m is natural number, C r The cross factor of e (0, 1),the ith gene of the G-th individual in the G+1 generation group,>the ith gene of the G-th individual in the G-th generation group,/-th individual in the G-th generation group>An estimate of the ith gene for the G-th individual in the G-th generation population; the concept of quantitative mechanism is cited here to generate the next generation of offspring, and the variant operand is generated in the following formula (5):
wherein u is E (0, 1)]U is a random number, and u is a random number,1 st gene of the ith individual in the G generation group,/I>2 nd gene of the i-th individual in the G generation group,/I>I individuals in the G generation population;
step S3, judging and selecting
The individuals aiming at the offspring compete with the individuals aiming at the corresponding father, and the generation mode is as follows:
wherein argmin is the minimum of the two expressions taking this latter expression,is the individual in the G+1 generation, +.>For individuals in the G generation,/->An estimated value function expression for individuals in generation G+1;
step S4, elimination method
The chaotic search reverse learning difference method introduces the elimination method, and the operation mode is that a new individual is generated by the following method,
wherein, alpha and delta are numbers randomly generated between 0 and 1, and />The worst and best individuals in the g+1 generation, respectively,/-on>Is a new individual in the generation G+1, < >>1 st gene of the ith individual in the G+1 generation,/o>The ith individual in the G+1 generation2 genes; if the new individual generated by formula (7) is better than the worst individual in the G generation, this individual will replace the worst individual in the G generation;
step S5, number shifting operation
The shift operation is based on the current best population, and regenerates new population to maintain the diversity of the population, enhance the searching ability of the minor population, and generate the g gene of the i-th individual as follows:
wherein the parameter sigma i And δ is a random number, i=1, …, N p And g=1, …, m,the g gene, X, of the i-th individual gmin Minimum value of g gene, X gmax Is the maximum value of the g gene;
step S6, accelerating operation
When the generation of the individual is not more preferable than the previous optimal individual, the acceleration operand is executed, and the descent method is adopted as the acceleration operand, wherein the expression (9) is as follows,
wherein ,represents the G generation optimal individual, f represents the objective function gradient, phi is the step size,/>For the best individual of the G+1st generation, < >>Formula for optimal individual function of generation G+1, < ->The optimal individual function formula of the current G generation;
step S7, repeating the steps S2 to S4 for 4 structural parameters of the stator slot number, the rotor end ring outer diameter and the rotor end ring inner diameter, wherein each group repeats the steps S2 to S4 to N times, N is a preset number of times, and all the structural parameters can be optimized.
As a further optimization scheme of the multi-objective structure optimization method of the magnetic gear brushless direct current motor, v f is obtained through approximate calculation by a finite difference method.
As a further optimization scheme of the multi-objective structure optimization method of the magnetic gear brushless direct current motor, the initial value of phi is set to be 1.
As the multi-objective structure optimization method of the magnetic gear brushless direct current motor, the parameter sigma is further optimized i Is a random number between 0 and 1.
As a further optimization scheme of the multi-objective structure optimization method of the magnetic gear brushless direct current motor, the parameter delta is a random number between 0 and 1.
Compared with the prior art, the technical scheme provided by the invention has the following technical effects:
(1) Compared with the chaotic search and reverse learning method, the chaotic search and reverse learning difference method has the advantages of high online learning convergence speed, strong function imitation capability and memory capability, and can obviously improve the structural optimization method of the magnetic gear brushless direct current motor and obviously improve the system performance;
(2) The chaotic search reverse learning difference method overcomes the defect that the chaotic search and the reverse learning method all need to set a larger population number so as to be capable of searching solutions.
Drawings
Fig. 1 is a flow chart of the method of the present invention.
Detailed Description
The technical scheme of the invention is further described in detail below with reference to the accompanying drawings:
the embodiment 1 provides a multi-objective structure optimization method of a magnetic gear brushless direct current motor, which comprises the following steps:
the chaotic search reverse learning differencing method steps can be briefly described as follows:
step S1, initializing
Selecting the number of stator slots, the number of rotor slots, the outer diameter of a rotor end ring and the inner diameter of the rotor end ring in the structural parameters of the magnetic gear brushless direct current motor as structural parameters, and generating initial 4 groups simultaneously; selecting any one of the structural parameters as one of the groups, the initial group generation is performed by randomly starting in the search space, and the method is as follows
In the formula (1), the components are as follows,sigma, the initial population i ∈(0,1]In the initial population, all individuals generate the random numbers in the manner shown in formula (1). N (N) p Is the size of the group, X i,max and Xi,min Representing the i-th individual upper limit and lower limit, respectively.
Step S2, mutation operation
In the differential evolution method, the operation mode of the variation operand is carried out in a vector difference mode, and any two individuals in the group of the G generation can define the vector difference of the following formula,
in the formula (2), D jk In the form of a vector difference,the j and k individuals in the G generation population, respectively.
By the vector difference concept, the next generation candidate individual can be generated by using the variant operand as in formula (3).
In the formula (3), the amino acid sequence of the compound,is the i-th individual estimate in the G+1 generation population, < >>Is the p-th individual in the G generation group, where F is a scale factor.
Meanwhile, in order to enhance the characteristics of the population variability, the differential evolution method performs a crossover operation of the following formula,
in the formula (4), the amino acid sequence of the compound, i=1 and, N p And g=1..m, g e (0, m) natural number, m is natural number, C r The crossing factor of E (0, 1) is self-determined according to the situation;the ith gene of the G-th individual in the G+1 generation group,>the ith gene of the G-th individual in the G-th generation group,/-th individual in the G-th generation group>An estimate of the ith gene of the G-th individual in the G-th generation population. The concept of quantitative mechanism is cited here to generate the next generation of offspring, the variant operand is generated as follows:
in the formula (5), u is E (0, 1)]U is a random number, and u is a random number,is the 1 st gene of the i-th individual in the G generation group,/I>The 2 nd gene of the i-th individual in the G-generation group.
Step S3 judgment and selection
In this part, the offspring are mutually competing with the parent corresponding to the offspring, and the generation mode is as follows:
in the formula (6), the amino acid sequence of the compound,for the ith individual in the G generation population, argmin is the minimum of the two expressions of this latter formula; />Is the individual in the G+1 generation, +.>For individuals in the G generation,/->Is an estimated value function expression of individuals in the generation G+1.
Step S4 elimination method
The idea of the elimination method is to accelerate the convergence speed of the chaotic search reverse learning difference method; the chaotic search reverse learning difference method is introduced into the elimination method by firstly utilizing the following procedures to generate a new individual,
in formula (7), wherein alpha and delta are each a number randomly generated between 0 and 1, and />The worst and best individuals in the g+1 generation, respectively. />Is a new individual in the generation G+1, < >>1 st gene of the ith individual in the G+1 generation,/o>Is the 2 nd gene of the i-th individual in the generation G+1. If the new individual generated by formula (7) is better than the worst individual in the G generation, this individual will replace the worst individual in the G generation.
Step S5 of the number-shift operation
The shift operation is based on the current best population, and regenerates new population to maintain the diversity of the population, enhance the searching ability of the minor population, and generate the g gene of the i-th individual as follows:
in the formula (8), the parameter sigma i And δ is a random number between 0 and 1, i=1, …, N p And g=1, …, m,the g gene, X, of the i-th individual gmin Minimum value of g gene, X gmax Is the maximum value of the g gene.
Step S6 of accelerating operation
When the generation of the individual is not more preferable than the previous optimal individual, the acceleration operand is executed, and the descent method is adopted as the acceleration operand,
represents the G generation optimal individual, and f represents the objective function gradient, wherein the gradient can be obtained by approximate calculation through a finite difference method, phi is the step size, and is set as 1 +.>For the best individual of the G+1st generation, < >>Formula for optimal individual function of generation G+1, < ->And the optimal individual function formula for the current generation G.
Step S7
For the 4 structural parameters of the stator slot number, the rotor end ring outer diameter and the rotor end ring inner diameter, each group repeats steps S2 to S4 to N times, N is a preset number of times, and all the structural parameters can be optimized, and the process is shown in fig. 1.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present invention should be included in the scope of the present invention.

Claims (5)

1. The multi-target structure optimization method of the magnetic gear brushless direct current motor is characterized by comprising the following steps of:
step S1, initializing
Selecting the number of stator slots, the number of rotor slots, the outer diameter of a rotor end ring and the inner diameter of the rotor end ring in the structural parameters of the magnetic gear brushless direct current motor as structural parameters, and generating initial 4 groups simultaneously; selecting any one of the structural parameters as one of the groups, wherein the initial group generation is randomly started in the search space, and the implementation is as shown in formula (1)
wherein ,sigma, the initial population i ∈(0,1]In the initial population, all individuals produce the random numbers in the manner shown in formula (1); n (N) p Is the size of the group, X i,max and Xi,min Respectively representing the upper limit value and the lower limit value of the ith individual;
step S2, mutation operation
In the differential evolution method, the operation mode of the variation operand is carried out in a vector difference mode, and in the group of the G generation, any two individuals define the vector difference of the formula (2),
wherein ,Djk In the form of a vector difference,the j and k individuals in the G generation population, respectively;
by the vector difference D jk A next generation candidate individual generated by the individual using a variant operand, as in formula (3);
wherein ,is the i-th individual estimate in the G+1 generation population, < >>Is the p-th individual in the G generation population, F is the scale factor;
simultaneously performs the crossover operation of the following formula (4),
wherein i=1 p And g=1..m, g e (0, m) natural number, m is natural number, C r The cross factor of e (0, 1),the ith gene of the G-th individual in the G+1 generation group,>the ith gene of the G-th individual in the G-th generation group,/-th individual in the G-th generation group>An estimate of the ith gene for the G-th individual in the G-th generation population; the concept of quantitative mechanism is cited here to generate the next generation of offspring, and the variant operand is generated in the following formula (5):
wherein u is E (0, 1)]U isA random number is used to determine the random number,1 st gene of the ith individual in the G generation group,/I>2 nd gene of the i-th individual in the G generation group,/I>I individuals in the G generation population;
step S3, judging and selecting
The individuals aiming at the offspring compete with the individuals aiming at the corresponding father, and the generation mode is as follows:
wherein argmin is the minimum of the two expressions taking this latter expression,is an individual in the generation G+1,is a functional expression of individuals in the G generation, < >>An estimated value function expression for individuals in generation G+1;
step S4, elimination method
The chaotic search reverse learning difference method introduces the elimination method, and the operation mode is that a new individual is generated by the following method,
wherein, alpha and delta are numbers randomly generated between 0 and 1, and />The worst and best individuals in the g+1 generation, respectively,/-on>Is a new individual in the generation G+1, < >>1 st gene of the ith individual in the G+1 generation,/o>The 2 nd gene of the i-th individual in the G+1 generation; if the new individual generated by formula (7) is better than the worst individual in the G generation, this individual will replace the worst individual in the G generation;
step S5, number shifting operation
The shift operation is based on the current best population, and regenerates new population to maintain the diversity of the population, enhance the searching ability of the minor population, and generate the g gene of the i-th individual as follows:
wherein the parameter sigma i And δ is a random number, i=1, …, N p And g=1, …, m,the g gene, X, of the i-th individual gmin Minimum value of g gene, X gmax Is the maximum value of the g gene;
step S6, accelerating operation
When the generation of the individual is not more preferable than the previous optimal individual, the acceleration operand is executed, and the descent method is adopted as the acceleration operand, wherein the expression (9) is as follows,
wherein ,represents the best individual of the G generation,>represents the gradient of the objective function, phi is the step size,/-, and>for the best individual of the G+1st generation, < >>Formula for optimal individual function of generation G+1, < ->The optimal individual function formula of the current G generation;
step S7, repeating the steps S2 to S4 for 4 structural parameters of the stator slot number, the rotor end ring outer diameter and the rotor end ring inner diameter, wherein each group repeats the steps S2 to S4 to N times, N is a preset number of times, and all the structural parameters can be optimized.
2. The method for optimizing the multi-objective structure of a magnetic gear brushless DC motor of claim 1, wherein,and the method is obtained by approximate calculation through a finite difference method.
3. The method of optimizing a multi-objective structure of a magnetic gear brushless dc motor of claim 1, wherein the initial value of Φ is set to 1.
4. The method for optimizing the multi-objective structure of a magnetic gear brushless direct current motor according to claim 1, wherein the parameter σ is i Is a random number between 0 and 1.
5. The method of claim 1, wherein the parameter δ is a random number between 0 and 1.
CN201910337534.6A 2019-04-25 2019-04-25 Multi-objective structure optimization method for magnetic gear brushless direct current motor Active CN110008641B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910337534.6A CN110008641B (en) 2019-04-25 2019-04-25 Multi-objective structure optimization method for magnetic gear brushless direct current motor

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910337534.6A CN110008641B (en) 2019-04-25 2019-04-25 Multi-objective structure optimization method for magnetic gear brushless direct current motor

Publications (2)

Publication Number Publication Date
CN110008641A CN110008641A (en) 2019-07-12
CN110008641B true CN110008641B (en) 2023-08-18

Family

ID=67174150

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910337534.6A Active CN110008641B (en) 2019-04-25 2019-04-25 Multi-objective structure optimization method for magnetic gear brushless direct current motor

Country Status (1)

Country Link
CN (1) CN110008641B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113239488B (en) * 2021-05-08 2023-05-12 武汉理工大学 Balance vibration reduction gear and multi-objective structure optimization method for same
CN113408160B (en) * 2021-08-19 2021-11-23 佛山仙湖实验室 Motor parameter design method based on multi-objective optimization

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106295880A (en) * 2016-08-10 2017-01-04 广东工业大学 A kind of method and system of power system multi-objective reactive optimization
US9652213B2 (en) * 2014-10-23 2017-05-16 National Instruments Corporation Global optimization and verification of cyber-physical systems using floating point math functionality on a system with heterogeneous hardware components

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9652213B2 (en) * 2014-10-23 2017-05-16 National Instruments Corporation Global optimization and verification of cyber-physical systems using floating point math functionality on a system with heterogeneous hardware components
CN106295880A (en) * 2016-08-10 2017-01-04 广东工业大学 A kind of method and system of power system multi-objective reactive optimization

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
改进遗传蚁群算法及其在电机结构优化中的研究;谢颖;《电机与控制学报》;20151030;全文 *

Also Published As

Publication number Publication date
CN110008641A (en) 2019-07-12

Similar Documents

Publication Publication Date Title
CN110008641B (en) Multi-objective structure optimization method for magnetic gear brushless direct current motor
Chen et al. Multiobjective optimization design of a switched reluctance motor for low-speed electric vehicles with a Taguchi–CSO algorithm
CN102275527A (en) Method for controlling gear of transmission and torque of motor of electric vehicle
CN107330174A (en) A kind of wheel hub motor optimization method based on genetic annealing algorithms
CN108073755B (en) Multi-objective optimization design method for switched reluctance motor system of electric vehicle
CN103678783A (en) Method of optimallying designing closed-winding permanent magnet brushless DC motor
CN107122573B (en) Automobile operation condition design method based on Markov chain evolution
Salameh et al. Driving cycle analysis methods using data clustering for machine design optimization
CN115284973A (en) Fuel cell automobile energy management method based on improved multi-target Double DQN
CN110247586B (en) Efficiency optimization-based permanent magnet synchronous motor torque distribution method for electric bus
Akinci et al. Design and optimization with genetic algorithm of double rotor axial flux permanent magnet synchronous motor (torus type) for electrical vehicles
CN112265538B (en) Vehicle component working condition construction method based on real-time optimal energy management strategy
CN108736773B (en) Multi-objective optimization method for disc type permanent magnet synchronous generator in small wind power generation system
CN111614215B (en) Method for designing driving motor for electric vehicle based on generation of countermeasure network
CN108363302B (en) Ship dynamic positioning bottom layer propeller control method based on harmony search
CN107623421B (en) A kind of optimum design method of the automobile drive motor based on more operating conditions
Pan et al. Accurate and efficient surrogate model-assisted optimal design of flux reversal permanent magnet arc motor
Yang et al. Optimization of fuzzy controller based on genetic algorithm
CN110362889A (en) A kind of MPBLDCLM Multipurpose Optimal Method based on genetic algorithm
CN113177341B (en) Magnetic suspension flywheel motor multi-objective optimization design method based on kriging approximate model
Sholahuddin et al. Structural optimizations of a 12/8 switched reluctance motor using a genetic algorithm
CN110185791B (en) Control parameter optimization method for stepped automatic transmission
CN117172114B (en) Multi-target particle swarm cooperation group method of double-armature bearingless magnetic flux reversing motor
CN113537620A (en) Vehicle speed prediction method based on Markov model optimization and working condition recognition
CN104843013A (en) Efficient gear transmission ratio matching method of car speed changing system

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