Optimization and Control of Power Flow in Distribution Networks

Climate change is arguably the most critical issue facing our generation and the next. As we move towards a sustainable future, the grid is rapidly evolving with the integration of more and more renewable energy resources and the emergence of electric vehicles. In particular, large scale adoption of residential and commercial solar photovoltaics (PV) plants is completely changing the traditional slowly-varying unidirectional power flow nature of distribution systems. High share of intermittent renewables pose several technical challenges, including voltage and frequency control. But along with these challenges, renewable generators also bring with them millions of new DC-AC inverter controllers each year. These fast power electronic devices can provide an unprecedented opportunity to increase energy efficiency and improve power quality, if combined with well-designed inverter control algorithms. The main goal of this dissertation is to develop scalable power flow optimization and control methods that achieve system-wide efficiency, reliability, and robustness for power distribution networks of future with high penetration of distributed inverter-based renewable generators.

Proposed solutions to power flow control problems in the literature range from fully centralized to fully local ones. In this thesis, we will focus on the two ends of this spectrum. In the first half of this thesis (chapters 2 and 3), we seek optimal solutions to voltage control problems provided a centralized architecture with complete information. These solutions are particularly important for better understanding the overall system behavior and can serve as a benchmark to compare the performance of other control methods against. To this end, we first propose a branch flow model (BFM) for the analysis and optimization of radial and meshed networks. This model leads to a new approach to solve optimal power flow (OPF) problems using a two step relaxation procedure, which has proven to be both reliable and computationally efficient in dealing with the non-convexity of power flow equations in radial and weakly-meshed distribution networks. We will then apply the results to fast time- scale inverter var control problem and evaluate the performance on real-world circuits in Southern California Edison’s service territory.

The second half (chapters 4 and 5), however, is dedicated to study local control approaches, as they are the only options available for immediate implementation on today’s distribution networks that lack sufficient monitoring and communication infrastructure. In particular, we will follow a reverse and forward engineering approach to study the recently proposed piecewise linear volt/var control curves. It is the aim of this dissertation to tackle some key problems in these two areas and contribute by providing rigorous theoretical basis for future work.

Distributed Load Control in Multiphase Radial Networks

The current power grid is on the cusp of modernization due to the emergence of distributed generation and controllable loads, as well as renewable energy. On one hand, distributed and renewable generation is volatile and difficult to dispatch. On the other hand, controllable loads provide significant potential for compensating for the uncertainties. In a future grid where there are thousands or millions of controllable loads and a large portion of the generation comes from volatile sources like wind and solar, distributed control that shifts or reduces the power consumption of electric loads in a reliable and economic way would be highly valuable.

Load control needs to be conducted with network awareness. Otherwise, voltage violations and overloading of circuit devices are likely. To model these effects, network power flows and voltages have to be considered explicitly. However, the physical laws that determine power flows and voltages are nonlinear. Furthermore, while distributed generation and controllable loads are mostly located in distribution networks that are multiphase and radial, most of the power flow studies focus on single-phase networks.

This thesis focuses on distributed load control in multiphase radial distribution networks. In particular, we first study distributed load control without considering network constraints, and then consider network-aware distributed load control.

Distributed implementation of load control is the main challenge if network constraints can be ignored. In this case, we first ignore the uncertainties in renewable generation and load arrivals, and propose a distributed load control algorithm, Algorithm 1, that optimally schedules the deferrable loads to shape the net electricity demand. Deferrable loads refer to loads whose total energy consumption is fixed, but energy usage can be shifted over time in response to network conditions. Algorithm 1 is a distributed gradient decent algorithm, and empirically converges to optimal deferrable load schedules within 15 iterations.

We then extend Algorithm 1 to a real-time setup where deferrable loads arrive over time, and only imprecise predictions about future renewable generation and load are available at the time of decision making. The real-time algorithm Algorithm 2 is based on model-predictive control: Algorithm 2 uses updated predictions on renewable generation as the true values, and computes a pseudo load to simulate future deferrable load. The pseudo load consumes 0 power at the current time step, and its total energy consumption equals the expectation of future deferrable load total energy request.

