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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
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↗
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↗
DOE OSTI2018

A Comparison of Neuromorphic Classification Tasks

A variety of neural network models and machine learning techniques have arisen over the past decade, and their successes with image classification have been stunning. With other classification tasks, selecting and configuring a neural network solution is not straightforward. In this paper, we evaluate and compare a variety of neural network models, trained by a variety of machine learning techniques, on a variety of classification tasks. While Deep Learning typically exhibits the best classification accuracy, we note the promise of Reservoir Computing, and evolutionary optimization on spiking neural networks. In many cases, these technologies perform as well as, or better than Deep Learning, and the resulting networks are much smaller than their Deep Learning counterparts.

Reynolds, John↗
DOE OSTI2024

Factorized visual representations in the primate visual system and deep neural networks

Object classification has been proposed as a principal objective of the primate ventral visual stream and has been used as an optimization target for deep neural network models (DNNs) of the visual system. However, visual brain areas represent many different types of information, and optimizing for classification of object identity alone does not constrain how other information may be encoded in visual representations. Information about different scene parameters may be discarded altogether (‘invariance’), represented in non-interfering subspaces of population activity (‘factorization’) or encoded in an entangled fashion. In this work, we provide evidence that factorization is a normative principle of biological visual representations. In the monkey ventral visual hierarchy, we found that factorization of object pose and background information from object identity increased in higher-level regions and strongly contributed to improving object identity decoding performance. We then conducted a large-scale analysis of factorization of individual scene parameters – lighting, background, camera viewpoint, and object pose – in a diverse library of DNN models of the visual system. Models which best matched neural, fMRI, and behavioral data from both monkeys and humans across 12 datasets tended to be those which factorized scene parameters most strongly. Notably, invariance to these parameters was not as consistently associated with matches to neural and behavioral data, suggesting that maintaining non-class information in factorized activity subspaces is often preferred to dropping it altogether. Thus, we propose that factorization of visual scene information is a widely used strategy in brains and DNN models thereof.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Trustworthiness modeling and evaluation for a nearly autonomous management and control system

The Nearly Autonomous Management and Control (NAMAC) system supports the advanced reactor operation by recommending control actions to operators based on real-time measurements and digital twins (DTs) learning from the knowledge base. To enable the safe and reliable use of autonomous technologies, NAMAC and its recommendations should be trustworthy to operators and regulators at both the design and operation stages. This study proposes a NAMAC trustworthiness modeling and evaluation framework supported by trustworthiness ontologies and evidence-based approaches. The development-time and run-time ontologies are separately constructed and then converted to Bayesian networks to quantitatively evaluate the NAMAC trustworthiness. This evaluation is demonstrated by collecting and characterizing evidence from NAMAC practices, such as the development and assessment of the NAMAC system, data coverage assessment, and the training and optimizations of neural-network-based DTs. Our proposed approach can aggregate various trustworthiness attributes of complex artificial-intelligence-supported systems for safety-critical applications. It also considers the interaction between different DTs and extends beyond the trustworthiness evaluation of a single DT. In conclusion, the evidence-based method enhances the transparency of the trustworthiness modeling and evaluation processes and helps identify uncertainties and subjectivity involved in the processes.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Fracture Characterization Via AI‐Assisted Analysis of Temperature Logs

Abstract Fractures control fluid flow, mass transport, and heat transfer in a geothermal reservoir. This makes accurate characterization of fracture networks a prerequisite for optimal design and control of a reservoir's exploitation. We develop a deep‐learning procedure to identify fracture locations via interpretation of temporally and spatially continuous downhole temperature measurements. A long short‐term memory fully convolutional network (LSTM‐FCN) is used both to capture long‐term dependencies in sequential temperature data and to distill local features around fractures. A wellbore and fractured‐reservoir thermal model is established to generate temperature data for network training. The trained LSTM‐FCN exhibits a unique ability to detect multiple fractures intersecting a borehole. We use the LSTM‐FCN algorithm to evaluate the effectiveness of different‐stage wellbore temperature measurements on fracture detection in a complex fractured system. Our experiments reveal that the use of various‐stage temperature information as an input feature set improves the robustness of fracture detection to noise interference. This study indicates the practical feasibility of obtaining accurate fracture‐network reconstructions from temperature signals, at reasonable computational cost.

Yang, Xiaoyu↗
DOE OSTI2017

Distributed Optimal Dispatch of Distributed Energy Resources Over Lossy Communication Networks

In this paper, we consider the economic dispatch problem (EDP), where a cost function that is assumed to be strictly convex is assigned to each of distributed energy resources (DERs), over packet dropping networks. The goal of a standard EDP is to minimize the total generation cost while meeting total demand and satisfying individual generator output limit. We propose a distributed algorithm for solving the EDP over networks. The proposed algorithm is resilient against packet drops over communication links. Under the assumption that the underlying communication network is strongly connected with a positive probability and the packet drops are independent and identically distributed (i.i.d.), we show that the proposed algorithm is able to solve the EDP. Numerical simulation results are used to validate and illustrate the main results of the paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach

Training an effective deep learning model to learn ocean processes involves careful choices of various hyperparameters. We leverage DeepHyper’s advanced search algorithms for multiobjective optimization, streamlining the development of neural networks tailored for ocean modeling. The focus is on optimizing Fourier neural operators (FNOs), a data-driven model capable of simulating complex ocean behaviors. Selecting the correct model and tuning the hyperparameters are challenging tasks, requiring much effort to ensure model accuracy. DeepHyper allows efficient exploration of hyperparameters associated with data preprocessing, FNO architecture-related hyperparameters, and various model training strategies. We aim to obtain an optimal set of hyperparameters leading to the most performant model. Moreover, on top of the commonly used mean squared error for model training, we propose adopting the negative anomaly correlation coefficient as the additional loss term to improve model performance and investigate the potential trade-off between the two terms. The numerical experiments show that the optimal set of hyperparameters enhanced model performance in single timestepping forecasting and greatly exceeded the baseline configuration in the autoregressive rollout for long-horizon forecasting up to 30 days. Utilizing DeepHyper, we demonstrate an approach to enhance the use of FNO in ocean dynamics forecasting, offering a scalable solution with improved precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

