Next Article in Journal
A Fault Diagnosis Method of Rolling Bearings Based on Parameter Optimization and Adaptive Generalized S-Transform
Next Article in Special Issue
Systematic Metamodel-Based Optimization Study of Synchronous Reluctance Machine Rotor Barrier Topologies
Previous Article in Journal
Personalized Artificial Tibia Bone Structure Design and Processing Based on Laser Powder Bed Fusion
Previous Article in Special Issue
Coil Number Impact on Performance of 4-Phase Low Speed Toothed Doubly Salient Permanent Magnet Motors
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Absolutely Feasible Synchronous Reluctance Machine Rotor Barrier Topologies with Minimal Parametric Complexity

1
Department of Electric Machines, Drives and Automation, Faculty of Electrical Engineering and Computing (FER), University of Zagreb, 10000 Zagreb, Croatia
2
Torquery Consulting, 41830 Göteborg, Sweden
*
Author to whom correspondence should be addressed.
Machines 2022, 10(3), 206; https://doi.org/10.3390/machines10030206
Submission received: 31 January 2022 / Revised: 9 March 2022 / Accepted: 10 March 2022 / Published: 11 March 2022
(This article belongs to the Special Issue Synchronous Reluctance Motor-Drive Advancements)

Abstract

:
The first step in the synchronous reluctance machine design is the selection of rotor flux barrier type. The literature provides various barrier construction methods with a common goal of reducing parametric complexity. However, too excessive simplification can lead to decreased performance, while overly complex geometries tend to increase optimization time. This paper presents a set of novel flux barrier construction methods with an increased degree of freedom and minimal geometrical complexity. The paper proposes four topologies based on circular, hyperbolic, and original Zhukovsky lines. When considering parametrization complexity, the original Zhukovsky type is the simplest, but it has barrier depth limitations. Other topologies have equal complexity. The paper proposes a novel Modified Zhukovsky variable depth type based on geometrical conformal mapping of the original Zhukovsky lines. The step-by-step construction of each topology is presented in a form of pseudo-code with detailed comments and illustrations. Overall, the presented research provides a valuable starting point for the designer who wants to investigate different smooth rotor barrier topologies.

1. Introduction

In recent years, the synchronous reluctance machine (SyRM) has become commercially viable as a high-efficiency alternative to induction (IM) and interior permanent magnet machines (IPM). The main benefit of the SyRM is that the rotor has no squirrel cage, windings or magnets, just electric steel plates forming a rotor package.
Due to the highest torque and power density, interior rare earth permanent magnet synchronous machines (IPM) are preferred for automotive traction. On the other hand, the use of rare earth permanent magnet (PM) materials, such as neodymium or dysprosium, has historically been a commercial risk [1,2].
Currently, there is no commercial use of synchronous reluctance machines (SyRM) for automotive traction, but having in mind the market uncertainties and potential production cost reduction, they represent a possible alternative [3,4].
On the other hand, commercial vehicles apart from electric traction, have to actuate additional body systems (usually powered by some sort of hydraulic pump). The interface towards external systems is referred as electric power take-off (e-PTO). Considering that the e-PTO needs to be reliable, robust, and cheap, SyRM is the preferred alternative [5,6,7].
In recent decades, SyRM research has focused on improving the rotor barrier design, minimizing the torque ripple, and increasing the power factor [8]. Literature provides references to several barrier topologies: circular [9,10], hyperbolic [11,12], Zhukovsky fluid type [13,14], segmented, etc. Open-source SyRE project offers more details and instructions on geometry generation [15].
The common goal in barrier construction strategy is the reduction of parametric complexity. However, too simplified rotor topologies can lead to decreased performance, while too complex geometries yield better performance, but also tend to increase optimization time (increase is proportional to the parametric complexity).
By merging both approaches, this paper presents a set of flux barrier construction methods with an increased degree of freedom and minimal parametric complexity, based on non-dimensional rotor parameters.
Considering that sharp edges tend to cause mechanical issues at high rotational speeds, only barrier topologies based on smooth analytical functions have been analyzed (circular, hyperbolic, and Zhukovsky).
By definition, Zhukovsky barrier lines are streamlines and cannot be analytically modified to secure variable barrier depth, in this case, conformal mapping is used to create a novel Modified Zhukovsky barrier type with variable depth lines. The following chapters will demonstrate automated barrier design and related pseudo-code for the following topologies:
  • Circular variable depth (CrVD), Figure 1b
  • Variable eccentricity hyperbolic (HyVE), Figure 1c
  • Original Zhukovsky (Zh), Figure 1d (red)
  • Modified Zhukovsky variable depth (MZhVD), Figure 1d (blue).

2. Geometric Feasibility

The term feasibility usually refers to the solution and means that the solution satisfies all the given constraints. There is another type of feasibility called geometric or model feasibility. A geometrically feasible model is valid for solving if: there are no overlapping edges, negative lengths, or non-conventional geometric relations that will inevitably produce issues after optimization starts.
This is especially important when using template-based design software. The generation of such a non-valid model can be avoided in several ways (e.g., barrier 1 (blue) collides with barrier 2 (yellow), the collision is marked in red, Figure 2a). In the first case, the complete set of optimization parameters is initialized until geometric feasibility is achieved [16].
The alternative is forced feasibility, where each infeasible design is subjected to parameter modification until feasibility is reached, e.g., barrier 1 (blue) and barrier 2 (yellow) are modified until the minimum flux carrier width w c min is reached, Figure 2b [7].
The final approach is to secure that the design is always feasible.
The example is a SyRM with three hyperbolic barriers where barrier depth is varied by hyperbolic eccentricity of each inner and outer barrier line (Figure 3b).
In some cases, the complete freedom in varying the eccentricity causes the inner and outer barrier collision (Figure 3a), which inevitably leads to infeasible designs.
On the other hand, if the designer wants to ensure feasibility, one solution is to parametrize the eccentricity of each outer barrier line relative to the eccentricity of each inner barrier, e.g., (1).
e 3 in [ 1.2 1.3 ] e 3 out [ e 3 in 1.35 ] e 2 in [ e 3 out 1.4 ] e 2 out [ e 2 in 1.45 ] e 1 in [ e 2 out 1.5 ] e 1 out [ e 1 in 1.55 ]
Unfortunately, this option generates constantly changing parameter limits, which can lead to a suboptimal design. Considering the specifics of the SyRM rotor, the rotor geometry can be defined to always yield a feasible design thus achieving absolute feasibility. Instead of directly using eccentricities as parameters, a better approach is to use dimensionless inner and outer barrier depth parameters ( D in , D out [ 0 , 1 ] ) for indirect calculation of respective eccentricities. The following text provides detailed instructions on absolutely feasible rotor construction with the corresponding pseudo-code which accepts any pole and barrier number.

3. Design Automation

The following figures are drawn for illustrative purposes and valid for a three barrier rotor ( k = 3 ), naming and description of all parameters is explained in Table 1. Vector variables are bolded, e.g., R is a variable vector, while R represents a scalar variable.
The initial step in rotor construction (Figure 4a) is to specify number of pole pairs (p), rotor barriers (k) and barrier bridge thickness ( w bb ). The user then specifies dimensionless ϑ min , ϑ max [ 0 , 1 ] (Table 1, 18–19). Temporary construction points vector E 1 .. k temp is then created with equidistant angular spacing Δ ϑ r = ( ϑ max ϑ min ) / k . Barrier notch point ( E n ) is defined via additional parameter ϑ notch (Table 1, 20) relative to ϑ min with radial component equal to rotor radius. Note that the entire geometry is initially constructed in vertical manner (center pole axis is at the angle of 90 ).
The second step (Figure 4b) is the construction of inner and outer barrier line starting points ( E in , E out ). The points are calculated relative to E 1 .. k temp , based on additional set of dimensionless parameters ϑ 1 .. k in , ϑ 1 .. k out [ 0 , 1 ] (Table 1, 6–11).
The third step is rotation around the center point by the specified angle (in this case α 1 = π / 2 ). Barrier line starting points E in , E out , E n (and additional depth parameters D in , D out , D n depending of the barrier type) are forwarded to the selected construction function which calculates barrier line intersection points ( x in , x out ). The intersection points are calculated based on depth parameters and feasibility conditions listed in Figure 4c. The function returns all inner and outer barrier line vertices ( X in , Y in , X out , Y out , X n , Y n ), Figure 4d.
The next step is mirroring line vertices around the horizontal axis (Figure 4e).
The final step is the rotation around the center point by the angle α F = π / ( 2 p ) . Barrier fillets ( r 1 . . k in , r 1 . . k out [ 0 , 1 ] , Table 1, 12–17) responsible for securing mechanical integrity of the rotor are added to the geometry, and final rotor geometry is exported as to the FEA tool (Figure 4f). Adding precise fillets to the discrete lines is a complex problem which is planned to be explained in the future publications. Detail barrier construction steps from Figure 4b–d are discussed in the following sections.

