Method for solving inverse mapping of motor performance Kriging agent model based on coordinate descent method

By training the Kriging agent model and using coordinate descent method and one-dimensional projection gradient method, the problem of reverse prediction of size parameters of motor performance is solved, and the combination solution of size parameters corresponding to motor performance is realized, simplifying the optimization process and improving accuracy and efficiency .

CN119026419AActive Publication Date: 2024-11-26SOUTHEAST UNIV

Patent Information

Application Number
CN202411125140.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-16
Publication Date
2024-11-26
Estimated Expiration
2044-08-16

AI Technical Summary

Technical Problem

Existing agent models cannot inversely predict the combination of motor size parameters that meet the conditions given motor performance, and the Kriging model is prone to fall into the local optimal solution when inverse mapping.

Method used

The sample data set is generated through finite element simulation analysis, the Kriging agent model is trained, the minimization optimization model is constructed, and the coordinate descent method and one-dimensional projection gradient method are used to solve it, and the motor size parameters are gradually updated until the objective function converges to the global minimum value, realizing the motor Performance-dependent combination of size parameters.

Benefits of technology

Effectively obtaining the combination of motor size parameters corresponding to motor performance simplifies the solution process of high-dimensional optimization problems, improves the accuracy and efficiency of inverse mapping, and avoids the trap of local optimal solutions.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119026419A_ABST
    Figure CN119026419A_ABST
Patent Text Reader

Abstract

The invention discloses a method for solving inverse mapping of a motor performance Kriging agent model based on a coordinate descent method, which comprises the following steps of: firstly, sampling different motor size parameter combinations, constructing a Kriging agent model # imgabs0 # which takes a plurality of motor size parameters as input variables and takes the performance of a single motor as output response by utilizing samples, then giving motor performance yc, and calculating the inverse mapping of a Kriging agent model # imgabs0 #; and constructing an optimization model by taking # imgabs1 # as a minimization objective function and taking a motor size parameter variation range in a sample of a Kriging agent model training source as a feasible region. And finally, continuously and repeatedly carrying out minimization solution on the target function along the coordinate axis direction corresponding to the single component of the input variable based on a coordinate descent method, so that the target function is finally converged to 0, and a motor size parameter combination # imgabs2 # corresponding to the given motor performance yc is obtained. And the method has good practicability and economical efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a method for solving inverse mapping of a Kriging proxy model of motor performance based on a coordinate descent method, and belongs to the technical field of motor body simulation design. Background Art

[0002] In application problems such as motor size optimization design and sensitivity analysis, it is often necessary to traverse hundreds or thousands of simulation models to calculate simulation results, but the cost of each simulation calculation is very expensive. The proxy model solves this problem by fitting the mapping relationship between parameter combinations and simulation results, which can save simulation computing resources that take up a large proportion of time. However, most proxy models can only achieve unidirectional mapping. For example, the proxy model that fits the mapping relationship between multiple motor size parameters and a single motor performance can only use size parameter combinations as input variables and motor performance as output responses, but cannot output qualified motor size parameter combinations under the premise of given motor performance.

[0003] The Kriging interpolation method systematically proposed by Georges Matheron in "Principles of geostatistics" can be used as a regression model to fit the mapping relationship between input variables and output responses through known sampling data, and at the same time give the predicted value and variance of the predicted value at any point, with high approximate accuracy, generating a more accurate spatial prediction model. However, when fitting the mapping relationship between input variables and output responses, the Kriging model can only predict the output response through the given input variables, and cannot reversely predict the value of the input variable through the given output response.

[0004] In "Optimization Theory and Algorithms", Chen Baolin demonstrated the external penalty function method of converting the equality condition into the square term of the function and adding it to the objective function. This method can also be used to solve the problem that the inverse mapping of the function expression is too complex to be found, and the inverse mapping problem can be converted into an optimization model for solution. At the same time, the steepest descent method based on the Armjio criterion mentioned in the book was first proposed by Cauchy. It iterates along the negative gradient direction and has a faster convergence speed when solving unconstrained convex optimization problems. However, when the inverse mapping problem of the Kriging model is converted into an optimization problem, the model is only more accurate in the sampling area, and the converted optimization problem needs to be solved in the sampling area as the feasible domain.

[0005] The projected gradient method proposed by Rosen in "The Gradient Projection Method for Nonlinear Programming" is a generalization of the steepest descent method for constrained optimization problems. It projects the gradient descent direction onto the feasible domain, so that the optimization variables obtained in each iteration process are always within the feasible domain, and can quickly solve constrained non-convex optimization problems. However, when it is used to solve the optimization problem after the inverse mapping problem of the Kriging model is transformed, due to too many optimization variables and a complex model, the optimization model eventually falls into a local optimal solution. Summary of the invention