Network constraints, e.g., transformer loading constraints and voltage regulation constraints, bring significant challenge to the load control problem since power flows and voltages are governed by nonlinear physical laws. Remarkably, distribution networks are usually multiphase and radial. Two approaches are explored to overcome this challenge: one based on convex relaxation and the other that seeks a locally optimal load schedule.

To explore the convex relaxation approach, a novel but equivalent power flow model, the branch flow model, is developed, and a semidefinite programming relaxation, called BFM-SDP, is obtained using the branch flow model. BFM-SDP is mathematically equivalent to a standard convex relaxation proposed in the literature, but numerically is much more stable. Empirical studies show that BFM-SDP is numerically exact for the IEEE 13-, 34-, 37-, 123-bus networks and a real-world 2065-bus network, while the standard convex relaxation is numerically exact for only two of these networks.

Theoretical guarantees on the exactness of convex relaxations are provided for two types of networks: single-phase radial alternative-current (AC) networks, and single-phase mesh direct-current (DC) networks. In particular, for single-phase radial AC networks, we prove that a second-order cone program (SOCP) relaxation is exact if voltage upper bounds are not binding; we also modify the optimal load control problem so that its SOCP relaxation is always exact. For single-phase mesh DC networks, we prove that an SOCP relaxation is exact if 1) voltage upper bounds are not binding, or 2) voltage upper bounds are uniform and power injection lower bounds are strictly negative; we also modify the optimal load control problem so that its SOCP relaxation is always exact.

To seek a locally optimal load schedule, a distributed gradient-decent algorithm, Algorithm 9, is proposed. The suboptimality gap of the algorithm is rigorously characterized and close to 0 for practical networks. Furthermore, unlike the convex relaxation approach, Algorithm 9 ensures a feasible solution. The gradients used in Algorithm 9 are estimated based on a linear approximation of the power flow, which is derived with the following assumptions: 1) line losses are negligible; and 2) voltages are reasonably balanced. Both assumptions are satisfied in practical distribution networks. Empirical results show that Algorithm 9 obtains 70+ times speed up over the convex relaxation approach, at the cost of a suboptimality within numerical precision.

Distributed Control and Optimization for Communication and Power Systems

We are at the cusp of a historic transformation of both communication system and electricity system. This creates challenges as well as opportunities for the study of networked systems. Problems of these systems typically involve a huge number of end points that require intelligent coordination in a distributed manner. In this thesis, we develop models, theories, and scalable distributed optimization and control algorithms to overcome these challenges.

This thesis focuses on two specific areas: multi-path TCP (Transmission Control Protocol) and electricity distribution system operation and control. Multi-path TCP (MP-TCP) is a TCP extension that allows a single data stream to be split across multiple paths. MP-TCP has the potential to greatly improve reliability as well as efficiency of communication devices. We propose a fluid model for a large class of MP-TCP algorithms and identify design criteria that guarantee the existence, uniqueness, and stability of system equilibrium. We clarify how algorithm parameters impact TCP-friendliness, responsiveness, and window oscillation and demonstrate an inevitable tradeoff among these properties. We discuss the implications of these properties on the behavior of existing algorithms and motivate a new algorithm Balia (balanced linked adaptation) which generalizes existing algorithms and strikes a good balance among TCP-friendliness, responsiveness, and window oscillation. We have implemented Balia in the Linux kernel. We use our prototype to compare the new proposed algorithm Balia with existing MP-TCP algorithms.

Our second focus is on designing computationally efficient algorithms for electricity distribution system operation and control. First, we develop efficient algorithms for feeder reconfiguration in distribution networks. The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed integer nonlinear program and hence hard to solve. We propose a heuristic algorithm that is based on the recently developed convex relaxation of the optimal power flow problem. The algorithm is efficient and can successfully computes an optimal configuration on all networks that we have tested. Moreover we prove that the algorithm solves the feeder reconfiguration problem optimally under certain conditions. We also propose a more efficient algorithm and it incurs a loss in optimality of less than 3% on the test networks.

