Search NASA⌕ Search

SEARCH · Search NASA

Results for “network optimization”

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 1,747 records · Page 97

Verification and validation of developed short-term forecasting models

Recent advancements in machine learning (ML) and artificial intelligence (AI) technologies provide an opportunity for leveraging data-driven algorithms to predict future nuclear power plant (NPP) operating conditions by using recorded plant process data. Successfully implementing these models can lead to cost-reducing, conditioned-based predictive maintenance through optimized maintenance schedules and a reduction of unnecessary maintenance activities. This report discusses the verification and validation of short-term forecasting processes (i.e., data cleaning, feature selection, model optimization, and forecasting) developed in previous reports. The verification and validation (V&V) process demonstrates the expected precision and accuracy when the ML model encounters new datasets from different systems. Shapley additive explanations were used as the primary means of feature selection across these different data set. Individual models were trained for each data set, then validated through a cross-validation procedure. In this report, two different ML models were tasked to predict variables from three different plant process data sets with varying prediction horizons. The results indicate that support vector regression (SVR) outperformed long short-term memory (LSTM) neural networks in regard to each data set and each prediction horizon in this study, but further tuning and optimization could improve long short-term memory results. However, each forecasting model showed reduced performance as the prediction horizon was extended from 1 hour to 1 day ahead. Research is ongoing to evaluate the optimal input variable space, which is based on a given set of process parameters, to further improve forecasting accuracy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Integrated Smart Distribution RD&D Project Final Technical Report

Title XIII of the Energy Independence and Security Act of 2007 (EISA), tasked OE with accelerating the commercialization, deployment and integration of advanced digital systems that are needed to modernize the nation’s electricity delivery network for enhanced interoperability and cyber security. To support this mandated task, a goal of the SGR&D Program is to develop technology with the ability to dynamically optimize grid operations and resources and incorporate demand response and consumer participation. The majority of historical research and development in the domain of distribution management systems (DMS) had focused on classical, radial and passive networks with one-way power flow from transmission to distribution systems and thus to the end customer. With the focus on customers, a bottom-up approach required a completely new thinking in real-time operations, and automation, of smart distribution systems. Thus, the GE team embarked on a project with a plan of two distinct phases. Work during the first phase concentrated on research and development (R&D) for the first three years. The second phase, lasting approximately two years, accomplished the demonstration of the use cases developed during the first phase, with further sharing and dissemination of the research at industry events. The consolidated technical scope of the project can be summarized into the following six areas: Advanced distribution modeling capability to accurately simulate/model smart grid operations. Accurate representation of the distribution system in real- or near real-time (capture real-time topology). Interoperability with, and seamless communication between, other management systems and databases used by the utility Simulation of distribution systems based on real-time operational planning to analyze the benefits of smart grid assets. Integration of network, market, and renewable resource models for next generation DMS. Management and forecasting of DER (Distributed Generation, Storage, Demand Response).

14 SOLAR ENERGY↗

Distributed Coordination of Networked Microgrids for Voltage Support in Bulk Power Grids

The increasing deployment of distributed energy resources (DERs) and microgrids (MGs) in power distribution systems has enabled the adjustment of reactive power consumption as seen at the substation, which can be used to provide voltage support for the bulk power system (BPS). Leveraging this new capability will provide greater resiliency to the power system as a whole. Here, the goal of this paper is to develop and compare three different algorithms, namely distributed optimal power flow, distributed consensus algorithm, and fully decentralized collaborative autonomy for unbalanced distribution systems for microgrid coordination. These algorithms use networked MGs to support the BPS voltage when a contingency at the bulk grid results in abnormally low voltages, which may be a precursor to voltage collapse. Our comparative analysis includes both qualitative and quantitative assessments of the three algorithms and a discussion of the trade-offs between the decentralized and distributed methods in normal and disrupted conditions. Each algorithm was evaluated on the modified IEEE 13-bus system and a real power distribution system at Chattanooga, Tennessee, that encompasses more than 4500 buses. Each algorithms excels differently and may be suited for different scenarios depending on the condition, operations, and priorities of the power and communication systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

Approximate Latent Factor Algorithm for Scenario Selection and Weighting in Transmission Expansion Planning