Barrier Depth Variation

Considering that the barrier width has a substantial impact on the machine performance, this section will explain how inner and outer barrier depth coefficients affect each of the studied topologies, with a simplified presumption of equal line starting points.
Width of the each barrier depends on initial inner and outer line starting points E in , E out , and depth coefficients D in , D out . Depending on the depth parameter combination, barrier width can be variable, or uniform. Uniform width is a special case where CrVD barriers are concentric (Figure 5a, green). HyVE barriers can be approximately uniform when they have equal eccentricity (Figure 5b, green). These variants are included in CrVD and HyVE pseudo-code, and will not be studied in detail.
In general, CrVD and HyVE depth variation is unconstrained resulting in variable barrier width (Figure 5a,b, blue).
Zh barrier type (Figure 5c) is a special case because it does not support any depth variation. Barrier line depths are defined directly from starting points and cannot be modified. In order to explore the possible benefits of depth variation, Zh type has been modified as MZhVD where barrier depths have full freedom (Figure 5d).
An example of different barrier line depth parameter combinations is provided in the (Table 2).

4. Standard Rotor Barriers

4.1. Zhukovsky Barrier Construction

After definition of all inner and outer barrier line starting points ( E in , E out , E n ) , Figure 6a, the entire geometry is rotated by α 1 Zh = ( π / 2 τ pole / 2 ) (Algorithm 1: ln:2, Figure 6b, τ pole = ( 2 π ) / ( 2 p ) = π / p is the angular pole step.). This partial rotation must be performed because Zhukovsky equations are defined on angular range [ 0 , π / p ] .
Algorithm 1 Construction of Zhukovsky barriers
1:
τ pole = 2 π / ( 2 p )
2:
Rotate all by α 1 Zh = ( π / 2 τ pole / 2 ) and get: E in , E out , E n
3:
Δ r = 0
4:
[ X in , Y in , X out , Y out , X n , Y n ] = GetZhukovskyLines( E in , E out , E n )
   
5:
functionGetZhukovskyLines( E in , E out , E n )
6:
     k = N barrier                                             ▹ Calculate inner and outer barrier lines
7:
     [ X in , Y in ] = GetZhukLines( E in , k )
8:
     [ X out , Y out ] = GetZhukLines( E out , k )
     ▹ Calculate notch line
9:
     k n = 1                                              ▹ Notch has only one barrier line
10:
     [ X n , Y n ] = GetZhukLines( E n , k n )  
11:
    function GetZhukLines( E , k )
 
12:
         C = sin ( p · ϑ E ) · r E + Δ r D sh / 2 2 p 1 / r E + Δ r D sh / 2 p
         ▹ Calculate barrier polar angles
13:
         φ start = ϑ E
14:
         φ end = τ pole / 2  
15:
        for  i = 1 : k  do
16:
            ϑ ( : , i ) = L I N S P A C E ( φ start ( i ) , φ end , N points )
                                                                             ▹ Calculate barrier line vertices  
17:
         r = D sh 2 C + C 2 + 4 sin 2 ( p ϑ ) / 2 sin ( p ϑ ) p
 
18:
         [ X , Y ] = pol 2 cart ( ϑ , r )
19:
    return  X , Y
 
20:
Rotate all by α 2 Zh = τ pole / 2  
21:
return  X in , Y in , X out , Y out , X n , Y n

4.1.1. Inner Line Calculation

The first step is the calculation of GetZhukLines barrier line function (Algorithm 1: ln:7) based on E in and number of barriers k. Note that there are no depth parameters. By definition Zhukovsky barriers are streamlines which cannot mutually intersect. Barrier line profiles (Figure 6e) are derived from conformal mapping theory and the Zhukovsky airflow potential formulation [14,15]. This was originally developed to describe the flow paths of fluids channeled by two infinite plates forming an angle π / p , and a plug centred at the origin of the reference frame. In the solid rotor context, the plug represents the non-magnetic shaft with a radius of D sh / 2 . Equations Algorithm 1: ln:12 and Algorithm 1: ln:17 express the magnetic field potential lines in parametric form [7].
Next, polar barrier vertices r , ϑ are calculated based on coefficient vector C , starting point polar coordinates ϑ E and number of barriers k (Algorithm 1: ln:12–19). Finally, GetZhukLines function returns X in , Y in vertices.

4.1.2. Outer Line Calculation

Outer barrier line vertices X out , Y out (Algorithm 1: ln:8) are calculated in the same way as inner lines.

4.1.3. Notch Line Calculation

Notch is specific because it has only one barrier line ( k n = 1 ) (Algorithm 1: ln:10). The function GetZhukLines returns X n , Y n which completes the calculation of all barrier lines (Figure 6c). Finally, to be compatible with the rest of the barrier construction procedures, the geometry is rotated by α 2 Zh = τ pole / 2 (Algorithm 1: ln:20, Figure 6d).
The next steps (not described within Algorithm 1) are mirroring vertices around horizontal axis (Figure 4e), adding barrier fillets, and geometry rotation around center point (Figure 4f).
Note that Zhukovsky construction pseudo-code is the simplest of all alternatives due to the polar streamline equations (Algorithm 1: ln:12, 17).

4.2. Circular Barrier Construction

After definition of all inner and outer barrier line starting points and depth parameters ( E in , E out , E n , D in , D out , D n ) , Figure 7a, the entire geometry is rotated by α 1 CrVD = π / 2 (Algorithm 2: ln:1, Figure 7b).

4.2.1. Inner Line Calculation

Lets first consider GetInnerLines function which calculates inner line vertices ( X in , Y in ) and intersections ( x in ) based on E in , D in and number of barriers k (Algorithm 2: ln:6).
The intersections (Figure 4d) are critical for barrier calculation and in case of circular barriers, they depend on the inequality x E x < | y E | where x represents the inner or outer intersection. If the condition is fulfilled, the constructed circle is feasible (Figure 7d, green) and the intersection can be calculated based on inner barrier limits (Algorithm 2: ln:15, 21). Otherwise, the circle is infeasible (Figure 7d, red) and the intersection point is calculated from barrier line starting point (Algorithm 2: ln:17, 22).
In case of the most inner line ( i = k ), the feasibility limit is rotor shaft ( x M ), and the intersection x in ( i ) is calculated via (Algorithm 2: ln:15). For the second most inner line ( i = k 1 ) , feasibility limit is x in ( i + 1 ) and the intersection is calculated via (Algorithm 2: ln:20). All inner line intersections are then iteratively calculated following the Algorithm 2: ln:12–22 procedure.
Next, GetCrcVtx function (Algorithm 2: ln:23) based on calculated intersections x in , starting point coordinates x E in , y E in and k, calculates the circle origins x 0 and radius R r , and returns barrier vertices X in , Y in (Algorithm 2: ln:39–50). Finally, GetInnerLines returns X in , Y in , x in .

4.2.2. Outer Line Calculation