[0006] The technical problem to be solved by the present invention is to provide a method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method, which can provide a motor simulation model size parameter combination corresponding to the given output performance under the condition of a given motor performance value.

[0007] The present invention adopts the following technical solutions to solve the above technical problems:

[0008] Determine multiple motor size parameters and calculate m different motor size parameter combinations s through finite element simulation analysis method i Corresponding motor performance y i (i=1,2,...,m) as the sample data set (S,Y); then the motor size parameters are used as the multidimensional input variables X of the proxy model, and the motor performance is used as the output response y of the proxy model. The Kriging proxy model is obtained by training the sample data set (S,Y) Used to fit the mapping relationship between motor parameter combination and motor performance;

[0009] For a given motor performance value y c ,by As the objective function, the variation range of motor size in the sample data set (S, Y) is taken as the feasible domain of the multidimensional variable X, and a minimization optimization model is constructed.

[0010] For the minimization optimization model constructed above, given a random multi-dimensional initial optimization variable X 0 , randomly select the multidimensional variable X 0 The value of this component that minimizes the objective function is obtained by the one-dimensional projected gradient method, and then the initial proxy model input variable X is updated. 0 The value of this component in the new stage agent model input variable X is obtained 1 , and the process of updating the components of the proxy model input variable X is repeated until the objective function of the optimization model converges to the global minimum value 0, and the motor performance constant y is obtained. c Corresponding motor size parameter combinations as input variables of the proxy model

[0011] As a preferred solution of the present invention, the sample data set (S, Y) required for the Kriging proxy model training is obtained by performing finite element model simulation analysis and calculation on the motor through Latin hypercube sampling. Any sample s in S i =(s i1 ,s i2 ,...,s in ) is an n-dimensional vector, corresponding to n motor size parameters.

[0012] As a preferred solution of the present invention, the Kriging proxy model needs to perform maximum value normalization preprocessing on the sample data set during training.

[0013] As a preferred solution of the present invention, the basis functions of the Kriging proxy model include but are not limited to constant basis functions, linear basis functions, and quadratic polynomial basis functions.

[0014] As a preferred solution of the present invention, the inverse mapping of the Kriging proxy model does not require the original mapping to be a bijection in the traditional sense, but is a generalized inverse mapping that does not require a one-to-one correspondence.

[0015] As a preferred solution of the present invention, the hyperparameter tuning process of the Kriging proxy model is completed by a genetic algorithm.

[0016] As a preferred solution of the present invention, the objective function of the minimization optimization model is the square of the difference between the given performance value and the Kriging proxy model, that is, Feasible Region It is determined by the range of sample values ​​in the sample data set S of the constructed Kriging surrogate model, that is, the jth component X of the variable X j The feasible range is [X j min ,X j max ],in The final optimized model is as follows:

[0017]

[0018] As a preferred solution of the present invention, the motor performance includes but is not limited to motor torque, loss, etc.

[0019] As a preferred solution of the present invention, the component updating process of the proxy model input variable X is specifically described as follows:

[0020] For a randomly selected sequence number j, the jth component of the input variable X' in the new stage is solved by the one-dimensional projected gradient method As a new component, the other components remain unchanged compared with the original input variable X, that is, where X=(X1,X2,...,X n ), X'=(X1',X2',...,X n ').

[0021] As a preferred solution of the present invention, the step length search process of a single component in the one-dimensional projection gradient method follows the Armjio criterion.

[0022] Compared with the prior art, the present invention adopts the above technical solution and has the following technical effects:

[0023] 1. The present invention samples different motor parameter combinations, trains the motor performance Kriging proxy model through the samples, and uses the Kriging proxy model to Indicates that X is the input variable representing the motor parameter combination, and the function returns the predicted value of the motor performance by the Kriging model. Then, given the required performance y c Under the premise of The objective function is the optimization model with the sample area collected for Kriging proxy model training as the feasible domain. When the target value of the optimization model is 0, the optimal solution is the motor parameter combination corresponding to the given required performance. This method is very simple and easy to understand. It can effectively obtain the result of its inverse mapping while ensuring the accuracy of the Kriging proxy model in the sample area.

[0024] 2. The present invention solves the optimization problem after the inverse mapping problem of the Kriging model is transformed based on the coordinate descent method, that is, in each stage, a component of the optimization variable is randomly selected, and the solution is obtained along the coordinate axis direction corresponding to the component by the one-dimensional projection gradient method until the final optimization target value converges to 0. The optimal solution finally obtained is the value obtained by the inverse mapping of the Kriging model, and when the value of the initial optimization variable is changed, the value of the optimal solution finally obtained will also change. Then, multiple groups of motor size parameter combinations corresponding to given performance values ​​can be provided by changing the initial optimization variable value multiple times. The optimization model after the inverse mapping problem of Kriging is solved based on the coordinate descent method can effectively obtain the optimal solution that makes the objective function converge to 0. The coordinate descent method converts the optimization model solving process of high-dimensional optimization variables into the optimization model of multiple one-dimensional optimization variables, which simplifies the solution process and has strong flexibility. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] Figure 1It is a flow chart of a method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method of the present invention;