End-to-end optimization for battery materials and molecules by combining graph neural networks and reinforcement learning

The National Renewable Energy Laboratory (NREL), together with the Colorado School of Mines (CSM) and Colorado State University (CSU), has developed a machine learning-enhanced approach to design new battery materials. Currently, such materials are designed in part via numerous expensive high-fidelity computational simulations that predict the performance of a given composition. Even with computational screening tools, the vast landscape of possible molecular or crystal structures exceeds current and future computational capacity. Improving the efficiency by which new materials can be optimized will therefore disrupt the cost, risk, and time required to bring new energy solutions to the marketplace. Predicting the properties of an organic molecule or periodic crystalline material given its structure has grown increasingly common. These approaches leverage large-scale computational and experimental databases and ML approaches such as graph neural networks. The inverse design problem of finding a material that possesses desired properties is substantially more challenging, since enumerating all valid material structures is not feasible. In this project, we leveraged recent success in reinforcement learning to efficiently navigate this high-dimensional search space. Just as algorithms can find the optimal chess moves from nearly limitless options, we train an approach to evolve a simple starting structure into a complex structure that possess the desired properties. Our solution has been demonstrated by applying it to two related design application tasks for short- and long-term energy storage, respectively: (1) the design of solid-state ion conductors and (2) the design of organic redox-active materials. The project has resulted an open-source software library for material design, documented examples of applying the library to both organic and inorganic material optimization, and peer-reviewed publications detailing the data, computational models, and resulting candidate materials.

25 ENERGY STORAGE↗
DOE OSTI2021

A framework for integrated dispatching and charging management of an autonomous electric vehicle ride-hailing fleet

The convergence of electrification and automated driving will introduce opportunities to improve the operation and energy-efficiency of transportation systems. This paper discusses the challenges of dispatching autonomous electric vehicles (AEVs) in a ride-hailing fleet and their interactions with charging infrastructure. An integrated decision-making framework for dispatching and charging has been proposed using system optimization approaches. An agent-based platform has been developed for simulating and testing the proposed methods. A case study using New York City taxi data has been performed with different fleet sizes, dispatching strategies, and charging networks. Advantages of optimization-based approaches for AEV fleet management have been studied and demonstrated, for example, for a fleet of 1,750 AEVs to meet 100,000 daily requests, optimization-based centralized fleet management would result in 14% more ride requests satisfied and 43% fewer zero-occupancy miles traveled than if AEVs make independent decisions based on heuristic strategy. Benefits on reducing fleet size and charging downtime from optimization approaches are also comprehensively illustrated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Quantitative Representativeness and Constituency of the Long-Term Agroecosystem Research Network and Analysis of Complementarity with Existing Ecological Networks

Abstract Studies conducted at sites across ecological research networks usually strive to scale their results to larger areas, trying to reach conclusions that are valid throughout larger enclosing regions. Network representativeness and constituency can show how well conditions at sampling locations represent conditions also found elsewhere and can be used to help scale-up results over larger regions. Multivariate statistical methods have been used to design networks and select sites that optimize regional representation, thereby maximizing the value of datasets and research. However, in networks created from already established sites, an immediate challenge is to understand how well existing sites represent the range of environments in the whole area of interest. We performed an analysis to show how well sites in the USDA Long-Term Agroecosystem Research (LTAR) Network represent all agricultural working lands within the conterminous United States (CONUS). Our analysis of 18 LTAR sites, based on 15 climatic and edaphic characteristics, produced maps of representativeness and constituency. Representativeness of the LTAR sites was quantified through an exhaustive pairwise Euclidean distance calculation in multivariate space, between the locations of experiments within each LTAR site and every 1 km cell across the CONUS. Network representativeness is from the perspective of all CONUS locations, but we also considered the perspective from each LTAR site. For every LTAR site, we identified the region that is best represented by that particular site—its constituency—as the set of 1 km grid locations best represented by the environmental drivers at that particular LTAR site. Representativeness shows how well the combination of characteristics at each CONUS location was represented by the LTAR sites’ environments, while constituency shows which LTAR site was the closest match for each location. LTAR representativeness was good across most of the CONUS. Representativeness for croplands was higher than for grazinglands, probably because croplands have more specific environmental criteria. Constituencies resemble ecoregions but have their environmental conditions “centered” on those at particular existing LTAR sites. Constituency of LTAR sites can be used to prioritize the locations of experimental research at or even within particular sites, or to identify the extents that can likely be included when generalizing knowledge across larger regions of the CONUS. Sites with a large constituency have generalist environments, while those with smaller constituency areas have more specialized environmental combinations. These “specialist” sites are the best representatives for smaller, more unusual areas. The potential of sharing complementary sites from the Long-Term Ecological Research (LTER) Network and the National Ecological Observatory Network (NEON) to boost representativeness was also explored. LTAR network representativeness would benefit from borrowing several NEON sites and the Sevilleta LTER site. Later network additions must include such specialist sites that are targeted to represent unique missing environments. While this analysis exhaustively considered principal environmental characteristics related to production on working lands, we did not consider the focal agronomic systems under study, or their socio-economic context.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