Search NASA⌕ Search

SEARCH · Search NASA

Results for “architecture 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 91 records · Page 5

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗

A Parallel Trade Study Architecture for Design Optimization of Complex Systems

Design of a successful product requires evaluating many design alternatives in a limited design cycle time. This can be achieved through leveraging design space exploration tools and available computing resources on the network. This paper presents a parallel trade study architecture to integrate trade study clients and computing resources on a network using Web services. The parallel trade study solution is demonstrated to accelerate design of experiments, genetic algorithm optimization, and a cost as an independent variable (CAIV) study for a space system application.

Kim, Hongman↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Adaptive Cybersecurity for Distributed Energy Resources (AdCyDER): Online Reinforcement Learning with Stackelberg-Optimized Defenses — Pipeline Architecture, Evaluation Methodology, and Findings from a Synthetic-Data Evaluation

This report documents the design and evaluation of an integrated online-learning pipeline developed within the AdCyDER project for Distributed Energy Resource (DER) cybersecurity. The pipeline couples a Reinforcement Learning (RL) attack classifier — which produces an attack-type probability distribution — with a Stackelberg game-theoretic (GT) defense selector that consumes those distributions alongside SME-encoded priors over (defense, attack) effectiveness pairings and perdefense costs to choose grid-health-preserving defenses. The objective is not attack classification per se but production of distributions that drive effective defense selection through the Stackelberg layer, learned from delayed grid-health feedback rather than labeled attack data. AdCyDER as a whole is broader than the work presented here; this report covers the specific RL/GT loop integration and its evaluation. We present the integrated pipeline (SCADA telemetry with Fronius inverter physics, Suricata IDS, time-windowed aggregation, per-facility LSTM classifier, Stackelberg optimizer, OpenC2 actuators), an experimental campaign of 28 eight-hour iterations across three baseline modes, and a pipeline-ordered diagnostic protocol. The protocol identifies two distinct failure modes within the loop: paired supervised ceilings on the same features establish that the deployed online RL classifier (macro F1 ≈ 0.07) sits at least 4.7× below a same-architecture supervised LSTM (≈ 0.34) and 10–11× below a linear feature-signal ceiling (≈ 0.70–0.79 depending on per-facility isolation), localizing the dominant failure to the training procedure; and the reward signal driving online updates carries weak directional coupling with classifier correctness in the methodology-expected direction (multi-lens convergent: top-decile P(true) records produce more frequent state changes and slightly larger improvements, top-vs-bot Cohen’s 𝑑 ≈ −0.19), but at effect magnitudes too small to drive gradient-based learning at the campaign sample size. The original learning hypothesis is not supported by the data. The primary contributions are the diagnostic methodology — proposed as a transferable falsification protocol for online RL/GT defense pipelines learning from delayed environmental reward — and the open, reproducible experimental infrastructure. We outline reward reformulation as the highest-priority aspirational next step given the underpowered-but-aligned Q6 reading, with hardware-in-the-loop evaluation as the broadest scope-expansion option.

