Search NASA⌕ Search

SEARCH · Search NASA

Results for “power networks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

Plasma production and ion heating systems for the Material Plasma Exposure eXperiment

Plasma production and ion heating in the Material Plasma Exposure eXperiment (MPEX), whose design is nearing completion, is accomplished using continuous wave RF power with average power density up to 1.6 MW/m2 at the plasma interface. Plasma is produced using helicon waves coupled through a single helical antenna at 13.56 MHz with power supplied by three 100 kW fixed-frequency RF generators feeding a power combiner network followed by the matching network and launcher. The helicon source can utilize various gasses including hydrogen, deuterium, and helium, with a magnetic field strength in the source region up to 0.2 T, and maximum device |B| of 2.5 T. Power is coupled to ions via ion cyclotron heating at the fundamental resonance using a pair of phased helical antennas operating in the frequency range 4-9 MHz, that launch waves towards the resonance from the antenna region where ω > ωci. ICH power is supplied by a single 500 kW tunable RF transmitter through a 90° power splitter and matching/decoupling network. In the case of both the helicon and ICH systems the antennas are located external to the vacuum, with power transferred through novel water-cooled coaxial vacuum windows consisting of fused quartz outer cylinders and silicon nitride inner cylinders with forced convection water cooling between them. The antenna enclosures are pressurized with dry air to 3 bar absolute for voltage standoff.Several 3-D COMSOL models have been created to simulate the two systems. A model of the helicon region utilizing a cold plasma dielectric tensor with accurate magnetic field and realistic plasma density profiles has been used to calculate the plasma loading/complex antenna input impedance at the launcher feed for various ne and |B| values, for the purpose of estimating power handling. It also incorporates the geometry of all launcher structures relevant to this determination. A still more detailed model of the launcher together with a lossy dielectric plasma surrogate has been used to determine RF electric field values and power losses in the device components.Similar models have been produced to predict the performance and power handling of the ICH launcher. For this device the impedance matrix of the two-element antenna array is calculated using a warm plasma model, necessary to properly determine the wave propagation and absorption.

Goulding, Richard↗

State Estimation for Distribution Networks with Asynchronous Sensors Using Stochastic Descent: Preprint

This paper investigates the problem of state estimation for distribution networks with asynchronous sensors comprising of a mix of smart meters and phasor measurement units (PMUs) with multiple sampling and reporting rates. We consider two independent scenarios of state estimation and tracking, with either voltages or currents as states. With these two sets, we investigate estimation under (a) full data, assuming all measurements are available and (b) limited data, where an online algorithmic approach is adopted to estimate the possibly time-varying states by processing measurements as and when available. The proposed algorithm, inspired by the classical Stochastic Gradient Descent (SGD) approach updates the states based on the previous estimate and the newly available measurements. Finally, we demonstrate the estimation and tracking efficacy through numerical simulations on the IEEE-37 test network, while also highlighting how estimation with currents as states leads to faster convergence.

asynchronous sensors↗

Volt/VAR Optimization (VVO) Application on GridAPPS-D Platform

There is a large increment in the distributed energy resources (DERs) installation and deployments of smart sensing devices and communication infrastructure; hence, the power distribution network is swiftly evolving from a passive network to an active network. This motivates the development of advanced applications to operate power distribution systems for higher efficiency and reliability. These advanced applications are model-based and data-driven. This requires an advanced distribution management system (ADMS) to provide required data for the optimal operation of the distribution systems by coordinating various grid controllable devices. In this paper a Volt-VAR optimization (VVO) application to coordinate the grid’s legacy and new voltage control devices for conservation voltage reduction (CVR) is deployed on the GridAPPS-D platform (an open-source platform ) for ADMS application development. The VVO application is validated for various operating conditions on using modified IEEE 8500-node distribution test feeders. Further, the application is successfully deployed on the GridAPPS-D platform.

Jha, Rahul↗

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of large power systems

Computer-oriented power systems analysis procedures in the electric utilities are surveyed. The growth of electric power systems is discussed along with the solution of sparse network equations, power flow, and stability studies.

Dommel, H. W.↗

Network visualization, intrusion detection, and network healing

The present disclosure is related to a cyber-security system that includes a Supervisory Control and Data Acquisition (SCADA) network monitor configured to receive a data set from a power system network, an event manager, and a mitigation system, where the SCADA network monitor includes an anomaly detector.

Rivera, Joshua Eli↗