[0026] Figure 2 48-slot stator and 8-pole δ-type permanent magnet flat wire motor;

[0027] Figure 3 It is the distribution diagram of the number of iterations of 100 repeated experiments to solve the optimization model of the surrogate model torque inverse mapping;

[0028] Figure 4 It is the distribution of 100 repeated experimental iterations for solving the proxy model loss inverse mapping optimization model. DETAILED DESCRIPTION

[0029] The embodiments of the present invention are described in detail below, and examples of the embodiments are shown in the accompanying drawings. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be interpreted as limiting the present invention.

[0030] In the process of motor parameter design, simulation analysis is expensive. The proxy model establishes a unidirectional mapping relationship between motor size parameters and motor performance, saving most of the time spent on simulation analysis. At the same time, motor parameter design often needs to determine the size parameters of the motor according to the actual application performance requirements of the motor. Under the premise of using the proxy model to reduce the cost of simulation analysis, the inverse mapping between the motor performance and the motor size parameters of the proxy model is obtained. The technical solution adopted by the present invention establishes a Kriging proxy model with motor size parameters as input variables and motor performance as output response in advance, and then converts the inverse mapping problem into the solution of the optimization model, and simplifies the solution process based on the coordinate descent method, and finally can obtain the motor parameter combination corresponding to the given motor performance.

[0031] Taking a δ-type permanent magnet flat wire motor with 48 stator slots and 8 rotor poles as an example, the implementation process of the present invention is described in detail. Figure 2 This is the structural diagram of the motor.

[0032] The overall implementation process of the present invention is as follows Figure 1 As shown in the figure, first, multiple motor size parameters are determined as input variables to build the Kriging proxy model, and the motor size parameters and performance sample data sets are collected through experimental design to establish the Kriging proxy model. Used to predict motor performance; then for a given motor performance constant y c , the squared difference between the Kriging surrogate model prediction function and the given value As the objective function, the variation range of motor size in the sample data set is taken as the feasible domain of the multidimensional variable X to construct a minimization optimization model; finally, the optimization model is solved based on the coordinate descent method. In each stage, a component of the optimization variable is randomly selected and solved along the coordinate axis corresponding to the component by the one-dimensional projection gradient method until the final optimization target value converges to 0.

[0033] In the Kriging model inverse mapping solution strategy proposed in the invention, first, the motor parameter input variables and the motor performance output response of the constructed Kriging proxy model are determined. In this embodiment, the 11 selected motor parameter input variables and initial parameter values ​​are shown in Table 1. The motor performance as the output response is the torque mean value or the motor total loss mean value during the stable period of the motor operating condition. The total loss includes the motor core loss, eddy current loss and copper loss.

[0034] Table 1 Main dimensions and parameters of δ-type permanent magnet flat wire motor with 48-slot stator and 8-pole rotor

[0035] Serial number Input variable description Variable designation Initial Value 1 Stator inner diameter mm 127.6 2 Stator slot width mm 4 3 Stator slot height mm 14 4 Slot opening mm 1.5 5 Tooth depth mm 1 6 <![CDATA[Angle of V-shaped magnet L1]]> ° 53 7 <![CDATA[Thickness of L1 permanent magnet]]> mm 3.5 8 <![CDATA[Width of L1 permanent magnet]]> mm 14.75 9 <![CDATA[Magnetic bridge width of L1 permanent magnet]]> mm 3 10 <![CDATA[Thickness of L2 permanent magnet]]> mm 3 11 <![CDATA[Width of L2 permanent magnet]]> mm 6

[0036] By using Latin hypercube sampling, changing the value of the input variable, and performing finite element simulation analysis, the initial data set (S, Y) of the motor performance is obtained. Any sample s in S i =(s i1 ,s i2 ,...,s in ) is an n (n is 11) dimensional vector, corresponding to the 11 motor size parameters in the table. In this embodiment, a total of m groups of data are collected (m is 100).

