User preference optimization for oversubscribed scheduling of NASA's Deep Space Network
UNKNOWN
SEARCH · Search NASA
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.
UNKNOWN
No abstract provided
Explore the source record for details and available documents.
Explore the source record for details and available documents.
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.
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.
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.
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.
The conversion of carbon dioxide (CO 2 ) into jet fuel holds significant potential for reducing CO 2 emissions, providing an alternative to carbon-based resources, and offering a renewable means of energy storage. The objective of this study is to conduct a techno-economic analysis and optimize the supply chain network for converting CO 2 to jet fuel in the United States, aiming to minimize total costs while assessing the environmental and economic feasibility of two CO 2 conversion pathways. This first pathway is based on Fischer-Tropsch synthesis (FTS), and the other one is based on the valorization and upgrading of light methanol (MeOH). Incorporating spatial and techno-economic data, a mixed-integer linear programming model was developed to select source plants and conversion pathways, locations of conversion refinery sites, and the amount of captured CO 2 across the United States. The optimal results indicate that the FTS pathway is adopted at all selected refineries when the hydrogen price is 1000 dollars/t and the operating cost, mainly electricity used in conversion, is reduced to 5 % of its current level. Under this scenario, the total annual profit is 8 billion dollars, and the net carbon emissions are -88,783,284 tons. The sensitivity analyses reveal that the prices of electricity and hydrogen significantly contribute to total production costs. The CO 2 recycle percentage of the FTS pathway influences the choice of applied pathways at refineries. Additionally, a higher conversion rate holds a substantial promise for reducing the total production cost and can make the MeOH pathway a viable choice.
A simulation processor generates and stores a simulation model based on conditions associated with a physical structure, such as a building. A neural network processor implements a neural network, having an input layer coupled to receive sensor data from the structure and having an output layer coupled to supply control signals to the at least one electrically operable environmental control device. The neural network is trained using the simulation model. A particle swarm optimization processor programmed to receive the simulation results and perform particle swarm optimization, ascertains optimal parameters for controlling the at least one electrically operable environmental control device and supplies these optimal parameters to the neural network processor. The neural network processor uses the optimal parameters supplied by the particle swarm optimization processor to further train the neural network.
5G advancements like Massive Multiple Input Multiple Output (MIMO) bring high capacity and low latency, but also intensify interference challenges. Static and dynamic coordination techniques address this, often at the cost of increased power draw. We introduce Cookie-Jar (CJ), an interference coordination (IC) framework using reinforcement learning for multi-goal optimization. By dynamically adjusting network, power, and topology parameters based on real-time conditions, CJ improves Signal to Noise and Interference Ratio (SINR) while minimizing power consumption. Simulated 5G experiments showcase CJ's potential, achieving a 15% SINR improvement with near-identical power draw compared to existing methods.
Photosynthetic organisms have recently gained considerable attention for a role in development of renewable energy sources. Genome-enabled systems biology methods, coupled with functional and synthetic genomics, present opportunities to develop sustainable and economical applications such as fuel production within the next 10 to 15 years. However, optimization of light-driven metabolism for biomass or biofuel production will require a detailed systems biology understanding of photosynthetic processes and cellular metabolism. Genome-scale metabolic models (GEMs) are at the core of systems analysis of cellular processes and form a common organizational framework for analyses of data resulting from functional genomics experimental work and computational studies. Therefore, there is a clear demand for high quality photosynthetic model organisms and the appropriate computational tools that enable systems analysis of light-driven metabolism. Through research conducted we expanded the currently available repertoire of photosynthetic GEMs to include the commercially valuable model diatom Phaeoctylum tricornutum. Diatoms have a peculiar and distinct evolutionary footprint and represent a major eukaryotic lineage that is taxonomically and functionally distinct from green and red algae and vascular plants. Therefore, the true potential for light-driven metabolism aimed at biofuel production remains poorly understood at a systems level for a large subset of the global diversity of photosynthetic organisms. The metabolic capabilities of P. tricornutum were comparatively modeled with those from other photosynthetic groups in order to elucidate the occurrence of metabolic traits within and between phototrophs. Additionally, this research resulted in significant extension of the COnstraints Based Reconstruction and Analysis (COBRA) Toolbox to accommodate the crucial need for infrastructure required for ‘omics data integration and analysis in the context of genome-scale models. Therefore, the proposed research achieved two important goals. First, within the broad scope of photosynthetic organisms, we functionally compared and, as a result, identified cellular processes that require optimization in order to enable deployment as biofuel feedstock. Second, the proposed research resulted in development of key computational infrastructure, which can be further extended to other biological systems, that is currently lacking but necessary for multiple ‘omics data integration.
The increasing penetration of renewable and distributed energy resources in distribution networks calls for real-time and distributed voltage control. As such, in this paper we investigate local Volt/VAR control with a general class of control functions, and show that the power system dynamics with non-incremental local voltage control can be seen as a distributed algorithm for solving a well-defined optimization problem (reverse engineering). The reverse engineering further reveals a fundamental limitation of the non-incremental voltage control: the convergence condition is restrictive and prevents better voltage regulation at equilibrium. This motivates us to design two incremental local voltage control schemes based on the subgradient and pseudo-gradient algorithms respectively for solving the same optimization problem (forward engineering). The new control schemes decouple the dynamical property from the equilibrium property, and have much less restrictive convergence conditions. This work presents another step towards developing a new foundation—network dynamics as optimization algorithms—for distributed real-time control and optimization of future power networks.
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 the design of 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.
This project addresses the impact of emerging technologies on inter-city freight energy demand, shipping time, and cost. Technologies addressed include electrified long-haul trucks, connectivity and efficient operations, and platooning. The research questions are addressed using national level analysis, a multi-modal inter-city freight energy model, and development of a Freight Mobility Energy Productivity (F-MEP) metric. This project improves on national level analysis and modeling completed in prior fiscal years by disaggregating freight flows both geographically and temporally and incorporating both energy and cost in the modeling framework. The inter-city freight energy model uses a bi-level optimization approach to minimize total network cost (lower level) and energy (upper level). Two new F-MEP frameworks are presented, one for intra-city freight mobility and one for inter-city freight mobility.
Protecting inverter-interfaced microgrids is challenging as conventional time-overcurrent protection becomes unusable due to the lack of fault current. There is a great need for novel protective relaying methods that enable the application of protection coordination on microgrids, thereby allowing for microgrids with larger areas and numbers of loads while not compromising reliable power delivery. Tools for modeling and analyzing such microgrids under fault conditions are necessary in order to help design such protective relaying and operate microgrids in a configuration that can be protected, though there is currently a lack of tools applicable to inverter-interfaced microgrids. This paper introduces the concept of applying an optimization problem formulation to the topic of inverter-interfaced microgrid fault modeling, and discusses how it can be employed both for simulating short-circuits and as a set of constraints for optimal microgrid operation to ensure protective device coordination.
We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.
Quantum optimal control (QOC) enables the realization of accurate operations, such as quantum gates, and supports the development of quantum technologies. To date, many QOC frameworks have been developed, but those remain only naturally suited to optimize a single targeted operation at a time. Here, we extend this concept to optimal control with a continuous family of targets, and demonstrate that an optimization based on neural networks can find families of time-dependent Hamiltonians realizing desired classes of quantum gates in minimal time.