Artificial neural network application for space station power system fault diagnosis

This study presents a methodology for fault diagnosis using a Two-Stage Artificial Neural Network Clustering Algorithm. Previously, SPICE models of a 5-bus DC power distribution system with assumed constant output power during contingencies from the DDCU were used to evaluate the ANN's fault diagnosis capabilities. This on-going study uses EMTP models of the components (distribution lines, SPDU, TPDU, loads) and power sources (DDCU) of Space Station Alpha's electrical Power Distribution System as a basis for the ANN fault diagnostic tool. The results from the two studies are contrasted. In the event of a major fault, ground controllers need the ability to identify the type of fault, isolate the fault to the orbital replaceable unit level and provide the necessary information for the power management expert system to optimally determine a degraded-mode load schedule. To accomplish these goals, the electrical power distribution system's architecture can be subdivided into three major classes: DC-DC converter to loads, DC Switching Unit (DCSU) to Main bus Switching Unit (MBSU), and Power Sources to DCSU. Each class which has its own electrical characteristics and operations, requires a unique fault analysis philosophy. This study identifies these philosophies as Riddles 1, 2 and 3 respectively. The results of the on-going study addresses Riddle-1. It is concluded in this study that the combination of the EMTP models of the DDCU, distribution cables and electrical loads yields a more accurate model of the behavior and in addition yielded more accurate fault diagnosis using ANN versus the results obtained with the SPICE models.

Momoh, James A.↗

Control of energy storage to reduce electric power system off-nominal frequency deviations

A hybrid power generation system is formed by the combination of an energy storage system (ESS) and a rotating synchronous power generator (SPG). Energy is stored in or released from the ESS in response to measurements of the at least one angle parameter, selected from rotor, torque, or power angle of the SPG, to provide active frequency damping of electrical power output. The control of ESS energy exchange increases the stabilizing impact of the SPG inertia on the frequency of electricity in an electrical network or power grid. The hybrid power generation system can have an effective equal area criterion for stability limit that is greater than that of the SPG operating without the ESS. The hybrid power generation system can enable the electrical network to have a greater proportion of variable or distributed energy resource (DER) power generation systems without otherwise exceeding stability limits.

Vartanian, Charles K.↗

Efficient and Robust Data Collection Using Compact Micro Hardware, Distributed Bus Architectures and Optimizing Software

Future In-Space propulsion systems for exploration programs will invariably require data collection from a large number of sensors. Consider the sensors needed for monitoring several vehicle systems states of health, including the collection of structural health data, over a large area. This would include the fuel tanks, habitat structure, and science containment of systems required for Lunar, Mars, or deep space exploration. Such a system would consist of several hundred or even thousands of sensors. Conventional avionics system design will require these sensors to be connected to a few Remote Health Units (RHU), which are connected to robust, micro flight computers through a serial bus. This results in a large mass of cabling and unacceptable weight. This paper first gives a survey of several techniques that may reduce the cabling mass for sensors. These techniques can be categorized into four classes: power line communication, serial sensor buses, compound serial buses, and wireless network. The power line communication approach uses the power line to carry both power and data, so that the conventional data lines can be eliminated. The serial sensor bus approach reduces most of the cabling by connecting all the sensors with a single (or redundant) serial bus. Many standard buses for industrial control and sensor buses can support several hundreds of nodes, however, have not been space qualified. Conventional avionics serial buses such as the Mil-Std-1553B bus and IEEE 1394a are space qualified but can support only a limited number of nodes. The third approach is to combine avionics buses to increase their addressability. The reliability, EMI/EMC, and flight qualification issues of wireless networks have to be addressed. Several wireless networks such as the IEEE 802.11 and Ultra Wide Band are surveyed in this paper. The placement of sensors can also affect cable mass. Excessive sensors increase the number of cables unnecessarily. Insufficient number of sensors may not provide adequate coverage of the system. This paper also discusses an optimal technique to place and validate sensors.

micro hardware↗

Newton-Raphson AC Power Flow Convergence Based on Deep Learning Initialization and Homotopy Continuation

