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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Data optimization for large batch distributed training of deep neural networks

Distributed training in deep learning (DL) is common practice as data and models grow. The current practice for distributed training of deep neural networks faces the challenges of communication bottlenecks when operating at scale, and model accuracy deterioration with an increase in global batch size. Present solutions focus on improving message exchange efficiency as well as implementing techniques to tweak batch sizes and models in the training process. The loss of training accuracy typically happens because the loss function gets trapped in a local minima. We observe that the loss landscape minimization is shaped by both the model and training data and propose a data optimization approach that utilizes machine learning to implicitly smooth out the loss landscape resulting in fewer local minima. Our approach filters out data points which are less important to feature learning, enabling us to speed up the training of models on larger batch sizes to improved accuracy.

Gahlot, Shubhankar↗
DOE OSTI2020

A general-purpose method for Pareto optimal placement of flow rate and concentration sensors in networked systems – With application to wastewater treatment plants

The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.

42 ENGINEERING↗
DOE OSTI2021

A Framework for International Collaboration on ITER Using Large-Scale Data Transfer to Enable Near-Real-Time Analysis

The global nature of the ITER project along with its projected ~ petabyte per day data generation presents a unique challenge, but also an opportunity for the fusion community to rethink, optimize, and enhance our scientific discovery process. Recognizing this, collaborative research with computational scientists was undertaken over the past several years to create a framework for large-scale data movement across wide-area networks (WANs), to enable global near-real time analysis of fusion data. This would broaden the available computational resources for analysis/simulation, and increase the number of researchers actively participating in experiments. An official demonstration of this framework for fast, large data transfer and real-time analysis was carried out between the KSTAR tokamak in Daejeon, Korea and PPPL in Princeton, USA. Streaming large data transfer, with near real-time movie creation and analysis of the KSTAR Electron Cyclotron Emission imaging (ECEI) data, was performed using the I/O framework ADIOS, and comparisons made at PPPL with simulation results from the XGC1 code. These demonstrations were made possible utilizing an optimized network configuration at PPPL, which achieved over 8.8 Gbps (88% utilization) in throughput tests from NFRI to PPPL. This demonstration showed the feasibility for large-scale data analysis of KSTAR data, and provides a nascent framework to enable use of globally distributed computational and personnel resources in pursuit of scientific knowledge from the ITER experiment.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

Increasing occurrences of natural disasters and grid emergency events consistently challenge the safe and reliable operations of power systems. During such emergency situations, system operators may proactively shed load to mitigate risks. However, uncoordinated implementation of load shedding may disrupt electricity supply and even lead to cascading failures. Meanwhile, it is crucial to address potential biases affecting different customers when executing load shedding. This paper addresses the dynamic topology reconfiguration problem for networked microgrids with distributed energy resources under emergency conditions. Specifically, we propose a novel rolling-horizon optimization model that integrates fairness-aware constraints into the networked microgrid topology reconfiguration. Unlike existing approaches that focus solely on efficiency or apply fairness considerations in static settings, our method explicitly incorporates temporal fairness constraints to restrict repeated or excessive load curtailment for load blocks. Moreover, the fairness-aware constraints are specifically developed for the context of dynamic networked microgrid topology reconfiguration, and are designed to be convex or amenable to linear reformulations, which offers a more tractable alternative to traditional models with non-convex formulations. Numerical studies on a modified IEEE 13-bus system and a larger-sized SMART-DS networked microgrid system demonstrate the performance of the proposed algorithm towards more fairness-aware networked microgrid topology reconfiguration decision-making.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Unraveling Adsorbate-Induced Structural Evolution of Iron Carbide Nanoparticles

Iron carbide (Fe x C y ) nanoparticles (NPs) are promising candidates for replacing platinum group metals in industrial applications, such as high-temperature Fischer–Tropsch synthesis. However, due to their amorphous nature, characterization of the active sites has been challenging experimentally and computationally. Here, using a combined density functional theory (DFT), neural network interatomic potential-assisted global optimization, and ensemble learning study, we evaluate dynamic surface changes associated with syngas (H and CO) interactions. For this purpose, we have developed a general procedure that we use to model an experimentally relevant 270-atom Fe 182 C 88 NP using the neural network-assisted stochastic surface walk global optimization algorithm (SSW-NN). Once generated, the Fe 182 C 88 NP active sites and particle morphology are thoroughly characterized before the effects of syngas adsorbate interactions are explored by using DFT and molecular dynamics simulations. Lastly, we explore correlations between geometric and electronic features of the active sites and the adsorption of H (H ads ), using a regularized random forest machine learning algorithm. In doing so, we identified the Fe–C coordination number and p orbital occupancy as the most important descriptors affecting H ads . Furthermore, using a combined ML and quantum chemistry approach, our work demonstrates a general and efficient procedure for generating and probing complex surface phenomena on binary nanoparticles.

Adsorption↗
DOE OSTI2021