At this point all inner barrier intersections x in are defined and now present feasibility limits for outer barrier line construction (Algorithm 2: ln:7). The rest of the GetOuterLines code (Algorithm 2: ln:25–38) is executed in the similar manner as in GetInnerLines. The function in the end returns X out , Y out , x out .

4.2.3. Notch Line Calculation

Notch is specific because it has only one barrier line ( k n = 1 ) and depends on the most outer intersection x out ( 1 ) (Algorithm 2: ln:9). Finally, GetOuterLines returns X n , Y n , x n which completes the calculation of all barrier lines (Figure 7c).
The next steps (not described within Algorithm 2) are mirroring vertices around horizontal axis (Figure 4e), adding barrier fillets, and geometry rotation around center point (Figure 4f).

4.3. Hyperbolic Barrier Construction

After definition of all inner and outer barrier line starting points and depth parameters ( E in , E out , E n , D in , D out , D n ) , Figure 8a, the entire geometry is rotated by α 1 HyVE = π / 2 (Algorithm 3: ln:1, Figure 8b).
Algorithm 2 Construction of circular barriers
1:
Rotate all by α 1 CrVD = π / 2
2:
Get: E in , E out , E n , D in , D out , D n
3:
[ X in , Y in , X out , Y out , X n , Y n ] = GetCrcLines( E in , E out , E n , D in , D out , D n )
4:
functionGetCrcLines( E in , E out , E n , D in , D out , D n )
5:
     k = N barrier         ▹ Calculate inner and outer lines
6:
     [ X in , Y in , x in ] = GetInnerLines( E in , D in , k )
7:
     [ X out , Y out , x out ] = GetOuterLines( E out , D out , x in , k )
  ▹Calculate notch line
8:
     k n = 1         ▹ Notch has only one barrier line
9:
     [ X n , Y n , x n ] = GetOuterLines( E n , D n , x out ( 1 ) , k n )
10:
    function GetInnerLines( E in , D in , k )
11:
         x M = D sh / 2
12:
        for  i = k : 1  do
13:
           if i==k then
14:
               if  x E in ( i ) x M < | y E in ( i ) |  then
15:
                    x in ( i ) = x M + ( x E in ( i ) x M ) · D in ( i )
16:
               else
17:
                    x in ( i ) = x E in ( i ) | y E in ( i ) | · D in ( i )
18:
           else
19:
               if  x E in ( i ) x in ( i + 1 ) < | y E in ( i ) |  then
20:
                    x in ( i ) = x in ( i + 1 ) + ( x E in ( i ) x in ( i + 1 ) ) · D in ( i )
21:
               else
22:
                    x in ( i ) = x E in ( i ) | y E in ( i ) | · D in ( i )
23:
         [ X in , Y in ] = GetCrcVtx( x in , x E in , y E in , k )
24:
    return  X in , Y in , x in
25:
    function GetOuterLines( E out , D out , x in , k )
26:
        for  i = k : 1  do
27:
           if  i > 1  then
28:
               if  x E out ( i ) > x in ( i 1 )  then
29:
                    x out ( i ) = x in ( i ) + ( x in ( i 1 ) x in ( i ) ) · D out ( i )
30:
               else
31:
                    x out ( i ) = x in ( i ) + ( x E out ( i ) x in ( i ) ) · D out ( i )
32:
           else
33:
               if  x E out ( i ) x in ( i ) < | y E out ( i ) |  then
34:
                    x out ( i ) = x in ( i ) + ( x E out ( i ) x in ( i ) ) · D out ( i )
35:
               else
36:
                    x out ( i ) = x E out ( i ) | y E out ( i ) | · D out ( i )
37:
         [ X out , Y out ] = GetCrcVtx( x out , x E out , y E out , k )
38:
    return  X out , Y out , x out
39:
    function GetCrcVtx( x , x E , y E , k )
    ▹ Calculate barrier center
40:
         F = ( x E x 0 ) 2 + y E 2 = = ( x x 0 ) 2
41:
        for  i = 1 : k  do
42:
            x 0 = S o l v e ( F ( i ) )
43:
         R r = | x x 0 |
  ▹Calculate barrier polar angles
44:
         φ start = π a t a n 2 ( y E , ( x 0 x E ) )
45:
         φ end = π
46:
        for  i = 1 : k  do
47:
            ϑ ( : , i ) = l i n s p a c e ( φ start ( i ) , φ end , N points )
   ▹Calculate barrier line vertices
48:
         X = R r · cos ( ϑ ) + x 0
49:
         Y = R r · sin ( ϑ )
50:
    return  X , Y
51:
  return  X in , Y in , X out , Y out , X n , Y n
Algorithm 3 Construction of Hyperbolic barriers
1:
Rotate all by α 1 HyVE = π / 2
2:
Get: E in , E out , E n , D in , D out , D n
3:
K = 1.1         ▹ Max eccentricity coefficient
4:
[ X in , Y in , X out , Y out , X n , Y n ] = GetHypLines( E in , E out , E n , D in , D out , D n )
5:
functionGetHypLines( E in , E out , E n , D in , D out , D n )
6:
     k = N barrier         ▹ Calculate inner and outer barrier lines
7:
     [ X in , Y in , x in ] = GetInnerLines( E in , D in , k )
8:
     [ X out , Y out , x out ] = GetOuterLines( E out , D out , x in , k )
  ▹Calculate notch line
9:
     k n = 1         ▹ Notch has only one barrier line
10:
     [ X n , Y n , x n ] = GetOuterLines( E n , D n , x out ( 1 ) , k n )
11:
    function GetInnerLines( E in , D in , k )
12:
         x M = D sh / 2
13:
        for  i = k : 1  do
14:
           if i==k then
15:
                e min ( i ) = ( r E in ( i ) x M ) / ( x E in ( i ) x M )
16:
           else
17:
                e min ( i ) = r E in ( i ) x in ( i + 1 ) x E in ( i ) x in ( i + 1 )
18:
            e max ( i ) = K · e min ( i )         ▹ Est. max eccentricity  
19:
            e in ( i ) = ( e max ( i ) e min ( i ) ) · D in ( i ) + e min ( i )    
20:
            x d in ( i ) = r E in ( i ) e in ( i ) x E in ( i )         ▹ Left directrix
21:
            x in ( i ) = e in ( i ) · x d in ( i ) / ( 1 + e in ( i ) · sgn ( x d in ( i ) ) )
22:
         [ X in , Y in ] = GetHypVtx( x d in , e in , ϑ E in , k )
23:
    return  X in , Y in , x in
24:
    function GetOuterLines( E out , D out , x in , k )
25:
        for  i = k : 1  do
26:
            e min ( i ) = r E out ( i ) x in ( i ) x E out ( i ) x in ( i )  
27:
           if  i > 1  then
28:
                e max ( i ) = r E out ( i ) x in ( i + 1 ) x E out ( i ) x in ( i + 1 ) )
29:
           else
30:
                e max ( i ) = K · e min ( i )         ▹ Est. max eccentricity
31:
            e out ( i ) = ( e max ( i ) e min ( i ) ) · D out ( i ) + e min ( i )  
32:
            x d out ( i ) = r E out ( i ) e out ( i ) x E out ( i )         ▹ Left directrix  
33:
            x out ( i ) = e out · x d out ( i ) 1 + e out ( i ) · sgn ( x d out ( i ) )
34:
         [ X out , Y out ] = GetHypVtx( x d out , e out , ϑ E out , k )
35:
    return  X out , Y out , x out
36:
    function GetHypVtx( x d , e , ϑ E , k )
  ▹Calculate barrier polar angles
37:
         φ start = 0 ; φ end = ϑ E  
38:
        for  i = 1 : k  do
39:
            ϑ ( : , i ) = l i n s p a c e ( φ start , φ end ( i ) , N points )
  ▹Calculate barrier line vertices
40:
         r = e · x d / ( 1 + e · sgn ( x d ) · cos ( ϑ ) )