One major difficulty in transmission expansion planning is selecting the representative scenarios to use to evaluate candidate transmission networks. The variability in demand and renewable generation makes the inclusion of several scenarios critical when calculating reliability and cost, but including too many scenarios in an optimization is computationally intractable. To reduce the number of representative operating conditions needed to obtain an accurate approximation of the system, we propose a method rooted in multivariate statistics that exploits the latent correlative structure between different scenarios and network configurations. The proposed algorithm includes an objective and rigorous way to select a subset of scenarios that provide as much information about the system as possible, and a method to accurately approximate the system cost from that scenario subset. The result is a set of scenarios and weights that are easily incorporated into traditional transmission expansion planning formulations. We apply this to a 312-bus WECC model with 8,736 distinct operating conditions. The transmission plans found with the proposed method are more reliable and have a lower total cost than those from other scenario reduction techniques, as well as a smaller error between the expected system performance from the optimization objective and the actual system performance.

42 ENGINEERING↗

Convex relaxations for gas expansion planning

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutions to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution

03 NATURAL GAS↗

Comparative Analysis of ANN and LSTM Prediction Accuracy and Cooling Energy Savings through AHU-DAT Control in an Office Building

This paper proposes the optimal algorithm for controlling the HVAC system in the target building. Previous studies have analyzed pre-selected algorithms without considering the unique data characteristics of the target building, such as location, climate conditions, and HVAC system type. To address this, we compare the accuracy of cooling load prediction using ANN and LSTM algorithms, widely used in building energy research, to determine the optimal algorithm for HVAC control in the target building. We develop a simulation model calibrated with actual data to ensure data reliability and compare the energy consumption of the existing HVAC control method and the two algorithms-based methods. Results show that the ANN algorithm, with a CV(RMSE) of 12.7%, has a higher prediction accuracy than the LSTM algorithm, CV(RMSE) of 17.3%, making it a more suitable algorithm for HVAC control. Furthermore, implementing the ANN-based approach results in a 3.2% cooling energy reduction from the optimal control of Air Handling Unit (AHU) Discharge Air Temperature (DAT) compared to the fixed DAT at 12.8 °C in a representative day. This study demonstrates that ML-based HVAC system control can effectively reduce cooling energy consumption in HVAC systems, providing an effective strategy for energy conservation and improved HVAC system efficiency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Operation-adversarial scenario generation

This paper proposes a modified conditional generative adversarial network (cGAN) model to generate net load scenarios for power systems that are statistically credible, conditioned by given labels (e.g., seasons), and, at the same time, “stressful” to the system operations and dispatch decisions. The measure of stress used in this paper is based on the operating cost increases due to net load changes. The proposed operation-adversarial cGAN (OA-cGAN) internalizes a DC optimal power flow model and seeks to maximize the operating cost and achieve a worst-case data generation. The training and testing stages employed in the proposed OA-cGAN use historical day-ahead net load forecast errors and has been implemented for the realistic NYISO 11-zone system. In conclusion, our numerical experiments demonstrate that the generated operation-adversarial forecast errors lead to more cost-effective and reliable dispatch decisions.

42 ENGINEERING↗

Influence of Silane Coupling Agents on Filler Network Structure and Stress-Induced Particle Rearrangement in Elastomer Nanocomposites

Filled rubber materials are key in many technologies having broad impact on the economy and sustainability, the most obvious being tire technology. Adding filler dramatically improves the strength of rubber by reinforcement and tailoring the type of filler and the chemistry of the interface between filler and rubber matrix is important for optimizing performance metrics such as fuel efficiency. In a highly loaded, silica-filled, crosslinked model rubber closely mimicking commercial materials, both the filler network structure and the dynamics of the silica filler particles change when the silica surface is modified with silane coupling agents. Reduction in size scales characteristic of the structure are quantified using ultra-small-angle X-ray scattering (USAXS) measurements and the particle dynamics probed with X-ray photon correlation spectroscopy (XPCS). While the structure averaged over the scattering volume changes little with aging after step strain, the dynamics slow appreciably in a manner that varies with the treatment of the silica filler. The evolution of filler particle dynamics depends on the chemical functionality at the silica surface and observing these differences suggests a way of thinking about the origins of hysteresis in nanoparticle-reinforced rubbers. These microscopic filler dynamics are correlated with the macroscopic stress relaxation of the filled materials. The combination of static and dynamic X-ray scattering techniques with rheological measurements is a powerful approach for elucidating the microscopic mechanisms of rubber reinforcement.