A TTL-based Approach for Content Placement in Edge Networks

Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed network structure, cache sizes, it is challenging to decide where to place the content, and how long it should be cached. In this paper, we study the utility optimization of content placement at edge networks through timer-based (TTL) policies. We propose provably optimal distributed algorithms that operate at each network cache to maximize the overall network utility. Our TTL-based optimization model provides theoretical answers to how long each content must be cached, and where it should be placed in the edge network. Extensive evaluations show that our algorithm significantly outperforms path replication with conventional caching algorithms over some network topologies.

Panigrahy, Nitish K.↗
NASA NTRS2021

User Preference Optimization for Oversubscribed Scheduling of NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗
NASA NTRS2003

Flight Test of an Intelligent Flight-Control System

The F-15 Advanced Controls Technology for Integrated Vehicles (ACTIVE) airplane (see figure) was the test bed for a flight test of an intelligent flight control system (IFCS). This IFCS utilizes a neural network to determine critical stability and control derivatives for a control law, the real-time gains of which are computed by an algorithm that solves the Riccati equation. These derivatives are also used to identify the parameters of a dynamic model of the airplane. The model is used in a model-following portion of the control law, in order to provide specific vehicle handling characteristics. The flight test of the IFCS marks the initiation of the Intelligent Flight Control System Advanced Concept Program (IFCS ACP), which is a collaboration between NASA and Boeing Phantom Works. The goals of the IFCS ACP are to (1) develop the concept of a flight-control system that uses neural-network technology to identify aircraft characteristics to provide optimal aircraft performance, (2) develop a self-training neural network to update estimates of aircraft properties in flight, and (3) demonstrate the aforementioned concepts on the F-15 ACTIVE airplane in flight. The activities of the initial IFCS ACP were divided into three Phases, each devoted to the attainment of a different objective. The objective of Phase I was to develop a pre-trained neural network to store and recall the wind-tunnel-based stability and control derivatives of the vehicle. The objective of Phase II was to develop a neural network that can learn how to adjust the stability and control derivatives to account for failures or modeling deficiencies. The objective of Phase III was to develop a flight control system that uses the neural network outputs as a basis for controlling the aircraft. The flight test of the IFCS was performed in stages. In the first stage, the Phase I version of the pre-trained neural network was flown in a passive mode. The neural network software was running using flight data inputs with the outputs provided to instrumentation only. The IFCS was not used to control the airplane. In another stage of the flight test, the Phase I pre-trained neural network was integrated into a Phase III version of the flight control system. The Phase I pretrained neural network provided realtime stability and control derivatives to a Phase III controller that was based on a stochastic optimal feedforward and feedback technique (SOFFT). This combined Phase I/III system was operated together with the research flight-control system (RFCS) of the F-15 ACTIVE during the flight test. The RFCS enables the pilot to switch quickly from the experimental- research flight mode back to the safe conventional mode. These initial IFCS ACP flight tests were completed in April 1999. The Phase I/III flight test milestone was to demonstrate, across a range of subsonic and supersonic flight conditions, that the pre-trained neural network could be used to supply real-time aerodynamic stability and control derivatives to the closed-loop optimal SOFFT flight controller. Additional objectives attained in the flight test included (1) flight qualification of a neural-network-based control system; (2) the use of a combined neural-network/closed-loop optimal flight-control system to obtain level-one handling qualities; and (3) demonstration, through variation of control gains, that different handling qualities can be achieved by setting new target parameters. In addition, data for the Phase-II (on-line-learning) neural network were collected, during the use of stacked-frequency- sweep excitation, for post-flight analysis. Initial analysis of these data showed the potential for future flight tests that will incorporate the real-time identification and on-line learning aspects of the IFCS.

Davidson, Ron↗
DOE OSTI2020

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2018

An Artificial Neural Network Model to Predict the Bainite Plate Thickness of Nanostructured Bainitic Steels Using an Efficient Network-Learning Algorithm

Nanostructured bainitic steel has an extraordinary ultrahigh strength of about 2.0 GPa along with good toughness of 30 MPa m{sup 1/2}. The finer thickness of plate 20-80 nm is largely responsible for achieving such a large hardness of 690-720 HV. In this work, a multilayer perceptron-based artificial neural network (ANN) model has been developed to predict the thickness of bainite plate pertaining to nanostructured bainitic steels. The inputs of the ANN model are, namely, Gibbs free energy for bainitic transformation, austenite strength, transformation temperature for bainite and carbon concentration in the steel. The model prediction revealed that the bainite plate thickness critically depends on austenite strength and Gibbs free energy. From the neural prediction, it is concluded that formation of nanostructured bainitic steel is feasible only if sufficient austenite strength (above 165 MPa) has been achieved. This can be accomplished with a minimum carbon content of 0.5 wt.% in steel and transformation temperature below 300 °C. Higher driving force (Gibbs free energy) below − 1800 J/mol is another prerequisite condition of formation of nanostructured bainite steel. The network-learning architecture has been optimized using the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to minimize the network training error within eight training cycles. The algorithm facilitates a faster convergence of network training and testing errors.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Distributed Energy Resources Coordination over Time-varying Directed Communication Networks