41:
         [ X , Y ] = pol 2 cart ( ϑ , r )
42:
    return  X , Y
43:
 return  X in , Y in , X out , Y out , X n , Y n

4.3.1. Inner Line Calculation

Lets first consider GetInnerLines function which calculates inner lines vertices ( X in , Y in ) and intersections ( x in ) based on E in , D in and number of barriers k (Algorithm 3: ln:7).
To simplify the construction, the left focus is constructed in the origin of the coordinate system (Figure 8d, blue). The intersections with y = 0 (Figure 4d) are critical for barrier calculation and they depend on the minimum eccentricity Equation e min = ( r E x ) / ( x E x ) , x is the inner or outer intersection limit.
In case of the most inner line ( i = k ), the feasibility limit is rotor shaft ( x M ), the minimum eccentricity e min ( i ) is calculated via Algorithm 3: ln:15. For the second most inner line ( i = k 1 ) , e min ( i + 1 ) is calculated via Algorithm 3: ln:17.
If particular barrier has eccentricity within the limits e [ e min , ] , the construction is feasible (Figure 8d, green). Otherwise the barrier is infeasible (Figure 8d, red, magenta). This is why it is important to limit maximum eccentricity (Algorithm 3: ln:18), where K = 1.1 is empirically determined coefficient. The final eccentricity is then calculated depending of the depth parameter (Algorithm 3: ln:19). The next steps are calculation of the left directrix (Algorithm 3: ln:21) and intersection point ( x in ) based on polar hyperbola Equation (Algorithm 3: ln:21).
All inner line intersections are then iteratively calculated following the described procedure (Algorithm 3: ln:13–21).
Next, GetHypVtx function (Algorithm 3: ln:22) based on calculated directrices x d in , eccentricities e in , angular starting point coordinates ϑ E in and k, calculates the hyperbolic vertices in polar coordinates r , ϑ , and returns barrier vertices X in , Y in (Algorithm 3: ln:36–41).
Finally, GetInnerLines returns X in , Y in , x in .

4.3.2. Outer line calculation

At this point all inner barrier intersections x in are defined and now present feasibility limits for outer barrier line construction (Algorithm 3: ln:8). The rest of the GetOuterLines code (Algorithm 3: ln:24–34) is executed in the similar manner as in GetInnerLines. The function returns X out , Y out , x out .

4.3.3. Notch line calculation

Notch is specific because it has only one barrier line ( k n = 1 ) and depends on the most outer intersection x out ( 1 ) (Algorithm 3: ln:10). Finally, GetOuterLines returns X n , Y n , x n which completes the calculation of all barrier lines (Figure 7c).
The next steps (not described within Algorithm 3) are mirroring vertices around horizontal axis (Figure 4e), adding barrier fillets, and geometry rotation around center point (Figure 4f).

5. Conformal Modifications

5.1. Conformal Mapping

A conformal or angle-preserving transformation also called conformal mapping is a transformation w = f ( z ) that preserves local angles. An analytic function is conformal at any point where it has a nonzero derivative [17].
Conformal transformations can prove extremely useful in solving physical problems. If the selected complex function w = f ( z ) satisfies the condition that the real and imaginary parts of w satisfy the Cauchy–Riemann equations and Laplace’s equation, they automatically provide a scalar potential and a so-called stream function [17] (e.g., Zhukovski barrier lines, Figure 1d, red).
FEA is typically used for electromagnetic performance calculations in electric machine design. Depending on the complexity of the calculation and mesh density, it can take several minutes before the calculation is completed. The simulation time can be reduced if a conformal mapping is used for calculation of the analytical airgap magnetic field [16]. The method conformally transforms electric machine cross-section to w-plane thus enabling quick analytic calculations. The w-plane results are then inversely mapped to the real plane. Compared to FEA simulation, this approach yields results within seconds [11,12,16]. On the other hand, the disadvantage is the difficult implementation on complex rotor geometries.
This paper proposes a method for geometrical modification of any SyRM barrier geometry using conformal mapping.

5.2. Mapping Workflow

Generated rotor barrier lines are defined by sorted vertices ( X in , Y in , X out , Y out , X n , Y n ) containing corresponding x , y coordinates which can be drawn on a 2D real Euclidean plane (Figure 9a). For easier manipulation purposes, real plain coordinates are redefined in complex z-plane ( z = x + j y ) , Figure 9b. Considering that the vertices are the same in real and complex plane, this is a trivial transformation.
SyRM rotor has a circular layout which can be exploited by selecting the convenient complex function f ( z ) and applying forward conformal mapping to a complex w-plane ( w = u + j v ) , Figure 9c. Geometrical modifications of the barrier geometry are then performed in w-plane and upon completion, returned back to z (and real) plane via inverse conformal mapping. The benefit of the approach is easier barrier modification which leads to simplified software coding.

5.3. Complex Functions

The principal objects of study are complex-valued functions f ( z ) , depending on a single complex variable z = x + j y C . In general, the function f : Ω C is defined on an open subdomain, z Ω C , of the complex plane. Any complex function can be uniquely written as a complex combination f ( z ) = f ( x + i y ) = Re u ( x , y ) + j Im v ( x , y ) [18].

5.3.1. Forward Conformal Mapping

When working with circular shapes, it is useful to use polar form z = r e j θ . Considering that electric machines can have an arbitrary number of pole pairs, it is very convenient to select a complex function that somehow ignores angle changes when the number of poles is increased or decreased. This kind of functionality can be achieved by a complex natural logarithm. In terms of polar coordinates, the complex logarithm has the form w = ln z = ln ( r e j θ ) = ln r + ln e j θ = ln r + j θ .
Thus, the logarithm of a complex number has a real part which is a well-defined harmonic function save for a logarithmic singularity at the origin x = y = 0 . The imaginary part of the complex logarithm is the polar angle, known in complex analysis as the phase.
u ( x , y ) = Re ( ln z ) = ln r = 1 2 ln ( x 2 + y 2 )
v ( x , y ) = Im ( ln z ) = θ = arctan y x
Due to inherent symmetry, it is enough to analyze one electric machine pole. A minimum number of poles is 2, which equals to [ 0 , π ] radian angular span in z-plane, which is mapped to the same vertical span in w-plane. Figure 10 illustrates mapping of different combination of pole geometries. To summarize, w = ln z always maps z to the upper half-plane with vertical boundaries v [ 0 , π / p ] (p is the number of pole pairs) and horizontal boundaries of u [ ln x M , ln R ] .
Note that ln z always maps SyRM barrier lines horizontally (Figure 10, w-plane), regardless of the number of poles. This feature is exploited for the creation of the Modified Zhukovsky variable depth barrier lines (MZhVD).

5.3.2. Inverse Conformal Mapping

Inverse function for return to z-plane is a complex exponential z = e w = e u + j v . Since w C is a non-zero complex number, the equation can be written as z = e u · ( cos v s . + j sin v ) with real and imaginary parts equal to:
x ( u , v ) = Re ( e w ) = e u · cos v
y ( u , v ) = Im ( e w ) = e u · sin v

5.4. Depth Modification

To summarize, original Zhukovsky barrier lines ( X in , Y in , X out , Y out , X n , Y n ) with corresponding x , y vertices are written as z = x + j y (Figure 11a, red) and conformally transformed to w-plane via w = ln z as w = u + j v (Figure 11b, red). As previously mentioned, Zhukovsky lines cannot mutually intersect. To secure barrier depth variability and improve machine performance, we are introducing Zhukovsky barrier depth modification (MZhVD) via dimensionless depth parameters D in , D out , D n .
Depth variability is secured via addition of cosine offsets to the w-plane barrier lines according to Equations (6) and (7). In theory, any even function can be used for generation of Δ offset (7), cosine has been selected due to implementation simplicity.
T = 2 · Max ( V Zhk ) Min ( V Zhk )
Δ = Δ Dpth · cos π T ( V Zhk v E ) π / 2
Upon modification (Figure 11b, blue), barrier lines are inversely mapped to z-plane via function z = e w (Figure 11a, blue). The main benefit of the proposed procedure is a simplified modification of SyRM barriers without any influence on simulation time. The following section explains the modification procedure step by step.