Blakely, Benjamin [Argonne National Laboratory (AN↗

Reification of latent microstructures: On supervised unsupervised and semi-supervised deep learning applications for microstructures in materials informatics

Machine learning (ML), including deep learning (DL), has become increasingly popular in the last few years due to its continually outstanding performance. In this context, we apply machine learning techniques to "learn" the microstructure using both supervised and unsupervised DL techniques. In particular, we focus (1) on the localization problem bridging (micro)structure (localized) property using supervised DL and (2) on the microstructure reconstruction problem in latent space using unsupervised DL. The goal of supervised and semi-supervised DL is to replace crystal plasticity finite element model (CPFEM) that maps from (micro)structure (localized) property, and implicitly the (micro)structure (homogenized) property relationships, while the goal of unsupervised DL is (1) to represent high-dimensional microstructure images in a non-linear low-dimensional manifold, and (2) to discover a way to interpolate microstructures via latent space associating with latent microstructure variables. At the heart of this report is the applications of several common DL architectures, including convolutional neural networks (CNN), autoencoder (AE), and generative adversarial network (GAN), to multiple microstructure datasets, and the quest of neural architecture search for optimal DL architectures.

36 MATERIALS SCIENCE↗

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

Comparative Investigation of System-Level Optimized Power Conversion System Architectures to Reduce LCOE for Large-Scale PV-Plus-Storage Farms

PV-plus-storage (PVS) has become a prevalent configuration for newly commissioned large-scale solar projects. However, the optimal power conversion system (PCS) architecture has not been investigated yet. This paper first validates the limited impact of inverter cost on LCOE and then explores a system-level optimized PCS architecture with extended LCOE reduction to proliferate large-scale dispatchable solar energy. Two state-of-the-art architectures including central inverters (CI), traditional 480/600 V string inverters (SI) are compared with newly proposed medium voltage string inverters (MVSI) and multiport DC transformer (MDCT). With verified layouts and single line diagrams (SLDs) of 20 MW PVS plants, the losses and costs breakdown of different architectures are extracted and the PCS related LCOEs are derived. In this analysis, all electrical bill of materials (EBOS) elements, inverters, battery storage and its associated components, are included, whose losses and costs are obtained from markets, manufacturers, and literature. Besides, the sensitivities of PCS-related LCOEs to Inverter-Loading-Ratio (ILR) are also investigated. Here, the results show that compared with CI and SI with 1.5 kV PV, 4 kV MVSI and 34 kV MDCT present an extended LCOE reduction across all ILR from 1.0 to 3.0, making them economically favorable candidates for PVS farms.

14 SOLAR ENERGY↗

Rocket Propellants Engine Design/Operations/Validation

Lockheed Martin Astronautics Operations (LMA) was competitively awarded a contract May 21, 2001 for next generation launch system architecture definition and technology maturation. The Second Generation Launch Vehicle Program objectives include reducing the technical and programmatic risk of proceeding to full scale development of the system by establishing requirements for the next generation launch system and maturing critical technologies needed by the system. LMA will conduct analyses and trades to optimize the architecture ETO elements including configuration, conceptual designs, and preliminary operations definition. To fully understand the engine and propellant trades were conducted by LMA to yield the optimized architecture system from the operability, reliability, safety, and cost perspectives. A government/industry team addressed the required trade studies, the parameters and weighting factors, and the most critical trades were addressed. This report summarizes the participation of JCM Consulting, Inc. in the propellant trade study.

Monk, Jan C.↗

OR-AGENT framework – Architecting electrified heavy-duty drayage applications

The widespread adoption of zero-emission vehicles in heavy-duty (HD) commercial freight transportation faces considerable technoeconomic challenges. For heavy-duty trucks, ensuring high uptime, cost parity with diesel, and safety standards is especially critical as these vehicles operate over long distances with heavy loads, where any downtime or off-nominal behaviors significantly impacts logistics, productivity, and the total cost of ownership. Unlike traditional diesel refueling, BEV charging infrastructure must be co-optimized with vehicle deployment, operational demands, and grid capacity to ensure cost-effective and reliable freight operations. However, the lack of a standardized ownership and service model has led to a fragmented approach—where commercial vehicle operators may invest in, own, and maintain both vehicle/batteries and charging/energy infrastructure. This disconnect may exclude energy service providers from the equation, forcing fleet operators to explore ‘behind-the-fence’ energy solutions that increase capital investment, operational downtime, overhead costs, and, in some cases, net carbon emissions. To address these issues, this study introduces OR-AGENT (Optimal Regional Architecture Generation for Efficient National Transport), a comprehensive modeling framework that integrates powertrain architectures, charging infrastructures, and energy backbone systems into a cohesive strategy. In this paper, OR-AGENT is applied to develop an interconnected systems architecture for energy efficiency and resiliency enhancement of heavy-duty drayage vehicles at the Port of Savannah, GA. This framework showcases an interconnected systems approach to electrifying heavy-duty drayage vehicles at the Port of Savannah, GA. The study assessed BEVs with 400–1200 kWh battery capacities, accounting for seasonal variations in weather and freight routing. A diverse charging mix (150 kW–1250 kW) was evaluated alongside grid capacity constraints, cost, and carbon intensity analysis, leading to the development of a strategic microgrid/Distributed Energy Resources (DER) deployment architecture to ensure a reliable and sustainable transition. However, the findings also highlight the need for alternative zero-emission solutions for remaining trips, such as larger batteries, electrified roadways, hydrogen powertrains, or net-zero emission fuels. In conclusion, the findings are incorporated into a Total Cost of Ownership (TCO) model to identify optimal architectures for an interconnected electrified ecosystem.

Commercial vehicles↗

A Classification of G -invariant Shallow Neural Networks

When trying to fit a deep neural network (DNN) to a G-invariant target function with G a group, it only makes sense to constrain the DNN to be G-invariant as well. However, there can be many different ways to do this, thus raising the problem of “G-invariant neural architecture design”: What is the optimal Ginvariant architecture for a given problem? Before we can consider the optimization problem itself, we must understand the search space, the architectures in it, and how they relate to one another. In this paper, we take a first step towards this goal; we prove a theorem that gives a classification of all G-invariant single-hidden-layer or “shallow” neural network (G-SNN) architectures with ReLU activation for any finite orthogonal group G, and we prove a second theorem that characterizes the inclusion maps or “network morphisms” between the architectures that can be leveraged during neural architecture search (NAS). The proof is based on a correspondence of every G-SNN to a signed permutation representation of G acting on the hidden neurons; the classification is equivalently given in terms of the first cohomology classes of G, thus admitting a topological interpretation. The G-SNN architectures corresponding to nontrivial cohomology classes have, to our knowledge, never been explicitly identified in the literature previously. Using a code implementation, we enumerate the G-SNN architectures for some example groups G and visualize their structure. Lastly, we prove that architectures corresponding to inequivalent cohomology classes coincide in function space only when their weight matrices are zero, and we discuss the implications of this for NAS.

Agrawal, Devanshu↗

Neural Architecture and Feature Search for Predicting the Ridership of Public Transportation Routes

Accurately predicting the ridership of public-transit routes provides substantial benefits to both transit agencies, who can dispatch additional vehicles proactively before the vehicles that serve a route become crowded, and to passengers, who can avoid crowded vehicles based on publicly available predictions. The spread of the coronavirus disease has further elevated the importance of ridership prediction as crowded vehicles now present not only an inconvenience but also a public-health risk. At the same time, accurately predicting ridership has become more challenging due to evolving ridership patterns, which may make all data except for the most recent records stale. One promising approach for improving prediction accuracy is to fine-tune the hyper-parameters of machine-learning models for each transit route based on the characteristics of the particular route, such as the number of records. However, manually designing a machine-learning model for each route is a labor-intensive process, which may require experts to spend a significant amount of their valuable time. To help experts with designing machine-learning models, we propose a neural-architecture and feature search approach, which optimizes the architecture and features of a deep neural network for predicting the ridership of a public-transit route. Our approach is based on a randomized local hyper-parameter search, which minimizes both prediction error as well as the complexity of the model. We evaluate our approach on real-world ridership data provided by the public transit agency of Chattanooga, TN, and we demonstrate that training neural networks whose architectures and features are optimized for each route provides significantly better performance than training neural networks whose architectures and features are generic.

Ayman, Afiya↗

Determination of an Optimal Commercial Data Bus Architecture for a Flight Data System

NASA/Marshall Space Flight Center (MSFC) is continually looking for methods to reduce cost and schedule while keeping the quality of work high. MSFC is NASA's lead center for space transportation and microgravity research. When supporting NASA's programs several decisions concerning the avionics system must be made. Usually many trade studies must be conducted to determine the best ways to meet the customer's requirements. When deciding the flight data system, one of the first trade studies normally conducted is the determination of the data bus architecture. The schedule, cost, reliability, and environments are some of the factors that are reviewed in the determination of the data bus architecture. Based on the studies, the data bus architecture could result in a proprietary data bus or a commercial data bus. The cost factor usually removes the proprietary data bus from consideration. The commercial data bus's range from Versa Module Eurocard (VME) to Compact PCI to STD 32 to PC 104. If cost, schedule and size are prime factors, VME is usually not considered. If the prime factors are cost, schedule, and size then Compact PCI, STD 32 and PC104 are the choices for the data bus architecture. MSFC's center director has funded a study from his discretionary fund to determine an optimal low cost commercial data bus architecture. The goal of the study is to functionally and environmentally test Compact PCI, STD 32 and PC 104 data bus architectures. This paper will summarize the results of the data bus architecture study.

Crawford, Kevin↗

SMT-Aware Instantaneous Footprint Optimization

Modern architectures employ simultaneous multithreading (SMT) to increase thread-level parallelism. SMT threads share many functional units and the whole memory hierarchy of a physical core. Without a careful code design, SMT threads can easily contend with each other for these shared resources, causing severe performance degradation. Minimizing SMT thread contention for HPC applications running on dedicated platforms is very challenging, because they usually spawn threads within Single Program Multiple Data (SPMD) models. To address this important issue, we introduce a simple scheme for SMT-aware code optimization, which aims to reduce the memory contention across SMT threads.

Instantaneous Footprint↗

An Ensemble Neural Network Model for Predicting Rare-Earth Oxide and Silicate Heat Capacities at High Temperature

In this work, a neural network model was developed to predict the constant pressure heat capacity for materials in the rare-earth oxide—silica material space. Several model architectures were trained and tested on heat capacity data generated from first-principles density functional theory calculations. Hyperparameter optimization was performed, and the optimal model was selected for heat capacity predictions. The optimal model architecture was found to have a root-mean-squared error of 5.12 ± 3.37 J/mol-K. The optimal model architecture was then used in a bagging ensemble model trained using the leave-one-group-out method to provide error estimates for model predictions. The out-of-bag score for the ensemble model was 0.997. The predicted heat capacities agree well with the DFT and experimental results and were computed orders of magnitude faster than DFT simulations. Machine learning shows the potential to provide a suitable surrogate model for thermochemical property predictions for candidate environmental barrier coating materials but refining of input material features and model architectures could further improve accuracy for these models.

environmental barrier coatings↗

ECLSS Does Not Exist in a Vacuum: Integrated Analysis is Necessary to Inform System Architecture Decisions

Environmental Control and Life Support System (ECLSS) architecture selection has profound implications for mission cost and mass extending far beyond the ECLSS itself. Similarly, other mission architecture decisions – particularly involving transportation systems – can influence optimal ECLSS architectures. Loop closure influences requirements for water, oxygen, and other consumables. System maintainability and reliability influences spares mass and risk. System, consumables, and spares mass interact with transportation system architectures and propellant demands and propulsion element sizing. All these interactions with other systems must be considered when evaluating ECLSS options. Analyses that focus only on maximizing ECLSS loop closure – or minimizing ECLSS mass, or minimizing ECLSS life cycle cost – may lead to sub-optimal or even counterproductive system architecture and investment decisions at the mission level. For example, an ECLSS architecture that minimizes ECLSS lifecycle cost but results in excessively high logistics mass could lead to significantly increased transportation system costs or make interplanetary transportation infeasible. Increased loop closure could result in higher development costs and higher mass if system/spares mass increases outweigh consumables reduction. In addition, systems mass and consumables mass are not directly comparable and have different impacts on propellant requirements, as consumables mass changes over the course of the mission. This paper presents an integrated analysis examining the overall impact of different ECLSS and transportation architectures on mass for a crewed Mars mission, including the habitat and transportation systems as well as consumables, spares, and propellant. Key observations are discussed, along with opportunities for further sensitivity analysis and model development. Overall, ECLSS development activities must consider their impacts at the mission level, as part of an integrated system, rather than in isolation.

Systems Analysis↗