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

Charge-Based Droop Control Addressing Control Saturation for Low-Inertia Converters

With bulky dc-link capacitors/inductors, traditional voltage-source converters (VSCs) and current-source converters (CSCs) feature a large inertia to facilitate the converter control under large transients. To achieve high power density with reduced cost, low-inertia converters (LICs) featuring significantly reduced dc-link capacitors/inductors have attracted growing attention. However, without bulky dc-link energy buffer, LICs are prone to control saturation under large transients, resulting in undesired oscillation and instability. This issue cannot be managed by traditional proportional-integral based control due to the low inertia. And it will deteriorate when several LICs are connected in series. To address this challenge in LICs, a model-predictive control (MPC) with a computation-inexpensive feed-forward compensation method has been proposed to provide fast dynamic responses. But it would suffer control saturation under larger transients that degrades the control performance. In this article, a charge-based droop control (CDC) is proposed to address this remaining challenge. This paper firstly analyzes the control saturation challenge in LICs by using a tri-port soft-switching solid-state transformer as an example. Next, the operating principle of the proposed CDC are introduced. Two different implementation approaches are discussed in detail. Lastly, the proposed scheme is validated in simulation with a high-fidelity model of hardware prototype. As a result, the proposed CDC eliminated the 2 kHz oscillation and reduced the dc-link ripple and overshoot due to control saturation by 75% and 50%, respectively.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2025

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Machine learning for arbitrary single-qubit rotations on an embedded device

Here, in this study, we present a technique for using machine learning (ML) for single-qubit gate synthesis on field-programmable logic for a superconducting transmon-based quantum computer based on simulated studies. Our approach is multi-stage. We first “bootstrap” a model based on simulation with access to the full state vector for measuring gate fidelity. We next present an algorithm, named adapted randomized benchmarking (ARB), for fine-tuning the gate on hardware based on measurements of the devices. We also present techniques for deploying the model on programmable devices with care to reduce the required resources. While the techniques here are applied to a transmon-based computer, many of them are portable to other architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

The CLAS12 Data Acquisition System

The CLAS12 Data Acquisition System was designed and built as part of the CLAS12 detector project in Hall B at Jefferson Laboratory. This article contains a full description of the system, including requirements, design, hardware, and software descriptions, as well as the achieved performance. The associated computing, network, and slow controls systems are also described.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

The infinite level normal forms for non-resonant double Hopf singularities

Here, in this paper, we explore hypernormal forms of vector fields that have non-resonant double Hopf singularities with a non-zero radial cubic part. Our primary focus is on investigating the infinite-level normal form classification of this type of singularities. We provide a normal form decomposition in terms of planar-rotating and planar-radial vector fields, which greatly facilitate the pattern recognition and analysis of the corresponding generalized homological maps. Notably, our paper represents the first instance of the normal form classification for general non-resonant double Hopf singularities without structural symmetry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Variational actor-critic algorithms,

We introduce a class of variational actor-critic algorithms based on a variational formulation over both the value function and the policy. The objective function of the variational formulation consists of two parts: one for maximizing the value function and the other for minimizing the Bellman residual. Besides the vanilla gradient descent with both the value function and the policy updates, we propose two variants, the clipping method and the flipping method, in order to speed up the convergence. We also prove that, when the prefactor of the Bellman residual is sufficiently large, the fixed point of the algorithm is close to the optimal policy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Mean-field limit of a hybrid system for multi-lane multi-class traffic

This article aims to study coupled mean-field equation and ODEs with discrete events motivated by vehicular traffic flow. Precisely, multi-lane traffic flow in presence of human-driven and autonomous vehicles is considered, with autonomous vehicles possibly influenced by external policymakers. First, a finite-dimensional hybrid system is developed based on the continuous Bando-Follow-the-Leader dynamics coupled with discrete events due to lane-change maneuvers. Then the mean-field limit of the finite-dimensional hybrid system is rigorously derived for the dynamics of the human-driven vehicles. The microscopic lane-change maneuvers of the human-driven vehicles generate a source term for the mean-field PDE. This leads to an infinite-dimensional hybrid system described by coupled Vlasov-type PDE, ODEs, and discrete events.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Theory of edge localized mode suppression by static resonant magnetic perturbations in the DIII-D tokamak

According to a recent paper [Hu et al ., Phys. Plasmas 26, 120702 (2019)], mode penetration at the top of the pedestal is a necessary and sufficient condition for the suppression of edge localized modes (ELMs) by a resonant magnetic perturbation (RMPs) in an H-mode tokamak discharge. This paper employs asymptotic matching theory to model a particular DIII-D discharge in which ELMs were suppressed by an externally generated, static, n ¼ 2, RMP whose amplitude was modulated at a frequency of 1 Hz. It is demonstrated that the response of the plasma to the applied RMP, in the immediate vicinities of the rational (i.e., resonant) surfaces, is governed by nonlinear, rather than by linear, physics. This is the case because the magnetic island widths associated with driven reconnection exceed the linear layer widths, even in cases where driven reconnection is strongly suppressed by plasma rotation. The natural frequency at a given rational surface (i.e., the helical frequency at which the locally resonant component of the RMP would need to propagate in order to maximize driven reconnection) is found to be offset from the local E B frame in the ion diamagnetic direction. The size of the offset is mostly determined by neoclassical poloidal rotation. Finally, the predictions of a fully nonlinear plasma response model are found to be broadly consistent with the DIII-D experimental data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Prevention of resistive wall tearing mode major disruptions with feedback

Resistive wall tearing modes (RWTMs) can cause major disruptions. A signature of RWTMs is that the rational surface is sufficiently close to the wall to interact with it. For (m,n) = (2,1) modes, a RWTM requires normalized minor radius of the rational surface ρ q2 ≥ 0.75, which can also be expressed as q 75 ≤ 2. Major disruptions can occur when the criterion is satisfied. This is confirmed in simulations and theory and in a DIII-D locked mode disruption database. The q 75 < 2 criterion is valid at high β as well as at low β. A very important feature of RWTMs is that they can be feedback stabilized. If the ρ q2 criterion is not satisfied, or if the wall is ideally conducting, then the mode does not produce a major disruption, although it can produce a minor disruption. Feedback, or rotation of the mode at the wall by complex feedback, can emulate an ideal wall, preventing major disruptions. The ρ q2 criterion depends weakly on the wall radius. A simple geometric model of its dependence on wall radius is given.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Frontiers in computing for artificial intelligence

An emerging diversity of computational platforms offers many different approaches to adopting the paradigm of artificial intelligence to the study of electron-ion collisions. Here we review several leading candidates in this computational frontier and their workflows for experimental applications of artificial intelligence that may impact the future Electron-Ion Collider. We discuss the motivation for exploring novel methods to solve artificial intelligence and machine learning problems including with customized devices, quantum simulation, and heterogeneous computing systems. Furthermore, these technologies offer promising approaches to address some of the leading concerns of future computing that may impact the Electron-Ion Collider but they will require further development and testing in order to support future planning efforts.

detector design and construction technologies and ↗
DOE OSTI2025

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗
DOE OSTI2020

Improving qubit readout with hidden Markov models

We demonstrate the application of pattern recognition algorithms via hidden Markov models (HMM) for qubit readout. This scheme provides a state-path trajectory approach capable of detecting qubit-state transitions and makes for a robust classification scheme with higher starting-state assignment fidelity than when compared to a multivariate Gaussian or a support vector machine scheme. Therefore, the method also eliminates the qubit-dependent readout time optimization requirement in current schemes. Using a HMM state discriminator we estimate fidelities reaching the ideal limit. Unsupervised learning gives access to transition matrix, priors, and IQ distributions, providing a toolbox for studying qubit-state dynamics during strong projective readout.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Feasibility study of quantum computing using trapped electrons

In this study, we investigate the feasibility of using electrons in a linear Paul trap as qubits in a future quantum computer. We discuss the necessary experimental steps to realize such a device through a concrete design proposal, including trapping, cooling, electronic detection, spin readout, and single- and multiqubit gate operations. Numeric simulations indicate that two-qubit Bell-state fidelities of order 99.99% can be achieved assuming reasonable experimental parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