5.5. Modified Zh Barrier Construction

After definition of all inner and outer barrier line starting points ( E in , E out , E n ) , Figure 12a, the entire geometry is rotated by α 1 MZhVD = ( π / 2 τ pole / 2 ) (Algorithm 4: ln:2, Figure 12b).

5.5.1. Inner Line Calculation

The first step is the calculation of GetInnerLines barrier line function (Algorithm 4: ln:9). Inner line vertices ( X in , Y in ) are calculated based on E in , D in and number of barriers k.
Next (Algorithm 4: ln:14), original Zhukovsky barrier (Zh) vertices ( X Zhk in , Y Zhk in ) are calculated in the same way as in Algorithm 1, Figure 12c. Original vertices ( X Zhk in , Y Zhk in ) and barrier starting points ( x E in , y E in ) are then conformally mapped to w-plane as U Zhk in , V Zhk in and u E in , v E in , Algorithm 4: ln:15, 16, Figure 12d, dotted lines.
Intersections u in are critical for Modified Zhukovsky barrier variable depth (MZhVD) calculation and they are fully tied to original Zhukovsky intersections u Zhk in (calculated via Algorithm 4: ln:17). As previously mentioned, original Zhukovsky barriers cannot mutually intersect which makes them absolutely feasible, but on the other hand, barrier depth variability cannot be achieved.
Modified Zhukovsky depth variation is secured by iterative recalculation of intersection points in w-plane. In case of the most inner line ( i = k ), the barrier depth limit is rotor shaft ( u M ), and the original Zhukovsky intersection u Zhk in ( i ) (Algorithm 4: ln:20). For the second most inner line ( i = k 1 ) , depth limit is u Zhk in ( i + 1 ) and the intersection is calculated via (Algorithm 4: ln:22). All inner line intersections are then iteratively calculated (Algorithm 4: ln:18–22).
Next, inner line depth offset is calculated based on original Zhukovsky and calculated inner intersections (Algorithm 4: ln:23). ClcDpth function (Algorithm 4: ln:25) calculates modified vertices in w-plain (Figure 12d, full lines), performs inverse conformal mapping, and returns z-plain vertices (Algorithm 4: ln:59–64, Figure 12e).
Finally, GetInnerLines function returns X in , Y in vertices.

5.5.2. Outer Line Calculation

At this point all w-plane inner barrier intersections u in are defined and now present limits for outer barrier line construction. The rest of the GetOuterLines code (Algorithm 4: ln:27–40) is executed in the similar manner as in GetInnerLines. The function at the end returns X out , Y out , x out .

5.5.3. Notch Line Calculation

Notch is specific because it has only one barrier line ( k n = 1 ) and depends on the most outer w-plain intersection u out ( 1 ) (Algorithm 4: ln:12). Finally, GetOuterLines returns X n , Y n , u n which completes the calculation of all barrier lines (Figure 12e). Finally, to be compatible with the rest of the barrier construction procedures, the geometry is rotated by α 2 MZhVD = τ pole / 2 (Algorithm 4: ln:65, Figure 12f).
The next steps (not described within Algorithm 4) are mirroring vertices around horizontal axis (Figure 4e), adding barrier fillets, and geometry rotation around center point (Figure 4f).
Algorithm 4 Construction of Modified Zhukovsky barriers
1:
τ pole = 2 π / ( 2 p )
2:
Rotate all by α 1 MZhVD = ( π / 2 τ pole / 2 )
3:
Get: E in , E out , E n
4:
Δ r = 0
5:
u M = ln ( x M )             ▹ Shaft limit in w-plane
6:
[ X in , Y in , X out , Y out , X n , Y n ] = GetHypLines( E in , E out , E n , D in , D out , D n )
7:
functionGetMODZhLines( E in , E out , E n , D in , D out , D n )
8:
     k = N barrier               ▹ Calculate inner and outer barrier lines
9:
     [ X in , Y in , u in ] = GetInnerLines( E in , D in , k )
10:
     [ X out , Y out , u out ] = GetOuterLines( E out , D out , u in , k )
  ▹Calculate notch line
11:
     k n = 1         ▹ Notch has only one barrier line
12:
     [ X n , Y n ] = GetOuterLines( E n , D n , u out ( 1 ) , k n )
13:
    function GetInnerLines( E in , D in , k )
14:
         [ X Zhk in , Y Zhk in ] = GetZhukLines( E in , k )
  ▹Forward conformal transformation
15:
         [ U Zhk in , V Zhk in ] = FrwConf( X Zhk in , Y Zhk in )
16:
         [ u E in , v E in ] = FrwConf ( x E in , y E in )
  ▹Original Zhukovsky inner line intersection limits
17:
         u Zhk in = U Zhk in ( find ( max ( V Zhk in ) ) )
18:
        for  i = k : 1  do
19:
           if i==k then
20:
                u in ( i ) = u M + ( u Zhk in ( i ) u M ) · D in ( i )
21:
           else
22:
                u in ( i ) = u Zhk in ( i + 1 ) + ( u Zhk in ( i ) u Zhk in ( i + 1 ) ) · D in ( i )
23:
         Δ Dpth in = u Zhk in u in
24:
         [ X in , Y in ] =
25:
              ClcDpth( Δ Dpth in , U Zhk in , V Zhk in , v E in )
26:
    return  X in , Y in , u in
27:
    function GetOuterLines( E out , D out , u in , k )
28:
         [ X Zhk out , Y Zhk out ] = GetZhukLines( E out , k )
  ▹Forward conformal transformation
29:
         [ U Zhk out , V Zhk out ] = FrwConf( X Zhk out , Y Zhk out )
30:
         [ u E out , v E out ] = FrwConf ( x E out , y E out )
  ▹ Original Zhukovsky outer line intersection limits
31:
         u Zhk out = U Zhk out ( find ( max ( V Zhk out ) ) )
32:
        for  i = k : 1  do
33:
           if  i > 1  then
34:
                u out ( i ) = u in ( i ) + ( u in ( i 1 ) u in ( i ) ) · D out ( i )
35:
           else
36:
                u out ( i ) = u in ( i ) + ( u Zhk out ( i ) u in ( i ) ) · D out ( i )
37:
         Δ Dpth out = u Zhk out u out  
38:
         [ X out , Y out ] =
39:
              ClcDpth( Δ Dpth out , U Zhk out , V Zhk out , v E out )
40:
    return  X out , Y out , u out
41:
    function GetZhukLines( E , k )
42:
         C = sin ( p · ϑ E ) · r E + Δ r D sh / 2 2 p 1 / r E + Δ r D sh / 2 p
  ▹Calculate barrier polar angles
43:
         φ start = ϑ E
44:
         φ end = τ pole / 2
45:
        for  i = 1 : k  do
46:
            ϑ ( : , i ) = l i n s p a c e ( φ start ( i ) , φ end , N points )
  ▹Calculate barrier line vertices
47:
         r = D sh 2 C + C 2 + 4 sin 2 ( p ϑ ) / 2 sin ( p ϑ ) p
48:
         [ X , Y ] = pol 2 cart ( ϑ , r )
49:
    return  X , Y
50:
    function FrwConf( X , Y )
51:
         [ r , θ ] = cart 2 pol ( X , Y )
52:
         U = ln r
53:
         V = θ
54:
    return  U , V
55:
    function InvConf( U , V )
56:
         X = e U · cos V
57:
         Y = e U · sin V
58:
    return  X , Y
59:
    function ClcDpth( Δ Dpth , U Zhk , V Zhk , v E )
60:
         T = 2 · Max ( V Zhk ) Min ( V Zhk ) ; f = 1 2 T
61:
         Δ = Δ Dpth · cos 2 π f ( V Zhk v E ) π / 2