Second, we develop efficient distributed algorithms that solve the optimal power flow (OPF) problem on distribution networks. The OPF problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally OPF is solved in a centralized manner. With increasing penetration of volatile renewable energy resources in distribution systems, we need faster and distributed solutions for real-time feedback control. This is difficult because power flow equations are nonlinear and kirchhoff's law is global. We propose solutions for both balanced and unbalanced radial distribution networks. They exploit recent results that suggest solving for a globally optimal solution of OPF over a radial network through a second-order cone program (SOCP) or semi-definite program (SDP) relaxation. Our distributed algorithms are based on the alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative methods, the proposed solutions exploit the problem structure that greatly reduce the computation time. Specifically, for balanced networks, our decomposition allows us to derive closed form solutions for these subproblems and it speeds up the convergence by 1000x times in simulations. For unbalanced networks, the subproblems reduce to either closed form solutions or eigenvalue problems whose size remains constant as the network scales up and computation time is reduced by 100x compared with iterative methods.

Wire array photovoltaics

Over the past five years, the cost of solar panels has dropped drastically and, in concert, the number of installed modules has risen exponentially. However, solar electricity is still more than twice as expensive as electricity from a natural gas plant. Fortunately, wire array solar cells have emerged as a promising technology for further lowering the cost of solar.

Si wire array solar cells are formed with a unique, low cost growth method and use 100 times less material than conventional Si cells. The wires can be embedded in a transparent, flexible polymer to create a free-standing array that can be rolled up for easy installation in a variety of form factors. Furthermore, by incorporating multijunctions into the wire morphology, higher efficiencies can be achieved while taking advantage of the unique defect relaxation pathways afforded by the 3D wire geometry.

The work in this thesis shepherded Si wires from undoped arrays to flexible, functional large area devices and laid the groundwork for multijunction wire array cells. Fabrication techniques were developed to turn intrinsic Si wires into full p-n junctions and the wires were passivated with a-Si:H and a-SiNx:H. Single wire devices yielded open circuit voltages of 600 mV and efficiencies of 9%. The arrays were then embedded in a polymer and contacted with a transparent, flexible, Ni nanoparticle and Ag nanowire top contact. The contact connected >99% of the wires in parallel and yielded flexible, substrate free solar cells featuring hundreds of thousands of wires.

Building on the success of the Si wire arrays, GaP was epitaxially grown on the material to create heterostructures for photoelectrochemistry. These cells were limited by low absorption in the GaP due to its indirect bandgap, and poor current collection due to a diffusion length of only 80 nm. However, GaAsP on SiGe offers a superior combination of materials, and wire architectures based on these semiconductors were investigated for multijunction arrays. These devices offer potential efficiencies of 34%, as demonstrated through an analytical model and optoelectronic simulations. SiGe and Ge wires were fabricated via chemical-vapor deposition and reactive ion etching. GaAs was then grown on these substrates at the National Renewable Energy Lab and yielded ns lifetime components, as required for achieving high efficiency devices.

Grain growth in protoplanetary disks

The majority of young, low-mass stars are surrounded by optically thick accretion disks. These circumstellar disks provide large reservoirs of gas and dust that will eventually be transformed into planetary systems. Theory and observations suggest that the earliest stage toward planet formation in a protoplanetary disk is the growth of particles, from sub-micron-sized grains to centimeter- sized pebbles. Theory indicates that small interstellar grains are well coupled into the gas and are incorporated to the disk during the proto-stellar collapse. These dust particles settle toward the disk mid-plane and simultaneously grow through collisional coagulation in a very short timescale. Observationally, grain growth can be inferred by measuring the spectral energy distribution at long wavelengths, which traces the continuum dust emission spectrum and hence the dust opacity. Several observational studies have indicated that the dust component in protoplanetary disks has evolved as compared to interstellar medium dust particles, suggesting at least 4 orders of magnitude in particle- size growth. However, the limited angular resolution and poor sensitivity of previous observations has not allowed for further exploration of this astrophysical process.

As part of my thesis, I embarked in an observational program to search for evidence of radial variations in the dust properties across a protoplanetary disk, which may be indicative of grain growth. By making use of high angular resolution observations obtained with CARMA, VLA, and SMA, I searched for radial variations in the dust opacity inside protoplanetary disks. These observations span more than an order of magnitude in wavelength (from sub-millimeter to centimeter wavelengths) and attain spatial resolutions down to 20 AU. I characterized the radial distribution of the circumstellar material and constrained radial variations of the dust opacity spectral index, which may originate from particle growth in these circumstellar disks. Furthermore, I compared these observational constraints with simple physical models of grain evolution that include collisional coagulation, fragmentation, and the interaction of these grains with the gaseous disk (the radial drift problem). For the parameters explored, these observational constraints are in agreement with a population of grains limited in size by radial drift. Finally, I also discuss future endeavors with forthcoming ALMA observations.

