Nicholas Moehle

Optimal current waveforms for brushless permanent magnet motors

In this paper, we give energy-optimal current waveforms for a permanent magnet synchronous motor that result in a desired average torque. Our formulation generalises previous work by including a general back-electromotive force (EMF) wave shape, voltage and current limits, an arbitrary phase winding connection, a simple eddy current loss model, and a trade-off between power loss and torque ripple. Determining the optimal current waveforms requires solving a small convex optimisation problem. We show how to use the alternating direction method of multipliers to find the optimal current in milliseconds or hundreds of microseconds, depending on the processor used, which allows the possibility of generating optimal waveforms in real time. This allows us to adapt in real time to changes in the operating requirements or in the model, such as a change in resistance with winding temperature, or even gross changes like the failure of one winding. Suboptimal waveforms are available in tens or hundreds of microseconds, allowing for quick response after abrupt changes in the desired torque. We demonstrate our approach on a simple numerical example, in which we give the optimal waveforms for a motor with a sinusoidal back-EMF, and for a motor with a more complicated, nonsinusoidal waveform, in both the constant-torque region and constant-power region.

A simple effective heuristic for embedded mixed-integer quadratic programming

ABSTRACT In this paper, we propose a fast optimisation algorithm for approximately minimising convex quadratic functions over the intersection of affine and separable constraints (i.e. the Cartesian product of possibly nonconvex real sets). This problem class contains many NP-hard problems such as mixed-integer quadratic programming. Our heuristic is based on a variation of the alternating direction method of multipliers (ADMM), an algorithm for solving convex optimisation problems. We discuss the favourable computational aspects of our algorithm, which allow it to run quickly even on very modest computational platforms such as embedded processors. We give several examples for which an approximate solution should be found very quickly, such as management of a hybrid-electric vehicle drivetrain and control of switched-mode power converters. Our numerical experiments suggest that our method is very effective in finding a feasible point with small objective value; indeed, we see that in many cases, it finds the global solution.

A perspective-based convex relaxation for switched-affine optimal control

Abstract We consider the switched-affine optimal control problem, i.e. , the problem of selecting a sequence of affine dynamics from a finite set in order to minimize a sum of convex functions of the system state. We develop a new reduction of this problem to a mixed-integer convex program (MICP), based on perspective functions. Relaxing the integer constraints of this MICP results in a convex optimization problem, whose optimal value is a lower bound on the original problem value. We show that this bound is at least as tight as similar bounds obtained from two other well-known MICP reductions (via conversion to a mixed logical dynamical system, and by generalized disjunctive programming), and our numerical study indicates it is often substantially tighter. Using simple integer-rounding techniques, we can also use our formulation to obtain an upper bound (and corresponding sequence of control inputs). In our numerical study, this bound was typically within a few percent of the optimal value, making it attractive as a stand-alone heuristic, or as a subroutine in a global algorithm such as branch and bound. We conclude with some extensions of our formulation to problems with switching costs and piecewise affine dynamics.

Optimal current waveforms for switched-reluctance motors

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.

Dynamic energy management with scenario-based robust MPC

We present a simple, practical method for managing the energy produced and consumed by a network of devices. Our method is based on (convex) model predictive control. We handle uncertainty using a robust model predictive control formulation that considers a finite number of possible scenarios. A key attribute of our formulation is the encapsulation of device details, an idea naturally implemented with object-oriented programming. We introduce an open-source Python library implementing our method and demonstrate its use in planning and control at various scales in the electrical grid: managing a smart home, shared charging of electric vehicles, and integrating a wind farm into the transmission network.

Maximum torque-per-current control of induction motors via semidefinite programming

We present a method for finding current waveforms for induction motors that minimize resistive loss while achieving a desired average torque output. Our method is not based on reference-frame theory for electric machines, and therefore directly handles induction motors with asymmetric winding patterns, nonsinusoidally distributed windings, and a general winding connection. We do not explicitly handle torque ripple or voltage constraints. Our method is based on converting the torque control problem to a nonconvex linear-quadratic control problem, which can be solved by using a (tight) semidefinite programming relaxation.