62:
         U new = U Zhk Δ   ▹Inverse conformal transformation
63:
         [ X , Y ] = InvConf( U new , V Zhk )
64:
    return  X , Y  
65:
     Rotate all by α 2 MZhVD = τ pole / 2  
66:
     return  X in , Y in , X out , Y out , X n , Y n

6. Parametric Complexity

A high number of optimization variables is associated with a longer optimization time [19,20], so the imperative is to simplify barrier topology parametrization. Gamba et al. [14] state that three parameters per barrier (total complexity of 3 k , where k is the number of barriers) are the appropriate number for a fast yet accurate description of multi-barrier SyRM (barrier fillet parameters are not included). In the previous publication, our group of authors has reduced the complexity to 2 · k + 1 per barrier [7].
Table 3 shows the calculation of total number of SyRM parameters for for the demonstrated pseudo-code. Note that the parameters ϑ 1 out , ϑ k in are subtracted from the count because they are constant and equal to zero (Table 1).
Table 4 lists the complexity comparison of the presented procedures and similar approaches in [7,10,14]. The examples in [7,10,14] do not have a notch feature, so to have a fair comparison, the notch is not included in the complexity calculation (Table 3). Compared to [14], and [7], Zh, respectively, yields smaller complexity ( 2 k ), while CrVD, HyVE, MZhVD have the same complexity as in [10].
Overall, the construction principle explained in Section 3 enables the higher degree of design freedom. Considering that the simple barrier topologies are sub-optimal compared to more complex types, developing the set of different parametrization methods with equal parametric complexity is certainly a novel contribution.

7. Pseudo-Code Validation

After the implementation of the proposed pseudo-code, a set of questions naturally arises. Which barrier topology yields the best performance for the given requirements? Is Modified Zhukovsy barrier type better than alternative topologies? For this reason, we have conducted a detailed optimization study based on meta-modeling (surrogate modeling) approach which compared the different barrier topologies (details are available in [21]).
The optimization process couples automated geometry generation (Matlab), electromagnetic finite element analysis (Ansys Motor-CAD), and metamodel optimization (Ansys OptiSlang). Seven rotor topologies have been derived from circular, hyperbolic, and Zhukovsky barrier types:
  • Circular concentric (CrC)
  • Circular variable depth (CrVD)
  • Hyperbolic with fixed eccentricity (HyFE)
  • Hyperbolic with variable eccentricity (HyVE)
  • Original Zhukovsky (Zh)
  • Modified Zhukovsky variable depth (MZhVD)
  • Modified Zhukovsky with equal barrier depth (MZhED)
The same optimization strategy (maximize torque per volume (TPV), minimize losses) has been applied to all variants, and results prove that barrier type substantially affects the final machine performance. For easier comparison, seven designs (one per topology) with approximately the same losses (5200 W) have been selected (Figure 13, Table 5).
Performance wise, HyFE topology yields the worst results and is considered as baseline design ( Gain = 0 %). Performance gain is calculated via: Gain = ( T avg / T HyFE avg 1 ) · 100 % . The best results are achieved by MZhVD topology. In relation to the worst (baseline) topology, the performance gain is 14.9% and the power factor is increased from 0.61 to 0.69. It is important to note that these comparisons are valid for design requirements presented in [21]. Other combinations of optimization objectives and requirements might yield a different results.
HyFE, CrC and MZhED are special case topologies already covered in CrVD, HyVE and MzVD pseudo-code. Considering that stated topologies can be achieved by appropriate combination of barrier depth parameters, they are not considered in this paper. The summary of three best optimized cross-sections are provided on Figure 14.

8. Conclusions

SyRM barrier generation procedure was studied in detail. A pseudo-code solution that secures absolute feasibility, barrier topology complexity minimization, and simple implementation is provided. Four smooth barrier types have been presented: circular variable depth (CrVD), hyperbolic with variable eccentricity (HyVE), original Zhukovsky (Zh) and modified Zhukovsky with variable depth (MZhVD). Absolute feasibility is a very important feature because it enables the use of dimensionless parameters which secure code robustness and design scalability to any physical dimension. Barrier topology complexity has been minimized via a systematic approach to design automation (Section 3) and careful analysis of construction features of each topology.
HyVE and CrVD topologies are more complex 4 k while Zh has smaller complexity 2 k . On the other hand, in its original form, Zh type does not support barrier depth variability which can be a design drawback. Therefore, we introduce a novel MZhVD topology based on geometrical conformal mapping of the original Zh design. This modification provides greater design freedom and sets MZhVD complexity to 4 k (same as HyVE and CrVD).
Compared with other referenced topologies, the presented solutions offer higher design freedom with smaller or equal parametric complexity.
It should be noted that construction of barrier fillets (Figure 4f) has not been covered in this paper. Adding a precise fillet between two discrete intersecting lines is a rather complex problem, which deserves a stand-alone publication. A minimum example code with detailed instructions is planned to be published in the near future.
Overall, the presented pseudo-code provides a valuable starting point for the designer who wants to investigate different SyRM smooth barrier topologies.
The description and list of used variables has been added in the Appendix A.

Author Contributions

Conceptualization, B.B.; methodology, B.B.; validation, B.B. and S.S.; original draft preparation, B.B.; review and editing, S.S.; visualization, B.B:; supervision, S.S.; funding acquisition, S.S. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported by the Croatian Science Foundation under the project IP-2018-01-5822-HYDREL.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

This paper is an extension of Branko Ban’s Ph.D. research work on Synchronous Reluctance machines menthored by Stjepan Stipetic.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
AbbreviationDescription
EVElectric vehicle
FEAFinite element analysis
IPMInterior permanent magnet
IMInduction machine
CrCCircular concentric barrier
CrVDCircular variable depth barrier
HyFEHyperbolic fixed eccentricity barrier
HyVEHyperbolic variable eccentricity barrier
ZhOriginal Zhukovsky barrier
MZhEDModified Zhukovsky equal depth barrier
MZhVDModified Zhukovsky variable depth barrier
PMPermanent magnet
PTOPower take off
e-PTOElectric power take off
SyRMSynchronous reluctance machine
TPVTorque per volume

Appendix A. Variable List

All variables have been listed by the order of appearance within text. Vector variables are bolded. e.g., R is a variable vector, while R represents a scalar variable.
Table A1. List of variables.
Table A1. List of variables.
No.VariableDescriptionNo.VariableDescription
1 w c min Minimum flux carrier width33 α 1 Zh First rotation angle in Zh generation
2 D in Inner barrier depth parameters34 α 2 Zh Second rotation angle in Zh generation
3 D out Outer barrier depth parameters35 α 1 CrVD First rotation angle in Zh generation
4 D n Notch depth parameter36 α 1 HyVE First rotation angle in Zh generation
5pNumber of pole pairs37 α 1 MZhVD First rotation angle in MZhVD generation
6kNumber of flux barriers38 α 2 MZhVD Second rotation angle in MZhVD generation
7 ϑ min Minimum angular barrier span39 r Radial Zhukovsky line coordinate vector
8 ϑ max Maximum angular barrier span40 ϑ Angular Zhukovsky line coordinate vector
9 τ pole Angle of one pole41 C Zhukovsky line coefficient
10 α 1 First rotation angle in example figure42 ϑ E Line starting point angular coordinates
11 E 1 .. k temp Initial construction points43 x E in Inner line starting point horizontal coordinates
12 Δ ϑ r Available angular space44 y E in Inner line starting point vertical coordinates
13 w bb 1 .. k Barrier bridge vector45 x 0 Circular barrier center coordinate vector
14 E n Notch line starting point46 R r Circular barrier radius vector
15 ϑ notch Notch line starting point angular coordinate47 e min Minimal eccentricity vector
16 E in Inner barrier line starting point vector48 r E Line starting point radial coordinate vector
17 E out Outer barrier line starting point vector49 x E Line starting point angular coordinate vector
18 ϑ 1 .. k temp Initial barrier construction angular coord.50 e Eccentricity vector
19 r in Inner barrier line starting point radial coord.51 x d Left directrix of hyperbola
20 r out Outer barrier line starting point radial coord.52 u Horizontal w-plane coordinate vector
21 ϑ in Inner barrier line starting point angular coord.53 v Vertical w-plane coordinate vector
22 ϑ out Outer barrier line starting point angular coord.54 X Zhk z-plane Zh horizontal vertex vector
23 x in Inner barrier line intersection point vector55 Y Zhk z-plane Zh vertical vertex vector
24 x out Outer barrier line intersection point vector56 U Zhk w-plane Zh horizontal vertex vector
25 X in Inner barrier line horizontal vertex vector57 V Zhk w-plane Zh vertical vertex vector
26 Y in Inner barrier line vertical vertex vector58 u Zhk w-plane Zh intersections vector
27 X out Outer barrier line horizontal vertex vector59 u M w-plane shaft limit
28 Y out Outer barrier line vertical vertex vector60 u in w-plane MZhVD inner barrier intersections
29 X n Notch horizontal vertex vector61 u out w-plane MZhVD outer barrier intersections
30 Y n Notch vertical vertex vector62 T Period vector of MZhVD cosine offset
31 r 1 . . k in Inner barrier fillet vector63 f Frequency vector of MZhVD cosine offset
32 r 1 . . k out Outer barrier fillet vector64 Δ Dpth Barrier depth offset maximum vector
33 α F Final rotation angle65 Δ MZhVD Barrier depth offset vector