In this paper, we consider an optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We first propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighboring DERs over a time-varying directed communication network. We show that the proposed distributed algorithm with appropriately chosen step-sizes solve the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mild condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.

Yang, Tao↗
NASA NTRS2005

Design Sensitivity for a Subsonic Aircraft Predicted by Neural Network and Regression Models

A preliminary methodology was obtained for the design optimization of a subsonic aircraft by coupling NASA Langley Research Center s Flight Optimization System (FLOPS) with NASA Glenn Research Center s design optimization testbed (COMETBOARDS with regression and neural network analysis approximators). The aircraft modeled can carry 200 passengers at a cruise speed of Mach 0.85 over a range of 2500 n mi and can operate on standard 6000-ft takeoff and landing runways. The design simulation was extended to evaluate the optimal airframe and engine parameters for the subsonic aircraft to operate on nonstandard runways. Regression and neural network approximators were used to examine aircraft operation on runways ranging in length from 4500 to 7500 ft.

Hopkins, Dale A.↗
DOE OSTI2021

Planning for Resilient Power Distribution Systems using Risk-Based Quantification and Q-Learning

Grid hardening is one of the most effective approaches that reduce the component failures and restoration efforts thus increasing the resilience of the power systems against extreme events. However, hardening and upgrading the entire system is prohibitively expensive and hence the optimal design of a distribution network is challenging. This paper adopted a reinforcement learning algorithm to identify the optimal hardening strategy to enhance the resilience of power distribution systems. Adopting the Q-learning algorithm as the reinforcement learning technique, we found the sequential optimal action for hardening measures to enhance the grid's resilience for the given budget. To identify the optimal strategy through Q-learning, Conditional Value at Risk (CVaR) is used as a rewarding metric. A study on the IEEE 123-bus test feeder validate the effectiveness of the proposed model and show how to effectively allocate budget limited resources to plan a resilient power distribution network.

Paul, Shuva↗
DOE OSTI2023

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗
NASA NTRS1998

Neural Network and Regression Approximations in High Speed Civil Transport Aircraft Design Optimization

Nonlinear mathematical-programming-based design optimization can be an elegant method. However, the calculations required to generate the merit function, constraints, and their gradients, which are frequently required, can make the process computational intensive. The computational burden can be greatly reduced by using approximating analyzers derived from an original analyzer utilizing neural networks and linear regression methods. The experience gained from using both of these approximation methods in the design optimization of a high speed civil transport aircraft is the subject of this paper. The Langley Research Center's Flight Optimization System was selected for the aircraft analysis. This software was exercised to generate a set of training data with which a neural network and a regression method were trained, thereby producing the two approximating analyzers. The derived analyzers were coupled to the Lewis Research Center's CometBoards test bed to provide the optimization capability. With the combined software, both approximation methods were examined for use in aircraft design optimization, and both performed satisfactorily. The CPU time for solution of the problem, which had been measured in hours, was reduced to minutes with the neural network approximation and to seconds with the regression method. Instability encountered in the aircraft analysis software at certain design points was also eliminated. On the other hand, there were costs and difficulties associated with training the approximating analyzers. The CPU time required to generate the input-output pairs and to train the approximating analyzers was seven times that required for solution of the problem.

Patniak, Surya N.↗
DOE OSTI2022

Energy‐aware relay positioning in flying networks

Summary The ability to move and hover has made rotary‐wing unmanned aerial vehicles (UAVs) suitable platforms to act as flying communications relays (FCRs), aiming at providing on‐demand, temporary wireless connectivity when there is no network infrastructure available or a need to reinforce the capacity of existing networks. However, since UAVs rely on their on‐board batteries, which can be drained quickly, they typically need to land frequently for recharging or replacing them, limiting their endurance and the flying network availability. The problem is exacerbated when a single FCR UAV is used. The FCR UAV energy is used for two main tasks: Communications and propulsion. The literature has been focused on optimizing both the flying network performance and energy efficiency from the communications point of view, overlooking the energy spent for the UAV propulsion. Yet, the energy spent for communications is typically negligible when compared with the energy spent for the UAV propulsion. In this article, we propose energy‐aware relay positioning (EREP), an algorithm for positioning the FCR taking into account the energy spent for the UAV propulsion. Building upon the conclusion that hovering is not the most energy‐efficient state, EREP defines the trajectory and speed that minimize the energy spent by the FCR UAV on propulsion, without compromising in practice the quality of service offered by the flying network. The EREP algorithm is evaluated using simulations. The obtained results show gains up to 26% in the FCR UAV endurance for negligible throughput and delay degradation.

Rodrigues, Hugo↗