Algorithmic challenges in green data centers

With data centers being the supporting infrastructure for a wide range of IT services, their efficiency has become a big concern to operators, as well as to society, for both economic and environmental reasons. The goal of this thesis is to design energy-efficient algorithms that reduce energy cost while minimizing compromise to service. We focus on the algorithmic challenges at different levels of energy optimization across the data center stack. The algorithmic challenge at the device level is to improve the energy efficiency of a single computational device via techniques such as job scheduling and speed scaling. We analyze the common speed scaling algorithms in both the worst-case model and stochastic model to answer some fundamental issues in the design of speed scaling algorithms. The algorithmic challenge at the local data center level is to dynamically allocate resources (e.g., servers) and to dispatch the workload in a data center. We develop an online algorithm to make a data center more power-proportional by dynamically adapting the number of active servers. The algorithmic challenge at the global data center level is to dispatch the workload across multiple data centers, considering the geographical diversity of electricity price, availability of renewable energy, and network propagation delay. We propose algorithms to jointly optimize routing and provisioning in an online manner. Motivated by the above online decision problems, we move on to study a general class of online problem named "smoothed online convex optimization", which seeks to minimize the sum of a sequence of convex functions when "smooth" solutions are preferred. This model allows us to bridge different research communities and help us get a more fundamental understanding of general online decision problems.

A tale of two cobalts

There are important problems to overcome if solar energy or other renewable energy sources are to be used effectively on a global scale. Solar photons must not only be harvested and converted into a usable form, but they must also be efficiently stored so that energy is available for use on cloudy days and at night. In this work, both the energy conversion and energy storage problems are addressed. Specifically, two cobalt complexes were designed and their reactivity probed for applications in energy conversion and storage. The first chapter describes a cobalt complex that is the first example of a dimeric cobalt compound with two singly proton-bridged cobaloxime units linked by a central BO4--bridge. Using electrochemical methods, the redox properties of the dimer were evaluated and it was found to be an electrocatalyst for proton reduction in acetonitrile.

Because hydrogen gas is difficult to handle and store, the hydrogenation of CO2 and later dehydrogenation of the liquid product, formic acid, has been proposed as a hydrogen storage system. Thus, a second complex, described in chapter two, supported by a triphosphine ligand framework was used as a catalyst precursor for this key dehydrogenation step. The studies here demonstrate the efficacy of the complex as a precatalyst for the desired reaction, with good conversion of starting formic acid to CO2 and H2. In order to better understand the properties of the triphosphine cobalt complex, a synthetic procedure for substituting electron donating groups (e.g., methoxy groups) onto the ligand was investigated, yielding a novel diphosphine cobalt(II) complex.

Sustainable IT and IT for sustainability

Energy and sustainability have become one of the most critical issues of our generation. While the abundant potential of renewable energy such as solar and wind provides a real opportunity for sustainability, their intermittency and uncertainty present a daunting operating challenge. This thesis aims to develop analytical models, deployable algorithms, and real systems to enable efficient integration of renewable energy into complex distributed systems with limited information.

The first thrust of the thesis is to make IT systems more sustainable by facilitating the integration of renewable energy into these systems. IT represents the fastest growing sectors in energy usage and greenhouse gas pollution. Over the last decade there are dramatic improvements in the energy efficiency of IT systems, but the efficiency improvements do not necessarily lead to reduction in energy consumption because more servers are demanded. Further, little effort has been put in making IT more sustainable, and most of the improvements are from improved "engineering" rather than improved "algorithms". In contrast, my work focuses on developing algorithms with rigorous theoretical analysis that improve the sustainability of IT. In particular, this thesis seeks to exploit the flexibilities of cloud workloads both (i) in time by scheduling delay-tolerant workloads and (ii) in space by routing requests to geographically diverse data centers. These opportunities allow data centers to adaptively respond to renewable availability, varying cooling efficiency, and fluctuating energy prices, while still meeting performance requirements. The design of the enabling algorithms is however very challenging because of limited information, non-smooth objective functions and the need for distributed control. Novel distributed algorithms are developed with theoretically provable guarantees to enable the "follow the renewables" routing. Moving from theory to practice, I helped HP design and implement industry's first Net-zero Energy Data Center.