References

  1. Bourzac, K. The Rare-Earth Crisis. Technol. Rev. 2011, 114, 58–63. [Google Scholar]
  2. Justin, R. Rare earths: Neither rare, nor earths. BBC News, 23 March 2014. [Google Scholar]
  3. Hong, H.S.; Liu, H.C.; Cho, S.Y.; Lee, J.; Jin, C.S. Design of High-End Synchronous Reluctance Motor Using 3-D Printing Technology. IEEE Trans. Magn. 2017, 53, 4–8. [Google Scholar] [CrossRef]
  4. Yamashita, Y.; Okamoto, Y. Design Optimization of Synchronous Reluctance Motor for Reducing Iron Loss and Improving Torque Characteristics Using Topology Optimization Based on the Level-Set Method. IEEE Trans. Magn. 2020, 56, 36–39. [Google Scholar] [CrossRef]
  5. Ban, B.; Stipetić, S. Electric Multipurpose Vehicle Power Take-Off: Overview, Load Cycles and Actuation via Synchronous Reluctance Machine. In Proceedings of the 2019 International Aegean Conference on Electrical Machines and Power Electronics (ACEMP) & 2019 International Conference on Optimization of Electrical and Electronic Equipment (OPTIM), Istanbul, Turkey, 27–29 August 2019. [Google Scholar]
  6. Ban, B.; Stipetic, S. Design and optimization of synchronous reluctance machine for actuation of electric multi-purpose vehicle power take-off. In Proceedings of the 2020 International Conference on Electrical Machines (ICEM), Göteborg, Sweden, 23–26 August 2020; pp. 1750–1757. [Google Scholar]
  7. Ban, B.; Stipetic, S.; Jercic, T. Minimum set of rotor parameters for synchronous reluctance machine and improved optimization convergence via forced rotor barrier feasibility. Energies 2021, 14, 2744. [Google Scholar] [CrossRef]
  8. Hubert, T.; Reinlein, M.; Kremser, A.; Herzog, H.G. Torque ripple minimization of reluctance synchronous machines by continuous and discrete rotor skewing. In Proceedings of the 2015 5th International Electric Drives Production Conference (EDPC), Nürnberg, Germany, 15–16 September 2015. [Google Scholar]
  9. Ferrari, S. Design, Analysis and Testing Procedures for Synchronous Reluctance and Permanent Magnet Machines. Doctoral Thesis, Politecnico di Torino, Torino, Italy, 2020. [Google Scholar]
  10. Stipetic, S.; Zarko, D.; Cavar, N. Design Methodology for Series of IE4/IE5 Synchronous Reluctance Motors Based on Radial Scaling. In Proceedings of the 2018 23rd International Conference on Electrical Machines (ICEM), Alexandroupoli, Greece, 3–6 September 2018; pp. 146–151. [Google Scholar]
  11. Mirazimi, M.S.; Kiyoumarsi, A. Magnetic Field Analysis of Multi-Flux-Barrier Interior Permanent-Magnet Motors Through Conformal Mapping. IEEE Trans. Magn. 2017, 53, 7002512. [Google Scholar] [CrossRef]
  12. Mirazimi, M.S.; Kiyoumarsi, A. Magnetic Field Analysis of SynRel and PMASynRel Machines with Hyperbolic Flux Barriers Using Conformal Mapping. IEEE Trans. Transp. Electrif. 2020, 6, 52–61. [Google Scholar] [CrossRef]
  13. Taghavi, S.; Pillay, P. Design aspects of a 50hp 6-pole synchronous reluctance motor for electrified powertrain applications. In Proceedings of the IECON 2017—43rd Annual Conference of the IEEE Industrial Electronics Society, Beijing, China, 29 October–1 November 2017; pp. 2252–2257. [Google Scholar]
  14. Gamba, M.; Pellegrino, G.; Cupertino, F. Optimal number of rotor parameters for the automatic design of Synchronous Reluctance machines. In Proceedings of the 2014 International Conference on Electrical Machines (ICEM 2014), Berlin, Germany, 2–5 September 2014; pp. 1334–1340. [Google Scholar]
  15. Cupertino, F.; Pellegrino, G.; Cagnetta, P.; Ferrari, S.; Perta, M. SyRE: Synchronous Reluctance (Machines)—Evolution. Available online: https://sourceforge.net/projects/syr-e/ (accessed on 11 March 2021).
  16. Zarko, D. A Systematic Approach To Optimized Design of Permanent Magnet Motors with Reduced Torque Pulsations. Ph.D. Thesis, University Of Wisconsin-Madison, Madison, WI, USA, 2004. [Google Scholar]
  17. Weisstein, E.W. Conformal Mapping. Available online: https://mathworld.wolfram.com/ConformalMapping.html (accessed on 11 March 2021).
  18. Olver, P.J. Complex Analysis and Conformal Mapping, Chapter 6. In Complex Analysis and Conformal Mapping; University of Minnesota: Minneapolis, MN, USA, 2011. [Google Scholar]
  19. Pellegrino, G.; Cupertino, F.; Gerada, C. Automatic Design of Synchronous Reluctance Motors Focusing on Barrier Shape Optimization. IEEE Trans. Ind. Appl. 2015, 51, 1465–1474. [Google Scholar] [CrossRef]
  20. Lu, C.; Ferrari, S.; Pellegrino, G. Two Design Procedures for PM Synchronous Machines for Electric Powertrains. IEEE Trans. Transp. Electrif. 2017, 3, 98–107. [Google Scholar] [CrossRef] [Green Version]
  21. Ban, B.; Stipetić, S. Systematic Metamodel-based Optimization Study of Synchronous Reluctance Machine Rotor Barrier Topologies. Struct. Multidiscipl. Optim. 2022. in review. [Google Scholar]