Power flow forms the basis of many power system studies. With the increased penetration of renewable energy, grid planners tend to perform multiple power flow simulations under various operating conditions and not just selected snapshots at peak or light load conditions. Getting a converged AC power flow (ACPF) case remains a significant challenge for grid planners especially in large power grid networks. This paper proposes a two-stage approach to improve Newton-Raphson ACPF convergence and was applied to a 6102 bus Electric Reliability Council of Texas (ERCOT) system. The first stage utilizes a deep learning-based initializer with data re-training. Here a deep neural network (DNN) initializer is developed to provide better initial voltage magnitude and angle guesses to aid in power flow convergence. This is because Newton-Raphson ACPF is quite sensitive to the initial conditions and bad initialization could lead to divergence. The DNN initializer includes a data re-training framework that improves the initializer's performance when faced with limited training data. The DNN initializer successfully solved 3,285 cases out of 3,899 non-converging dispatch and performed better than random forest and DC power flow initialization methods. ACPF cases not solved in this first stage are then passed through a hot-starting algorithm based on homotopy continuation with switched shunt control. The hot-starting algorithm successfully converged 416 cases out of the remaining 614 non-converging ACPF dispatch. In conclusion, the combined two-stage approach achieved a 94.9% success rate, by converging a total of 3,701 cases out of the initial 3,899 unsolved cases.

Deep learning↗

Disordered topological graphs enhancing nonlinear phenomena

Complex networks play a fundamental role in understanding phenomena from the collective behavior of spins, neural networks, and power grids to the spread of diseases. Topological phenomena in such networks have recently been exploited to preserve the response of systems in the presence of disorder. We propose and demonstrate topological structurally disordered systems with a modal structure that enhances nonlinear phenomena in the topological channels by inhibiting the ultrafast leakage of energy from edge modes to bulk modes. We present the construction of the graph and show that its dynamics enhances the topologically protected photon pair generation rate by an order of magnitude. Disordered nonlinear topological graphs will enable advanced quantum interconnects, efficient nonlinear sources, and light-based information processing for artificial intelligence.

42 ENGINEERING↗

PETSc DMNetwork: A Library for Scalable Network PDE-Based Multiphysics Simulations

We present DMNetwork, a high-level package included in the PETSc library for the simulation of multiphysics phenomena over large-scale networked systems. The library aims at applications that have networked structures such as those in electrical, gas, and water distribution systems. DMNetwork provides data and topology management, parallelization for multiphysics systems over a network, and hierarchical and composable solvers to exploit the problem structure. DMNetwork eases the simulation development cycle by providing the necessary infrastructure through simple abstractions to define and query the network components. This article presents the design of DMNetwork, illustrates its user interface, and demonstrates its ability to solve multiphysics systems, such as an electric circuit, a network of power grid and water subnetworks, and transient hydraulic systems over large networks with more than 2 billion variables on extreme-scale computers using up to 30,000 processors.

extreme-scale computing↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optics Enabled Networks and Architectures for Data Center Cost and Power Efficiency

Bandwidth demand for datacenter networks continues as performance increases and is further fueled by the exploding demand for AI and new HPC workloads. Managing power and costs will require a range of solutions including new networking and workload specialized architectures, composable systems and optical circuit switching. In this study we focus primarily on two topics, examining the benefits of flatter networks (enabled mainly by means of co-packaged-optics-enabled switches) and the utilization improvement potential for composable (disaggregated) systems, while discussing specialized hardware and networks, and optical circuit switching more briefly.

99 GENERAL AND MISCELLANEOUS↗

Strategic Placement and Sizing of Distributed Generation for Resilience Enhancement of Distribution Grids With Microgrid Formation

The rise in frequency and severity of extreme weather events highlights the need for resilient power distribution networks. Microgrids can help improve the resilience of distribution grids by providing continuous power supply using local distribution generation (DG) when the distribution grid fails. In this paper, we propose an approach for optimal placement and sizing of DG to form multiple microgrids throughout the distribution network by restoration actions such as switching operations in case of distribution grid outages caused by extreme weather events. Considering the randomness of damaged distribution lines, the DG placement and sizing problem is formulated as a two-stage stochastic mixed-integer program, with the first stage determining the placement and size of DG, and the second stage focusing on minimizing the amount of load shedding through network restoration and microgrid formations for each scenario. Due to the large number of scenarios, the sample average approximation (SAA) method is employed to solve the problem. The results of case studies on a modified IEEE 33 bus distribution grid demonstrate the effectiveness of the proposed DG placement and sizing strategy in improving the resilience of distribution grids by allowing the formation of multiple microgrids. In addition, the robustness and accuracy of the SAA method are validated through various case studies.

Distributed generation planning↗

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