[0037] The Kriging proxy model is trained through the motor performance data set, and the data set is preprocessed by maximum value normalization during the training process. The 11 motor size parameters in the above table are used as the multidimensional input variable X of the proxy model, and the motor performance is used as the output response y of the Kriging proxy model. The Kriging proxy model is obtained by training the sample data set (S, Y) It is used to fit the mapping relationship between multiple motor parameters and motor performance and predict motor performance. The Kriging proxy model prediction expression can be given by the following formula:

[0038]

[0039] Among them, the input variable X is an n-dimensional vector, f(X) is the basis function of the regression model,

[0040] f(X)=[f1(X),f2(X),…,f p (X)] T (2)

[0041] In this example, when f(X) is a constant basis function, that is, p=1, f1(X)=1, r(X) is the correlation vector between X and S,

[0042]

[0043] It is defined as follows, where θ is a hyperparameter, and the value of θ is determined by the genetic algorithm so that the correlation coefficient between the predicted value of the surrogate model and the actual value is maximized.

[0044]

[0045] β * and γ * is the weight vector of the corresponding function,

[0046] β * =(F T R -1 F) -1 F T R -1 Y (5)

[0047] γ * =R -1 (Y-Fβ * ) (6)

[0048] Where F and R are

[0049]

[0050] For a given motor performance value y c In this example, the given value of torque is 120Nm and the given value of total loss is 2500W. As the objective function, the feasible domain It is determined by the range of sample values ​​in the sample data set S of the constructed Kriging surrogate model, that is, the jth component X of the variable X j The feasible range is [X j min ,X j max ],in The optimization model transformed from the inverse mapping problem of the Kriging surrogate model is as follows:

[0051]

[0052] Given a random multidimensional initial surrogate model input variable Randomly select the multidimensional variable X 0The value of this component that minimizes the objective function is obtained by the one-dimensional projected gradient method, and then the initial proxy model input variable X is updated. 0 The value of this component in the new stage agent model input variable X is obtained 1 , and the process of updating the components of the proxy model input variable X is repeated until the objective function of the optimization model converges to the global minimum value 0 or the total number of iterations in all stages is greater than or equal to the maximum number of iterations k max , and get the motor performance constant y c Corresponding motor size parameter combinations as input variables of the proxy model The objective function converges to 0 in the termination condition and is set to when the objective function is less than ε (ε is set to 1e-5 in this example), the algorithm stops.