36 MATERIALS SCIENCE↗

Autoregressive neural quantum states of Fermi Hubbard models

Neural quantum states (NQSs) have emerged as a powerful ansatz for variational quantum Monte Carlo studies of strongly correlated systems. Here, we apply recurrent neural networks (RNNs) and autoregressive transformer neural networks to the Fermi-Hubbard and the (non-Hermitian) Hatano-Nelson-Hubbard models in one and two dimensions. In both cases, we observe that the convergence of the RNN ansatz is challenged when increasing the interaction strength. We present a physically motivated and easy-to-implement strategy for improving the optimization, namely, by ramping of the model parameters. Furthermore, we investigate the advantages and disadvantages of the autoregressive sampling property of both network architectures. For the Hatano-Nelson-Hubbard model, we identify convergence issues that stem from the autoregressive sampling scheme in combination with the non-Hermitian nature of the model. Our findings provide insights into the challenges of the NQS approach and make the first step towards exploring strongly correlated electrons using this ansatz. Published by the American Physical Society 2025

Ibarra-García-Padilla, Eduardo (ORCID:000000019165↗

Ripple-Type Control for Enhancing Resilience of Networked Physical Systems

Distributed control agents have been advocated as an effective means for improving the resiliency of our physical infrastructures under unexpected events. Purely local control has been shown to be insufficient, centralized optimal resource allocation approaches can be slow. In this context, we put forth a hybrid low-communication saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a “hotline” communication network. According to this protocol, agents act on local readings unless their control resources have been depleted, in which case they send a beacon for assistance to peer agents. Our ripple-type scheme triggers communication locally only for the agents with saturated resources and it is proved to converge. Moreover, under a monotonicity assumption on the underlying physical law coupling control outputs to inputs, the devised control is proved to converge to a configuration satisfying safe operational constraints. The assumption is shown to hold for voltage control in electric power systems and pressure control in water distribution networks. Numerical tests corroborate the efficacy of the novel scheme.

distributed control↗

Design Principles for Resonant Wave Energy Converters: Benchmarking Power Capture and Flow

Control co-design (CCD) in Wave Energy Converters (WECs) integrates the controller, power take-off (PTO), and buoy models during system design to optimize power output. Using the bi-conjugate impedance matching principle, this study models the PTO as a two-port network, revealing impedance matching conditions at the input and output ports as a function of the buoy, PTO, and controller. Here, this study examines the pairing of a flywheel-type pitch resonator PTO within a given buoy constrained by limited space and ballast capacity. The results show that physical constraints imposed by the buoy affect PTO performance. While controller tuning achieves optimal output impedance matching and flywheel inertia is maximized within the buoy's limitations, the PTO's input impedance remains smaller than the complex conjugate of the buoy's intrinsic impedance. This mismatch limits the PTO's ability to generate sufficient reaction torque, particularly outside the resonance frequency, resulting in narrow-band power transfer. The findings emphasize the need for PTO design modifications to improve input power transfer. Pendulum-based PTO mechanisms are proposed as alternatives to couple with multiple buoy motion modes and improve wave-to-wire efficiency while respecting system constraints.

Control Co-Design↗

Distributed Louvain Algorithm for Graph Community Detection

In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be “related” to one another than they are to the rest of the network. The goodness of partitioning into communities is typically measured using a well known measure called modularity. However, modularity optimization is an NP-complete problem. In 2008, Blondel, et al. introduced a multi-phase, iterative heuristic for modularity optimization, called the Louvain method. Owing to its speed and ability to yield high quality communities, the Louvain method continues to be one of the most widely used tools for serial community detection. In this paper, we present the design of a distributed memory implementation of the Louvain algorithm for parallel community detection. Our approach begins with an arbitrarily partitioned distributed graph input, and employs several heuristics to speedup the computation of the different steps of the Louvain algorithm. We evaluate our implementation and its different variants using real-world networks from various application domains (including internet, biology, social networks). Our MPI+OpenMP implementation yields about 7x speedup (on 4K processes) for soc-friendster network (1.8B edges) over a state-of-the-art shared-memory multicore implementation (on 64 threads), without compromising output quality. Furthermore, our distributed implementation was able to process a larger graph (uk-2007; 3.3B edges) in 32 seconds on 1K cores (64 nodes) of NERSC Cori, when the state-of-the-art shared-memory implementation failed to run due to insufficient memory on a single Cori node containing 128 GB.

High performance computing, graph algorithms, Dist↗

Smart-PGSim: Using Neural Network to Accelerate AC-OPF Power Grid Simulation

In this work we address the problem of accelerating complex power-grid simulation through machine learning ( ML). Specifically, we develop a framework, Smart-PGSim,which generates multitask-learning (MTL) neural network (NN)models to predict the initial values of variables critical to the problem convergence. MTL models allow information sharing when predicting multiple dependent variables while including customized layers to predict individual variables. We show that,to achieve the required accuracy, it is paramount to embed domain-specific constraints derived from the specific power-grid components in the MTL model. Smart-PGSim then employs the predicted initial values as a high-quality initial condition for the power-grid numerical solver (warm start), resulting in both higher performance compared to state-of-the-art solutions while maintaining the required accuracy. Smart-PGSim brings 2.60×speedup on average (up to 3.28×) computed over 10,000 problems, without losing solution optimality.

machine learning, neural networks↗

Gray-Box Modeling for Distribution Systems With Inverter-Based Resources: Integrating Physics-Based and Data-Driven Approaches

Here, in this paper, we develop a novel gray-box modeling approach for distribution systems with inverter-based resources (IBRs). The proposed gray-box modeling method aims to improve estimation accuracy by taking advantages of both physics-based (white-box) and data-driven (black-box) modeling approaches. To this end, we utilize partial physical knowledge of the system, including the inverters’ structures and control diagrams, as well as the equivalent network model simplified through Kron reduction. The white-box model containing unknown parameters is then constructed with mathematical equations and an optimization-based method is subsequently employed to identify these unknown parameters within the white-box model. Next, the graybox modeling framework is then constructed by embedding the output variables of the white-box model into the input vector of a black-box model (represented using a neural network). Finally, the black-box section is trained using the collected input-output datasets and the gray-box model is then obtained. Furthermore, case studies demonstrate that our gray-box modeling approach effectively improves estimation accuracy compared to purely physics-based or data-driven methods.

42 ENGINEERING↗

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗

End-System Aware Peak Link Utilization Transport for Big Data Transfer over Dedicated Connections

High-performance networks provisioning 10/40-Gbps dedicated channels have been rapidly developed andincreasingly deployed to support big data transfers on the order of terabytes or petabytes in large-scale network-intensiveapplications. However, end users have not seen corresponding increase in application throughput mainly because traditional end-to-end transport methods are not optimized for such connections. New congestion or flow control mechanisms are desirable to meet the challenges brought to transport protocol design by dedicated connections. The advent and proliferation of multi-core processors make it now possible to improve application throughput by providing multiple processing and network resources to a single data transfer. Based on the existing PLUT method, we proposed a new dynamic buffer management scheme and an automatic parallelism tuning mechanism to achieve the maximal bottleneck rate. The performance superiority of PLUT is justified by the experimental results collected over a local 10Gbps dedicated connection.

Rao, Nageswara↗

Dynamic Interference Management for UAV-Assisted Wireless Networks

Here, we investigate a transmission mechanism aiming to improve the data rate between a base station (BS) and a user equipment (UE) through deploying multiple relaying UAVs. We consider the effect of interference incurred by another established communication network, which makes our problem challenging and different from the state of the art. We aim to design the 3D trajectories and power allocation for the UAVs to maximize the data flow of the network while keeping the interference on the existing communication network below a threshold. We utilize the mobility feature of the UAVs to evade the (un)-intended interference caused by (un)-intentional interferers. To this end, we propose an alternating-maximization approach to jointly obtain the 3D trajectories and the UAVs transmission powers. We handle the 3D trajectory design by resorting to spectral graph the power allocation through convex optimization techniques. We also approach the problem from the intentional interferer’s perspective where smart jammers chase the UAVs to effectively degrade the data flow of the network. We also extend our work to the case for multiple UEs. Finally, we demonstrate the efficacy of our proposed method through extensive simulations.

42 ENGINEERING↗