The second thrust of this thesis is to use IT systems to improve the sustainability and efficiency of our energy infrastructure through data center demand response. The main challenges as we integrate more renewable sources to the existing power grid come from the fluctuation and unpredictability of renewable generation. Although energy storage and reserves can potentially solve the issues, they are very costly. One promising alternative is to make the cloud data centers demand responsive. The potential of such an approach is huge.

To realize this potential, we need adaptive and distributed control of cloud data centers and new electricity market designs for distributed electricity resources. My work is progressing in both directions. In particular, I have designed online algorithms with theoretically guaranteed performance for data center operators to deal with uncertainties under popular demand response programs. Based on local control rules of customers, I have further designed new pricing schemes for demand response to align the interests of customers, utility companies, and the society to improve social welfare.

Nanophotonic Light Trapping In Thin Solar Cells

Over the last several decades there have been significant advances in the study and understanding of light behavior in nanoscale geometries. Entire fields such as those based on photonic crystals, plasmonics and metamaterials have been developed, accelerating the growth of knowledge related to nanoscale light manipulation. Coupled with recent interest in cheap, reliable renewable energy, a new field has blossomed, that of nanophotonic solar cells.

In this thesis, we examine important properties of thin-film solar cells from a nanophotonics perspective. We identify key differences between nanophotonic devices and traditional, thick solar cells. We propose a new way of understanding and describing limits to light trapping and show that certain nanophotonic solar cell designs can have light trapping limits above the so called ray-optic or ergodic limit. We propose that a necessary requisite to exceed the traditional light trapping limit is that the active region of the solar cell must possess a local density of optical states (LDOS) higher than that of the corresponding, bulk material. Additionally, we show that in addition to having an increased density of states, the absorber must have an appropriate incoupling mechanism to transfer light from free space into the optical modes of the device. We outline a portfolio of new solar cell designs that have potential to exceed the traditional light trapping limit and numerically validate our predictions for select cases.

We emphasize the importance of thinking about light trapping in terms of maximizing the optical modes of the device and efficiently coupling light into them from free space. To further explore these two concepts, we optimize patterns of superlattices of air holes in thin slabs of Si and show that by adding a roughened incoupling layer the total absorbed current can be increased synergistically. We suggest that the addition of a random scattering surface to a periodic patterning can increase incoupling by lifting the constraint of selective mode occupation associated with periodic systems.

Lastly, through experiment and simulation, we investigate a potential high efficiency solar cell architecture that can be improved with the nanophotonic light trapping concepts described in this thesis. Optically thin GaAs solar cells are prepared by the epitaxial liftoff process by removal from their growth substrate and addition of a metallic back reflector. A process of depositing large area nano patterns on the surface of the cells is developed using nano imprint lithography and implemented on the thin GaAs cells.

Dendrites Inhibition in Rechargeable Lithium Metal Batteries

The specific high energy and power capacities of rechargeable lithium metal (Li⁰) batteries are ideally suited to portable devices and are valuable as storage units for intermittent renewable energy sources. Lithium, the lightest and most electropositive metal, would be the optimal anode material for rechargeable batteries if it were not for the fact that such devices fail unexpectedly by short-circuiting via the dendrites that grow across electrodes upon recharging. This phenomenon poses a major safety issue because it triggers a series of adverse events that start with overheating, potentially followed by the thermal decomposition and ultimately the ignition of the organic solvents used in such devices.

In this thesis, we developed experimental platform for monitoring and quantifying the dendrite populations grown in a Li battery prototype upon charging under various conditions. We explored the effects of pulse charging in the kHz range and temperature on dendrite growth, and also on loss capacity into detached “dead” lithium particles.

Simultaneously, we developed a computational framework for understanding the dynamics of dendrite propagation. The coarse-grained Monte Carlo model assisted us in the interpretation of pulsing experiments, whereas MD calculations provided insights into the mechanism of dendrites thermal relaxation. We also developed a computational framework for measuring the dead lithium crystals from the experimental images.