[0053] When determining the component value that minimizes the objective function, assume that the sequence number j is randomly selected and the jth component of the input variable X' in the new stage is solved by the one-dimensional projected gradient method. As a new component, the other components remain unchanged compared with the original input variable X, that is, where X=(X1,X2,...,X n ), X'=(X1',X2',...,X n ').

[0054] The optimization model was solved based on the coordinate descent method and the multi-dimensional variable optimization model was solved directly using the projection gradient method. The initial optimization variables were changed and the experiment was repeated 100 times. Tables 2 and 3 show the results of directly using the gradient projection method to solve the optimization model of torque and loss inverse mapping, respectively. At this time, the gradient projection method updates all components of X at the same time in each iteration. It can be seen that directly using the gradient projection method to update all components of X in each iteration has a high probability that the objective function will not converge to 0. In the 100 repeated experiments, the direct solution can only make the objective function converge to 0 in 50% to 60% of the cases.

[0055] Table 2 Direct solution results of the proxy model torque inverse mapping

[0056] Iteration interval Frequency Average time (seconds) k≤10 21 1.17 10<k≤20 25 2.40 k>20 10 3.90 No convergence 44 3.10 total 100 259.92

[0057] Table 3. Direct solution results of proxy model loss inverse mapping

[0058] Iteration interval Frequency Average time (seconds) k≤10 13 2.40 10<k≤20 19 4.62 k>20 22 9.45 No convergence 46 5.72 total 100 589.81

[0059] When solving the optimization model after the conversion of the motor performance inverse mapping problem based on the coordinate descent method, only the value of one component of X is changed when updating the optimization variable in each stage, which simplifies the solution process and can effectively make the optimization model objective function converge to 0. Similar to the direct solution of the inverse mapping problem, the initial optimization variable is also changed, and the experiment is repeated 100 times. The results are shown in Tables 4 and 5. At this time, k refers to the sum of the iterations of the one-dimensional projection gradient method in all stages to solve the optimization model. Compared with the direct use of the projection gradient method, Figure 3 and Figure 4 The distribution diagrams of the number of iterations of 100 repeated experiments are respectively for solving the inverse mapping of torque and loss motor performance. In solving the optimization model based on the coordinate descent method, only one component of X is updated at each stage, instead of updating all components at the same time. This method not only shortens the total time spent on solving the optimization model, but also greatly increases the proportion of the optimization model objective function converging to 0 in repeated experiments. The proportion of the optimization model objective function corresponding to the inverse mapping of torque and loss that does not converge to 0 is less than 5%.

[0060] Table 4 Solution results of the proxy model torque inverse mapping based on the coordinate descent method

[0061] Iteration interval Frequency Average time (seconds) k≤10 58 0.88 10<k≤20 23 1.43 k>20 19 2.89 No convergence 0 - total 100 138.97

[0062] Table 5. Solution results of proxy model loss inverse mapping based on coordinate descent method

[0063] Iteration interval Frequency Average time (seconds) k≤10 48 2.56 10<k≤20 50 5.04 k>20 1 8.92 No convergence 1 22.01 total 100 405.89

[0064] The above implementation modes are only exemplary descriptions of the present invention and do not limit its protection scope. Those skilled in the art may also make partial changes thereto. For example, the motor type and motor performance may be selected according to actual conditions, and the type of proxy model used to fit the mapping relationship between the motor size parameter combination and the motor performance may be selected according to actual conditions. Any form of equivalent replacement that is consistent with the spirit of the invention falls within the protection scope of the present invention.

Claims

1. A method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method, characterized in that: The method is specifically as follows: Calculate m different motor size parameter combinations s i Corresponding motor performance y i , i=1,2,...,m, as the sample data set (S,Y); then the motor size parameters are used as the multidimensional input variables X of the proxy model, and the motor performance is used as the output response y of the proxy model. The Kriging proxy model is obtained by training the sample data set (S,Y) Used to fit the mapping relationship between motor parameter combination and motor performance; For a given motor performance value y c ,by As the objective function, the range of motor size in the sample data set (S, Y) is taken as the feasible domain of the multidimensional variable X, and a minimization optimization model is constructed; For the minimization optimization model constructed above, given a random multi-dimensional initial optimization variable X 0 , randomly select X 0 , find the value of this component that minimizes the objective function, and then update X with this value 0 , get the new stage Kriging proxy model input variable X 1 , and the process of updating the components of the Kriging proxy model input variable X is repeated until the objective function of the minimization optimization model converges to the global minimum value 0, and the motor performance constant y is obtained. c Corresponding motor size parameter combinations as input variables of the Kriging proxy model 2. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The sample data set (S, Y) required for the Kriging proxy model training is obtained by performing finite element model simulation analysis and calculation on the motor through Latin hypercube sampling. Any sample s in S i =(s i1 ,s i2 ,...,s in ) is an n-dimensional vector, corresponding to n motor size parameters.

3. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The Kriging proxy model needs to perform maximum value normalization preprocessing on the sample data set during training.

4. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The basis functions of the Kriging proxy model include but are not limited to constant basis functions, linear basis functions, and quadratic polynomial basis functions.

5. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The inverse mapping of the Kriging proxy model does not require the original mapping to be a bijection in the traditional sense, but is a generalized inverse mapping that does not require a one-to-one correspondence.

6. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The hyperparameter tuning process of the Kriging surrogate model is completed through a genetic algorithm.

7. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The objective function of the minimization optimization model is the square of the difference between the given performance value and the Kriging proxy model, that is, The feasible domain is determined by the range of sample values ​​in the sample data set S of the Kriging surrogate model, that is, the jth component X of the variable X j The feasible range is [X j min ,X j max ],in 8. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The motor performance includes but is not limited to motor torque and loss.

9. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The component updating process of the Kriging proxy model input variable X is as follows: For a randomly selected sequence number j, the jth component of the new stage input variable X' is solved by the one-dimensional projected gradient method As a new component, the other components remain unchanged compared with the original input variable X, that is, where X=(X1,X2,...,X n ), X'=(X1',X2',...,X n ').

10. The method for solving the inverse mapping of the Kriging proxy model of motor performance based on the coordinate descent method according to claim 1 is characterized in that: The value of the component that minimizes the objective function is obtained by a one-dimensional projected gradient method, wherein the search process of a single component step length in the one-dimensional projected gradient method follows the Armjio criterion.

Citation Information

Patent Citations

  • Motor combination agent model construction method, system and device and storage medium

    CN116432403A

  • System and Method of Fault Detection Based on Robust Damped Signal Demixing

    US20210278476A1

Cited By

  • Motor design method based on Kriging proxy model

    CN119720636A

  • A motor design method based on the Kriging surrogate model

    CN119720636B