Figure 1. (a) SyRM terminology; SyRM rotor barrier types: (b) Circular variable depth; (c) Hyperbolic variable eccentricity; (d) Modified Zhukovsky (blue), original Zhukovsky (red).
Figure 1. (a) SyRM terminology; SyRM rotor barrier types: (b) Circular variable depth; (c) Hyperbolic variable eccentricity; (d) Modified Zhukovsky (blue), original Zhukovsky (red).
Machines 10 00206 g001
Figure 2. Infeasible geometry (a) and forced feasibility (b).
Figure 2. Infeasible geometry (a) and forced feasibility (b).
Machines 10 00206 g002
Figure 3. Illustration of infeasible (a) and feasible geometry (b).
Figure 3. Illustration of infeasible (a) and feasible geometry (b).
Machines 10 00206 g003
Figure 4. Rotor barrier construction procedure. Initial rotor construction step (a); Construction of inner and outer barrier line starting points (b); calculation of barrier intersection points (c); calculation of barrier vertices (d); vertex mirroring (e); rotation around center and addition of barrier fillets (f).
Figure 4. Rotor barrier construction procedure. Initial rotor construction step (a); Construction of inner and outer barrier line starting points (b); calculation of barrier intersection points (c); calculation of barrier vertices (d); vertex mirroring (e); rotation around center and addition of barrier fillets (f).
Machines 10 00206 g004
Figure 5. Barrier depth variation influence on different 2-barrier (k = 2) SyRM topologies. Circular (a); Hyperbolic (b), Zhukovsky (c) and Modified Zhukovsky barrier types (d).
Figure 5. Barrier depth variation influence on different 2-barrier (k = 2) SyRM topologies. Circular (a); Hyperbolic (b), Zhukovsky (c) and Modified Zhukovsky barrier types (d).
Machines 10 00206 g005
Figure 6. Zhukovsky barrier construction. Subfigures (a)–(e) are explained in the Section 4.1Section 4.1.3.
Figure 6. Zhukovsky barrier construction. Subfigures (a)–(e) are explained in the Section 4.1Section 4.1.3.
Machines 10 00206 g006
Figure 7. Circular barrier construction. Subfigures (a)–(d) are explained within the Section 4.2Section 4.2.3.
Figure 7. Circular barrier construction. Subfigures (a)–(d) are explained within the Section 4.2Section 4.2.3.
Machines 10 00206 g007
Figure 8. Hyperbolic barrier construction. Subfigures (a)–(d) are explained in the Section 4.3Section 4.3.3.
Figure 8. Hyperbolic barrier construction. Subfigures (a)–(d) are explained in the Section 4.3Section 4.3.3.
Machines 10 00206 g008
Figure 9. Mapping workflow, Subfigures (a)–(c) are explained within the Section 5.2.
Figure 9. Mapping workflow, Subfigures (a)–(c) are explained within the Section 5.2.
Machines 10 00206 g009
Figure 10. Real z-plane (upper row); Conformal mapping to w = ln z plane (bottom row).
Figure 10. Real z-plane (upper row); Conformal mapping to w = ln z plane (bottom row).
Machines 10 00206 g010
Figure 11. Modification of Zhukovski lines via conformal mapping. Subfigures (a) and (b) are explained within the Section 5.4 and related subsections.
Figure 11. Modification of Zhukovski lines via conformal mapping. Subfigures (a) and (b) are explained within the Section 5.4 and related subsections.
Machines 10 00206 g011
Figure 12. Modified Zhukovsky barrier construction and rotation steps. Subigures (a)–(f) are explained within the Section 5.5Section 5.5.3.
Figure 12. Modified Zhukovsky barrier construction and rotation steps. Subigures (a)–(f) are explained within the Section 5.5Section 5.5.3.
Machines 10 00206 g012
Figure 13. Validated Pareto fronts for each design variant [21].
Figure 13. Validated Pareto fronts for each design variant [21].
Machines 10 00206 g013
Figure 14. Optimized cross section of three best topologies: (a) Zh; (b) MZhED; (c) MZhVD [21].
Figure 14. Optimized cross section of three best topologies: (a) Zh; (b) MZhED; (c) MZhVD [21].
Machines 10 00206 g014
Table 1. Example list of design parameters. Color coding is according to Figure 4 variables.
Table 1. Example list of design parameters. Color coding is according to Figure 4 variables.
No:DescriptionSymbolValue/RangeUnit
1Rotor diameter D r 100mm
2Shaft diameter D sh 54mm
3Barrier numberk3-
4Pole pairsp2-
5Barrier bridge w bb 0.3mm
6Point angle in ϑ 1 in [ 0.2 , 0.5 ] -
7Point angle out ϑ 1 out 0-
8Point angle in ϑ 2 in [ 0 , 0.3 ] -
9Point angle out ϑ 2 out [ 0 , 0.2 ] -
10Point angle in ϑ 3 in 0-
11Point angle out ϑ 3 out [ 0 , 0.5 ] -
12–14Corner rad. in r 1 . . k in [ 0 , 1 ] -
15–17Corner rad. out r 1 . . k out [ 0 , 1 ] -
18Min. angle ϑ min [ 0.15 , 0.3 ] -
19Max. angle ϑ max [ 0.9 , 0.95 ] -
20Notch angle ϑ n [ 0.1 , 1 ] -
22–24Barrier depths in D 1 . . k in [ 0.2 , 1 ] -
25–27Barrier depths out D 1 . . k out [ 0.2 , 1 ] -
28Notch depth D n [ 0 , 1 ] -
Table 2. Illustrative depth coefficient table for Figure 5.
Table 2. Illustrative depth coefficient table for Figure 5.
Baseline Barrier DepthsModified Barrier Depths
Abbr. D 1 out D 1 in D 2 out D 2 in D 1 out D 1 in D 2 out D 2 in
(a)CrVD0.350.500.650.900.400.550.700.80
(b)HyVE0.400.500.800.900.350.450.600.85
(c)Zh0.100.450.600.85----
(d)MZhVD0.100.450.600.850.200.400.800.90
Table 3. Calculation of total parameter number. Color coding is according to Figure 4 variables.
Table 3. Calculation of total parameter number. Color coding is according to Figure 4 variables.
Sum:DescriptionSymbolTopology
1Min. angle ϑ min
2Max. angle ϑ max
k + 2 Barrier angle in ϑ 1 . . k in
2 k + 2 Barrier angle out ϑ 1 . . k out
2 k + 2 2 Remove constants ϑ 1 out = ϑ k in = 0
2 k --Zh
4 k Barrier depths D 1 . . k in HyVE
Barrier depths D 1 . . k out CrVD
MZhVD
Table 4. Parametric complexity.
Table 4. Parametric complexity.
TopologyComplexityk = 2k = 3k = 4
Zhukovsky; Gamba et al. [14] 3 k 6912
Circular; Stipetic et al. [10] 4 k 81216
Zhukovsky; Ban et al. [7] 2 k + 1 579
Zh 2 k 468
HyVE 4 k 81216
CrVD
MZhVD
Table 5. Optimization result comparison table [21].
Table 5. Optimization result comparison table [21].
NameUnitHyFECrCHyVECrVDZhMZhEDMZhVD
TPVNm/dm332.533.134.335.436.236.437.3
V active dm36.476.476.476.476.476.476.47
P loss kW5188519952095182518851975184
P mech kW37.438.139.540.841.741.943.0
T avg Nm210.1214.2221.9229.0234.1235.6241.3
T ripp . %12.114.111.712.79.79.313.7
nrpm1700170017001700170017001700
l s mm180180180180180180180
γ 57.960.361.462.561.861.862.9
I max Arms95.695.694.394.195.995.795.7
cos φ -0.610.620.660.670.670.670.69
Gain%0.01.95.69.011.412.114.9
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ban, B.; Stipetic, S. Absolutely Feasible Synchronous Reluctance Machine Rotor Barrier Topologies with Minimal Parametric Complexity. Machines 2022, 10, 206. https://doi.org/10.3390/machines10030206

AMA Style

Ban B, Stipetic S. Absolutely Feasible Synchronous Reluctance Machine Rotor Barrier Topologies with Minimal Parametric Complexity. Machines. 2022; 10(3):206. https://doi.org/10.3390/machines10030206

Chicago/Turabian Style

Ban, Branko, and Stjepan Stipetic. 2022. "Absolutely Feasible Synchronous Reluctance Machine Rotor Barrier Topologies with Minimal Parametric Complexity" Machines 10, no. 3: 206. https://doi.org/10.3390/machines10030206

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop