Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer controlled”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Multi-fidelity information fusion with concatenated neural networks

Recently, computational modeling has shifted towards the use of statistical inference, deep learning, and other data-driven modeling frameworks. Although this shift in modeling holds promise in many applications like design optimization and real-time control by lowering the computational burden, training deep learning models needs a huge amount of data. This big data is not always available for scientific problems and leads to poorly generalizable data-driven models. This gap can be furnished by leveraging information from physics-based models. Exploiting prior knowledge about the problem at hand, this study puts forth a physics-guided machine learning (PGML) approach to build more tailored, effective, and efficient surrogate models. For our analysis, without losing its generalizability and modularity, we focus on the development of predictive models for laminar and turbulent boundary layer flows. In particular, we combine the self-similarity solution and power-law velocity profile (low-fidelity models) with the noisy data obtained either from experiments or computational fluid dynamics simulations (high-fidelity models) through a concatenated neural network. We illustrate how the knowledge from these simplified models results in reducing uncertainties associated with deep learning models applied to boundary layer flow prediction problems. The proposed multi-fidelity information fusion framework produces physically consistent models that attempt to achieve better generalization than data-driven models obtained purely based on data. While we demonstrate our framework for a problem relevant to fluid mechanics, its workflow and principles can be adopted for many scientific problems where empirical, analytical, or simplified models are prevalent. In line with grand demands in novel PGML principles, this work builds a bridge between extensive physics-based theories and data-driven modeling paradigms and paves the way for using hybrid physics and machine learning modeling approaches for next-generation digital twin technologies.

42 ENGINEERING↗
DOE OSTI2020

Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses

Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus), and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state by the three algorithms, while NMplus converges fastest, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency, and DE shows the best robustness. Finally, this study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Sodium Void Worth and Control Rod Worth Measurements in ZPPR 15

Sodium void worth and control rod worth were measured in Phases A, B, C and D of the ZPPR15 experimental program. Sodium voiding was simulated by replacing stainless steel cans containing sodium by empty stainless steel cans of the same sizes. The control rod worth measurements were measurements of simulated control rods (CRs) and simulated empty control rod positions (CRPs). A CRP consisted of a 2 x 2 array of drawers filled with sodium plates. A CR consisted of a 2 x 2 array of drawers containing alternating columns of boron carbide plates and sodium plates in the front 18 inches and just sodium plates in the back 18 inches. The ZPPR staff published the measured sodium void worths and control rod worths and the statistical uncertainties in the measured values. In reality, the published uncertainty for each of these measurements is only one component of the total uncertainty. There are additional contributions from uncertainties related to measurement technique, plate compositions and reproducibility. However, the dominant uncertainty for the sodium void worth and control rod worth measurements is the uncertainty in βeff which is required to convert from the natural measurement units, cents, to the calculation units, pcm or Δ/k 1 k 2 . A full uncertainty analysis was performed for the sodium void worth and control rod worth measurements. The significant uncertainties were quantified, and a total uncertainty was derived for each sodium void worth or control rod worth measurement. The ZPPR-15 experimental records were used to create detailed as-built Monte Carlo models of the sodium void worth and control rod worth configurations. These models were used to compute the sodium void worths and control rod worths. (C/E – 1) and the related uncertainty in (C/E – 1) were derived for the measured worths.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Exploring transport-enabled gates with integrated optical addressing to demonstrate high fidelity control of trapped ion qubits in a scalable quantum computer

In recent years, experiments involving micofabricated surface ion traps have grown in complexity, and as this complexity grows, a common design has emerged in the form of quantum charge-coupled device architecture. This architecture, already utilized on multiple systems, supports multiple zones on a device for areas such as memory or computation. The shutting process between these zones is a process often seen to be minimized. An additional component to scalable surface trapped-ion experiments includes some form of integrated photonics, as free space lasers have difficulty scaling to many ions. Here, we discuss recent results in utilizing the shuttling process with integrated photonics to perform a specific type of gate, as well as demonstrating state preparation. Furthermore, we show that these gates can be utilized as a type of optical modulator as the Doppler shift that occurs during shuttling will make the light seen by shuttled ions different than that seen by stationary ions. Furthermore, we show that the shuttling operation can be utilized as an optical modulator, where the Doppler shift changes the frequency from that of a stationary ion.

42 ENGINEERING↗
DOE OSTI2025

Syncopated dynamical decoupling to suppress crosstalk in quantum circuits

Theoretically understanding and experimentally characterizing and modifying the underlying Hamiltonian of a quantum system is of utmost importance in achieving high-fidelity quantum gates for quantum computing. Here, in this work, we explore the use of dynamical decoupling (DD) in characterizing and suppressing undesired two-qubit couplings as well as the underlying single-qubit decoherence, both significant hurdles to achieving precise quantum control and realizing quantum computing on many hardware prototypes. Through discrete search of DD sequences, we identify sequences that protect against decoherence and selectively target unwanted two-qubit interactions of general form. On a transmon-qubit-based superconducting quantum device, we identify separate white and 1/𝑓 noise components underlying the single-qubit decoherence and a static ZZ coupling between pairs of qubits. A family of syncopated DD sequences is found and their efficiency is demonstrated in two-qubit benchmarking experiments. The syncopated decoupling technique significantly boosts performance in a realistic algorithmic quantum circuit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗
DOE OSTI2022

EVSE Cybersecurity and Resilience

Consequence-driven Cybersecurity Analysis for Extreme Fast Charging Electric Vehicle Infrastructure Electric vehicle (EV) development and associated charging infrastructure are expected to advance rapidly. Thirty percent of all global vehicle sales may be EVs and hybrid EVs by 2025, and they will rely on increasingly sophisticated strategies for grid integration. Next-generation EV charging infrastructure is expected to include interconnected renewable resources, such as photovoltaic (PV) arrays and battery storage systems, along with grid-edge devices. Although distributed energy resources (DERs) are useful in several ways, such as peak shaving at high demand times and backup supply for added resilience, the integration of vehicle charging and DERs could create more avenues for cyberattack. Physical and/or remote access to EV charging station components, including charge ports, power electronics, controllers, and local generation (e.g., PV and energy storage) could be paths to cause power fluctuations, leading to altered operations at the charging station, escalated privileges to administrative systems, exfiltration of financial information (including personally identifiable information), and reduced grid stability. One compromised EV supply equipment component can open the door to a variety of exploitable vulnerabilities. Cloud computing and mobile application control have the potential to expand the threat surface to non-repudiation and firmware integrity challenges. Vendor clouds have access to hundreds of chargers, and if compromised, can scale the attack surface exponentially. The high power and voltage levels of xFC infrastructure (e.g., 400 kW at 1000- V DC) increase the hazards and ability to impact the grid and vehicles more than lower-power charging systems. Legacy communications systems and protocols could also put EV infrastructure at risk of cyberattacks requiring a robust patch management process. Communications networks link EVs and chargers to several stakeholders - including charging station operators, grid operators, vendors/manufacturers, and aggregators - who have both physical and network access to share information for control, monitoring, and analytics. Information in these networks that is vulnerable to compromise includes the state of charge, charging duration, payment information, electricity price, and load control. Analyzing and prioritizing these interconnections risks could help address cybersecurity related to data leakage and manipulation.

charging↗
DOE OSTI2024

Privacy-Preserving Control of Partitioned Energy Resources

Distributed energy resources are an increasingly important part of the electric grid. We examine the problem of partitioning a distributed energy resource among many users while providing privacy to them. In this model, clients can send requests to a server, the server can verify that the requests are valid and aggregate them, but it cannot see the actual values in the requests. Without privacy, each user is forced to reveal their daily schedule or energy use. Energy resources add a novel challenge that prior systems do not address: they require verifying limits on private power (a rate over time) and energy (a sum) values. Furthermore, the cryptographic mechanisms must run on embedded energy control systems. We describe Weft, a novel cryptographic system that verifies both power (rate) and energy (integral) constraints on private client values and aggregates them. The key insight behind the approach is to rely on additively homomorphic secret shares, which allows servers to compute sums from rates. We present 3 cryptographic proof systems with different system trade-off for embedded systems: bit-splitting proofs minimize memory use, sorting proofs minimize computation, and commitment proofs minimize network communication. Using bit-splitting proofs, it takes an IoT client using a CortexM microcontroller 4 minutes of compute time to privately control its share of an energy resource for a day at 20s granularity.

Laufer, Evan↗
DOE OSTI2020

Multi-Agent Control of Lane-Switching Automated Vehicles for Energy Efficiency

The proliferation of automatic control systems and their connectivity accents the performance of their interactions. In particular, connected and automated vehicles could become high-impact examples thanks to their energy use and productivity effects. Ideally, a controller might collectively optimize all agents' control moves for a given objective. However, limits on computational complexity, incomplete knowledge of the central planner, and risks of a single point of failure make distributed control attractive as well. This paper proposes a collaborative heuristic to approach the performance of centralized control with decentralized-like computational effort. The related centralized controller is also described in detail and evaluated as a baseline. A collaboration-intensive obstacle avoidance scenario involving electric vehicles is simulated to demonstrate benefits over fully decentralized control. While centralized optimization performed best with an 8.6 % energy reduction, the collaborative decentralized scheme reached a favorable computation-performance tradeoff with a 6.7 % energy reduction.

Dollar, R. Austin↗
DOE OSTI2023

Integrated End-to-end Performance Prediction and Diagnosis for Extreme Scientific Workflows

This report details recent progress for the ASCR funded project “Integrated End-to-end Performance Prediction and Diagnosis for Extreme Scientific Workflows”. We refer to the project as IPPD/2, reflecting the 2017 renewal under expanded scope and partners In IPPD/2, we increased our research scope to include data motion. We are focusing on three major aspects: a) observe how data is generated, distributed, and used; b) analyze how data is (repeatedly) consumed with a focus both on repeated patterns and anomalies; and c) explore how to optimize data motion. This new work on data motion will augment and complement IPPD/2’s research that focused on the computational aspects of tasks. We leverage and extend our existing tools and demonstrate our work on the Belle II workflow suite as well as on workflows from NSLS-II. The highlights of our work are as follows: Provenance for Workflows: Provenance is used to provide information enabling quality control, re-run computational workflows, and reproduce results. IPPD/2 has been building a scalable provenance management system that enables the capture of provenance from the high-level workflow through all relevant system levels in one integrated environment. Leveraging this work, our recent efforts have included using provenance as an enabling technique. Workload characterization: Leveraging provenance and analysis, we characterize data movement within network, storage, and memory over a variety of workloads. This characterization enables an understanding by performance analysts and application developers of the range of behaviors that could be expected. Performance Prediction for Workflows: The goal of modeling distributed workflows is to understand performance bottlenecks and enable more intelligent task scheduling to optimize selected metrics of interest (e.g., task throughput or output data rate). IPPD/2 has utilized both analytical and AI/ML modeling methodologies for performance modeling. Advanced Scheduling and Fault Modeling for Workflows: Scheduling of large-scale scientific workflows on geographically distributed resources is a challenging problem. To improve workflow throughput, we combined novel scheduling algorithms with task predictions from performance modeling and fault modeling. Dynamically Alleviating Bottlenecks in Workflows: Exploiting our provenance, analysis, and modeling efforts, we have explored and developed several techniques for dynamically detecting and alleviating bottlenecks in data movement. In particular, we have spent considerable effort demonstrating our techniques on production-like workflow configurations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Moving-horizon false data injection attack design against cyber–physical systems

Systematic attack design is essential to understanding the vulnerabilities of cyber–physical systems (CPSs), to better design for resiliency. In particular, false data injection attacks (FDIAs) are well-known and have been shown to be capable of bypassing bad data detection (BDD) while causing targeted biases in resulting state estimates. However, their effectiveness against moving horizon estimators (MHE) is not well understood. In fact, this paper shows that conventional FDIAs are generally ineffective against MHE. One of the main reasons is that the moving window renders the static FDIA recursively infeasible. Here, this paper proposes a new attack methodology, moving-horizon FDIA (MH-FDIA), by considering both the performance of historical attacks and the current system’s status. Theoretical guarantees for successful attack generation and recursive feasibility are given. Numerical simulations on the IEEE-14 bus system further validate the theoretical claims and show that the proposed MH-FDIA outperforms state-of-the-art counterparts in both stealthiness and effectiveness. In addition, an experiment on a path-tracking control system of an autonomous vehicle shows the feasibility of the MH-FDIA in real-world nonlinear systems.

42 ENGINEERING↗
DOE OSTI2020

Single-ion addressing via trap potential modulation in global optical fields

To date, individual addressing of ion qubits has relied primarily on local Rabi or transition frequency differences between ions created via electromagnetic field spatial gradients or via ion transport operations. Alternatively, it is possible to synthesize arbitrary local one-qubit gates by leveraging local phase differences in a global driving field. Here we report individual addressing of 40 Ca + ions in a two-ion crystal using axial potential modulation in a global gate laser field. We characterize the resulting gate performance via one-qubit randomized benchmarking, applying different random sequences to each co-trapped ion. We identify the primary error sources and compare the results with single-ion experiments to better understand our experimental limitations. These experiments form a foundation for the universal control of two ions, confined in the same potential well, with a single gate laser beam.

