Arxiv:1601.03768V1 [Cs.Sy] 14 Jan 2016
Optimal Current Waveforms for Switched-Reluctance Motors
Abstract
In this paper, we address the problem of finding current waveforms for a switched reluctance motor that minimize a user-defined combination of torque ripple and RMS current. The motor model we use is fairly general, and includes magnetic saturation, voltage and current limits, and highly coupled magnetics (and therefore, unconventional geometries and winding patterns).
We solve this problem by approximating it as a mixed-integer convex program, which we solve globally using branch and bound. We demonstrate our approach on an experimentally verified model of a fully pitched switched reluctance motor, for which we find the globally optimal waveforms, even for high rotor speeds.
Introduction
We consider the problem of choosing optimal current waveforms for a switched reluctance motor (SRM). Traditionally, the shape of the current waveforms is determined in an ad-hoc manner (e.g., by fixing the turn-on angles for each phase winding as a function of rotor position; see [TK12]).
Although creating these waveforms does not require a detailed motor model, and implementing them is simple, waveforms produced in this manner rarely produce smooth output torque, and often decrease motor efficiency and exacerbate mechanical vibration and acoustic noise issues.
Also, because of inverter voltage limits, such waveforms may not even be realizable at high rotor speeds. We therefore propose to use optimization to find current waveforms that acheive a desired average torque, while minimizing a combination of resistive power loss and RMS torque ripple. We consider supply voltage limits, as well as current limits in each phase winding. Our model includes a detailed magnetic circuit, which can account for magnetic coupling between phases, and can be used to model motors with unconventional geometries and winding patterns, such as those with fully pitched windings.
We propose to solve this optimization problem by approximating it as a mixed-integer convex program (MICP). This MICP reformulation approach has several inherent advantages over more conventional methods, such as sequential quadratic programming. The most prominent, for our purposes, is that it can be solved globally by generic methods such as branch and bound, often in a reasonable amount of time. This has two benefits: first, it allows us to achieve the best performance possible for a given motor; second, it provides a metric against which other, suboptimal methods
1
can be compared. We note that although in general global optimization methods for solving MICPs can have very high (exponential) runtime, we find that global solutions can typically be found in a reasonable amount of time (1-5 minutes) for the problems we encounter. These waveforms can be computed and stored in a lookup table, indexed by desired torque and rotor speed. Such a table with hundreds or thousands of entries could be computed overnight on a standard multi-core computer.
Another advantage of an MICP formulation is that, if suboptimal solutions are acceptable, first-order methods exist that can produce a good solution very quickly especially when initialized with a decent initial guess. (see, i.e., [TMBB15]) This opens the possibility that (nearly) optimal waveforms can be produced by a smart control scheme even as motor parameters vary over the life of the motor.
This is especially attractive when combined with a lookup table containing precomputed, globally optimal waveforms: the precomputed waveforms can be used as an initial guess for an online optimization method when new waveforms (corresponding to updated motor parameters) are required.
We demonstrate our approach numerically on the experimentally validated motor model of [MWC01], which describes an SRM with fully pitched phases.
Previous Work
Current optimization for SRMs. Several authors have considered optimization of SRM cur- rent waveforms. The most similar work to our own is a series of papers by Lovatt and Stephenson [LS94], [LS97a], [LS97b], that use local optimization methods to find minimum RMS current wave- forms that acheive a given (average or pointwise) desired torque, subject to voltage and current constraints. Stankovic et al. derive optimal waveforms for a simple SRM, under several restrictive assumptions (e.g., sufficient drive voltage, no more than two simultaneously conducting phases); under these assumptions, it is only necessary to discretize the waveforms during commutation.
Kaiserseder et al. [KSAS03] also seek optimal current waveforms that produce smooth torque out- put and can be chosen to either minimize current RMS values, or minimize vibration resulting from radial forces. The method of optimization is not described. A similar optimization problem is posed by Chapman and Sudhoff[CS02] in the frequency domain; sequential quadratic programming is used to (approximately) solve it. Many other works optimize over current waveforms parametrized by only a few free variables, such as the firing angle or the corner locations of a trapezoidal wave- form. This of course requires predetermined current waveform shapes, which are not optimal in general. For some examples of this approach, see [MK03], [CMH93], and [CKKP02].
We also note that our approach can be viewed as an extension of the authors’ previous work on optimal current waveform design for permanent magnet motors; see [MB15]. Hybrid control and MPC for SRMs.
Here we list some other optimization-based techniques applied to control SRMs. Peyrl et al. propose a finite-set model predictive control approach, which involves online optimization directly over future inverter switching states. Due to the computa- tionally demanding nature of this technique, only very short prediction horizons (i.e., up to three steps) are considered. The work by Vasak et al. [VZP+07], uses a piecewise-affine model of the torque characteristic (as we do) to derive a feedback controller that guarantees a torque ripple.
However, their proposed model is relatively low fidelity: the dynamics are modelled as a first-order linear system, and the proposed torque characteristic (our gk(Fk, θ)) has only nine regions (For comparison, in §6 we use over one hundred regions.)
Micp.
Convex optimization problems can be solved efficiently and reliably using standard tech- niques [BV04] (and additionally, specialized modelling software, such as CVX [GB14], enables rapid development of convex optimization applications). An optimization problem with some integer vari- ables, but which is otherwise convex, is called a mixed integer convex program (MICP). Because of the presence of integer variables, MICPs are nonconvex optimization problems, and are difficult to solve (globally) in general (i.e., these problems are are NP-hard; see [KT06]). Indeed, all known global solution techniques for MICPs (such as the branch-and-bound algorithm), have exponential worst-case runtime. Nevertheless, many of these algorithms are effective in practice, and we found them to work well for the the optimization problem we formulate in this paper. In addition to global solution algorithms, many approaches exist to (approximately) solve MICPs more quickly; see [TMBB15] and references therein.
Our formulation is based on approximating the nonlinear constraint functions (the torque char- acteristics and the magnetic flux characteristics) by piecewise affine functions. These constraints can then be represented as a combination of integer and linear constraints using disjunctive pro- gramming. For details on disjunctive programming consult Balas [Bal79] and Ceria and Soares [CS99]. Disjunctive programming has found many applications in the past decade or so, such as process engineering [GT13], facility location, unit commitment and portfolio management [GL12], and optimal control [?].
Contribution
Our reformulation of the torque control problem as a MICP opens the door for two interesting possiblilites. The first is that global solution methods can be used to find the optimal waveforms, typically in a reasonable amount of time. This is of course advantageous in its own right, as it allows provably optimal waveforms to be implemented. It is also useful to verify the limits of performance of motors, and as a benchmark for comparing heuristic methods. The second possibility is that fast first-order methods, which are simple enough to run on embedded platforms, can be used as a heuristic to update the globally optimal waveforms as parameters vary over the life of the motor. Our proposed model is also much more general than the optimization models considered in previous works, and can therefore be used to capture more of the characteristc features of switched reluctance motors, such as magnetic coupling. We hope this generality will be useful for researchers investigating novel switched reluctance motor topologies, by giving them a practical method for optimal waveform generation, and by characterizing the theoretical performance of their designs.
Motor Model
We consider an abstract, lumped parameter model of a switched reluctance motor. The rotor, which does not contain any windings or magnetic elements, has angular position θ and angular velocity ω; we assume ω is constant.
The stator contains n electrical circuit branches, called windings. The winding currents are i ∈Rn, the winding voltages are v ∈Rn, and the magnetic flux linkages through the windings are λ ∈Rn. The stator also contains m magnetic elements, with magnetomotive force (MMF) vector F ∈Rm, and magnetic flux vector ψ ∈Rm.
We will assume that i, v, λ, F, and ψ are 2π-periodic functions of θ.
We Use A Prime (′)
to denote differentiation of these functions with respect to θ. To lighten notation, we often drop explicit dependence on θ.
3
Electrical dynamics.
Where R ∈Sn
++ is the (diagonal) resistance matrix. Note that ωλ′ is the time derivative of λ. Magnetic circuit. We assume the magnetic elements are connected by a (planar) magnetic circuit, which we describe in terms of mesh analysis (for an introduction to mesh analysis, see [DK84]). In particular, we assume that there are l circuit meshes (not including the outer mesh) each with an associated reference direction. The (reduced) mesh matrix M ∈Rl×m is such that
1
if magnetic element k is in mesh j, with coinciding reference directions
−1
if magnetic element k is in mesh j, with opposite reference directions
0
if magnetic element k is not in mesh j. Any flux vector ψ consistent with the magnetic circuit topology must be a linear combination of
(2)
for some φ(θ) ∈Rl, which we call the mesh magnetic flux vector. (Because M has full row rank in
General, There Is A Unique Φ For Any Such Ψ.)
In addition, the total MMF around each mesh is the sum of the MMFs of the magnetic elements that make up the mesh (accounting for reference direction), so the vector of mesh MMFs is given by the vector MF.
Electro-magnetic geometry. We define the electro-magnetic geometry matrix C ∈Rl×n such that Cjk gives the amount of current passing through mesh j per unit of current in winding k. The total current passing through each of the l meshes is therefore given by the vector Ci, which is related to the total MMF around the meshes by Amp`ere’s law: MF = Ci.
(3)
Similarly, the flux linkage is related to the mesh magnetic flux vector by λ = CT φ.
(4)
Magnetic characteristic. The magnetic flux and the MMF of the k-th magnetic element are
(5)
where the magnetic characteristic fk is a monotonically increasing function in its first argument. As a special case, if the functions fk are affine in Fk for each θ, with constant linear term (so that ψ(θ) = AF(θ) + b(θ), with A diagonal and positive definite), as in the case of a permanent magnet motor, then we have λ(θ) = Li(θ) + k(θ), where L = CT (MA−1MT )−1C is the inductance matrix and k(θ) = CT(MA−1MT )−1A−1Mb(θ) is the back-emf constant.
4
Torque.
0
fk(x, θ) dx.
0
fk(x, θ) dx. By introducing a phase torque function gk such that
.
(6)
Voltage limits.
|Vk(Θ)| ≤Vmax,
k = 1, . . , n.
(7)
Torque ripple.
0
τ(θ) dθ.