quantum computing↗
DOE OSTI2023

Cost-constrained adaptive simulations of transient spray combustion in a gas turbine combustor

Predictive high-fidelity simulations of turbulent spray combustion must capture the combined effects of complex chemistry, multiphase evaporating flow and spray-flame interactions to achieve physical accuracy. Finite-rate chemistry (FRC) combined with a realistic chemical mechanism is a combustion model well-suited for this purpose, but has a high computational cost due to the large number and stiffness of transported chemical species. In contrast, flamelet-based models achieve lower cost by transporting a small number of quantities of reduced stiffness, but assumptions regarding local flame topology, boundary conditions and inter-phase coupling limit their physical accuracy. Recently, the Pareto-efficient combustion (PEC) framework was developed to dynamically assign combustion models based on local cost and accuracy metrics in gas-phase reacting flows. In this work, we extend this PEC framework to spray combustion through the rigorous analysis of the multiphase coupling terms in the governing equations. The derivation shows that spray evaporation causes errors in the prediction of species mass fractions for flamelet-based models due to the sensitivity of the local thermo-chemical state to changes in composition caused by fuel vaporization across combustion regimes present in practical spray combustion devices. Sub-model assignment is formulated as a multiple-choice knapsack problem, where computational cost is directly controlled through the fraction of the domain assigned to the FRC sub-model. The extended PEC formulation is applied to the simulation of a realistic rich-quench-lean gas turbine combustor at steady-state conditions, as well as transient operation resulting in lean blow-out (LBO). Analysis of transient simulations during LBO demonstrates the extended PEC formulation’s capacity to dynamically adapt to changing conditions within the combustor. Transient combustor dynamics are shown to approach convergence with limited increases in computational cost, while retaining substantial computational cost reduction compared to monolithic FRC simulations. Through PEC simulations with increasing fractions of the domain assigned to FRC, monolithic flamelet simulations are shown to over-predict flame stability during LBO. Finally, the extended PEC formulation is thus shown to overcome deficiencies of monolithic models by controlling modeling error for multiphase combustion modeling.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Adaptive Urban Traffic Signal Control for Multiple Intersections: An LQR Approach

Traffic congestion leads to severe problems especially in urban traffic networks. It increases the chance of accidents, energy waste, and social costs. In order to address these problems, an adaptive linear quadratic regulator (LQR) approach is developed for traffic signal control at multiple intersections in an urban area. The proposed method controls the green time of the traffic signals to reduce traffic congestion and smooth traffic flow. Real-world data from vision-based traffic sensors are used to build the traffic network model, which mimics the real-world traffic behavior. In addition, the proposed control utilizes recursive least square parameter estimation, which is capable of tracking dynamic changes in traffic conditions. Simulation of Urban MObility (SUMO) is used to analyze the efficacy of the proposed method. Results of the simulation show that the proposed method outperforms pretimed control in various aspects.

adaptive LQR control↗
DOE OSTI2021

Distributed deep reinforcement learning for simulation control

Abstract Several applications in the scientific simulation of physical systems can be formulated as control/optimization problems. The computational models for such systems generally contain hyperparameters, which control solution fidelity and computational expense. The tuning of these parameters is non-trivial and the general approach is to manually ‘spot-check’ for good combinations. This is because optimal hyperparameter configuration search becomes intractable when the parameter space is large and when they may vary dynamically. To address this issue, we present a framework based on deep reinforcement learning (RL) to train a deep neural network agent that controls a model solve by varying parameters dynamically. First, we validate our RL framework for the problem of controlling chaos in chaotic systems by dynamically changing the parameters of the system. Subsequently, we illustrate the capabilities of our framework for accelerating the convergence of a steady-state computational fluid dynamics solver by automatically adjusting the relaxation factors of the discretized Navier–Stokes equations during run-time. The results indicate that the run-time control of the relaxation factors by the learned policy leads to a significant reduction in the number of iterations for convergence compared to the random selection of the relaxation factors. Our results point to potential benefits for learning adaptive hyperparameter learning strategies across different geometries and boundary conditions with implications for reduced computational campaign expenses 4 4 Data and codes available at https://github.com/Romit-Maulik/PAR-RL . .

42 ENGINEERING↗