SEARCH · Engineering Papers

Results for “cost function”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2023

A minimum assumption approach to MEG sensor array design

Objective. Our objective is to formulate the problem of the magnetoencephalographic (MEG) sensor array design as a well-posed engineering problem of accurately measuring the neuronal magnetic fields. This is in contrast to the traditional approach that formulates the sensor array design problem in terms of neurobiological interpretability the sensor array measurements. Approach. We use the vector spherical harmonics (VSH) formalism to define a figure-of-merit for an MEG sensor array. We start with an observation that, under certain reasonable assumptions, any array of m perfectly noiseless sensors will attain exactly the same performance, regardless of the sensors' locations and orientations (with the exception of a negligible set of singularly bad sensor configurations). We proceed to the conclusion that under the aforementioned assumptions, the only difference between different array configurations is the effect of (sensor) noise on their performance. We then propose a figure-of-merit that quantifies, with a single number, how much the sensor array in question amplifies the sensor noise. Main results. We derive a formula for intuitively meaningful, yet mathematically rigorous figure-of-merit that summarizes how desirable a particular sensor array design is. We demonstrate that this figure-of-merit is well-behaved enough to be used as a cost function for a general-purpose nonlinear optimization methods such as simulated annealing. We also show that sensor array configurations obtained by such optimizations exhibit properties that are typically expected of 'high-quality' MEG sensor arrays, e.g. high channel information capacity. Significance. Our work paves the way toward designing better MEG sensor arrays by isolating the engineering problem of measuring the neuromagnetic fields out of the bigger problem of studying brain function through neuromagnetic measurements.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

Muon track reconstruction in a segmented bolometric array using multi-objective optimization

Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless double-beta decay or direct dark matter detection, such experiments also have the capability to search for exotic particles that leave track-like signatures across their volume. However, the segmented nature of such detector arrays often sets the spatial resolution and makes the problem of reconstructing track-like paths non-trivial. Here, in this paper, we present an algorithm that improves reconstruction of track-like events in segmented detectors using multi-objective optimization — a computational technique that optimizes more than one cost function at a time without specifying a quantitative weighting between them. Such a technique allows the reconstruction of tracks through a detector and the determination of path-lengths through individual elements. When combined with the reconstructed energy depositions in each element this allows for a calculation of the stopping power of track-like particles and opens the door to searches for particles with abnormal stopping power like monopoles or lightly-ionizing particles (LIPs). Results are presented which evaluate the precision of the reconstruction tools as they currently stand against Monte Carlo generated data. The algorithm is presented in the context of the CUORE experiment, but has applications to other segmented calorimeter detectors.

47 OTHER INSTRUMENTATION↗

DOE OSTI2022

InClass nets: independent classifier networks for nonparametric estimation of conditional independence mixture models and unsupervised classification

Abstract Conditional independence mixture models (CIMMs) are an important class of statistical models used in many fields of science. We introduce a novel unsupervised machine learning technique called the independent classifier networks (InClass nets) technique for the nonparameteric estimation of CIMMs. InClass nets consist of multiple independent classifier neural networks (NNs), which are trained simultaneously using suitable cost functions. Leveraging the ability of NNs to handle high-dimensional data, the conditionally independent variates of the model are allowed to be individually high-dimensional, which is the main advantage of the proposed technique over existing non-machine-learning-based approaches. Two new theorems on the nonparametric identifiability of bivariate CIMMs are derived in the form of a necessary and a (different) sufficient condition for a bivariate CIMM to be identifiable. We use the InClass nets technique to perform CIMM estimation successfully for several examples. We provide a public implementation as a Python package called RainDancesVI.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

An adjoint-based optimization method for jointly inverting heterogeneous material properties and fault slip from earthquake surface deformation data

SUMMARY Analysis of tectonic and earthquake-cycle associated deformation of the crust can provide valuable insights into the underlying deformation processes including fault slip. How those processes are expressed at the surface depends on the lateral and depth variations of rock properties. The effect of such variations is often tested by forward models based on a priori geological or geophysical information. Here, we first develop a novel technique based on an open-source finite-element computational framework to invert geodetic constraints directly for heterogeneous media properties. We focus on the elastic, coseismic problem and seek to constrain variations in shear modulus and Poisson’s ratio, proxies for the effects of lithology and/or temperature and porous flow, respectively. The corresponding nonlinear inversion is implemented using adjoint-based optimization that efficiently reduces the cost function that includes the misfit between the calculated and observed displacements and a penalty term. We then extend our theoretical and numerical framework to simultaneously infer both heterogeneous Earth’s structure and fault slip from surface deformation. Based on a range of 2-D synthetic cases, we find that both model parameters can be satisfactorily estimated for the megathrust setting-inspired test problems considered. Within limits, this is the case even in the presence of noise and if the fault geometry is not perfectly known. Our method lays the foundation for a future reassessment of the information contained in increasingly data-rich settings, for example, geodetic GNSS constraints for large earthquakes such as the 2011 Tohoku-oki M9 event, or distributed deformation along plate boundaries as constrained from InSAR.

Geochemistry & Geophysics↗

DOE OSTI2022

Inference of bipolar neutrino flavor oscillations near a core-collapse supernova based on multiple measurements at Earth

Neutrinos in compact-object environments, such as core-collapse supernovae, can experience various kinds of collective effects in flavor space, engendered by neutrino-neutrino interactions. These include “bipolar” collective oscillations, which are exhibited by neutrino ensembles where different flavors dominate at different energies. Considering the importance of neutrinos in the dynamics and nucleosynthesis in these environments, it is desirable to ascertain whether an Earth-based detection could contain signatures of bipolar oscillations that occurred within a supernova envelope. To that end, we, in this study, continue examining a cost-function formulation of statistical data assimilation (SDA) to infer solutions to a small-scale model of neutrino flavor transformation. SDA is an inference paradigm designed to optimize a model with sparse data. Our model consists of two monoenergetic neutrino beams with different energies emanating from a source and coherently interacting with each other and with a matter background, with radially varying interaction strengths. We attempt to infer flavor transformation histories of these beams using simulated measurements of the flavor content at locations “in vacuum” (that is, far from the source), which could in principle correspond to Earth-based detectors. Within the scope of this small-scale model, we found that: (i) based on such measurements, the SDA procedure is able to infer whether bipolar oscillations had occurred within the protoneutron star envelope, and (ii) if the measurements sample the full amplitude of the neutrino oscillations in vacuum, then the amplitude of the prior bipolar oscillations is well predicted. This result intimates that the inference paradigm can well complement numerical integration codes, via its ability to infer flavor evolution at physically inaccessible locations.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Trainability of Dissipative Perceptron-Based Quantum Neural Networks

Several architectures have been proposed for quantum neural networks (QNNs), with the goal of efficiently performing machine learning tasks on quantum data. Rigorous scaling results are urgently needed for specific QNN constructions to understand which, if any, will be trainable at a large scale. Here, we analyze the gradient scaling (and hence the trainability) for a recently proposed architecture that we call dissipative QNNs (DQNNs), where the input qubits of each layer are discarded at the layer’s output. We find that DQNNs can exhibit barren plateaus, i.e., gradients that vanish exponentially in the number of qubits. Moreover, we provide quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths, and show that trainability is not always guaranteed. Here our work represents the first rigorous analysis of the scalability of a perceptron-based QNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗

DOE OSTI2023

Gradient-Descent-Based Learning Gain for Backstepping Controller and Disturbance Observer of Nonlinear Systems

This paper proposes a gradient-descent-based learning (GL) gain for backstepping controller and disturbance observer (DOB) of nonlinear system. The proposed method consists of the GL gain update law, controller, and DOB. The GL gain update law is proposed to adapt the control gain and DOB gain according to the direction that minimizes the cost function. The mathematical analysis reveals that the GL gain always has a positive sign and upper bound. The controller is designed via a backstepping procedure to track the desired output with GL control gain. The DOB is designed to estimate the unknown external disturbance with the GL DOB gain. Because the control and DOB gains are simultaneously tuned to achieve improved performance, the time consumption for tuning can be reduced. In addition, the peaking phenomenon can be avoided initially by a small initial value of GL gains. The stability of the closed-loop system is guaranteed using the input-to-state stability property. The performance of the proposed method was validated via simulations and experiments using a DC motor.

42 ENGINEERING↗

DOE OSTI2023

Model Predictive Control-Based Trajectory Shaper for Safe and Efficient Adaptive Cruise Control

Recent studies show that commercially-available adaptive cruise control (ACC) systems are string-unstable, indicating that ACC-driven vehicles amplify speed fluctuations from downstream traffic and induce stop-and-go waves. Moreover, it is challenging to revise the original control algorithm of an ACC system to achieve string stability due to its internal complexity and powertrain uncertainties. To achieve desired control performance given a string-unstable ACC system and circumvent revising the original control algorithm, this study proposes a model predictive control-based trajectory shaper (MPC-TS), which only modifies the sensor-measured trajectory information (i.e., position and speed) of the preceding vehicle. The proposed MPC-TS leverages the input shaping technique to generate reference trajectory to improve string stability, while incorporating tracking errors and vehicle acceleration/deceleration magnitude in the MPC cost function and constraining fluctuations of vehicle speed and spacing to ensure desired car-following performance. Numerical experiments validate the control performance of ACC with the proposed MPC-TS in terms of string stability, safety, traffic efficiency, and comfort.

Zhou, Anye↗

DOE OSTI2020

Provable Convergence of Plug-and-Play Priors With MMSE Denoisers

Plug-and-play priors (PnP) is a methodology for regularized image reconstruction that specifies the prior through an image denoiser. While PnP algorithms are well understood for denoisers performing maximum a posteriori probability (MAP) estimation, they have not been analyzed for the minimum mean squared error (MMSE) denoisers. Here we address this gap by establishing the first theoretical convergence result for the iterative shrinkage/thresholding algorithm (ISTA) variant of PnP for MMSE denoisers. We show that the iterates produced by PnP-ISTA with an MMSE denoiser converge to a stationary point of some global cost function. We validate our analysis on sparse signal recovery in compressive sensing by comparing two types of denoisers, namely the exact MMSE denoiser and the approximate MMSE denoiser obtained by training a deep neural net.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

A Scalable Meter Placement Method for Distribution System State Estimation

This paper studies the optimal meter placement problem for distribution system state estimation given limited measurement resources. We formulate the problem as a mixed integer semi-definite programming that minimizes the worst case estimation errors over a set of operating points. To solve the problem, we first relax the problem as a convex optimization problem. Motivated by the lack of scalability of existing solvers, we next leverage the special structure of the cost function and propose an algorithm based on barrier method that solves the problem with significantly better numerical performance. The proposed method has been validated on the IEEE 13-bus, IEEE 123-bus, and IEEE 8,500-bus feeders.

barrier method↗

DOE OSTI2022

Hybrid Quantum-Classical Neural Networks

Deep learning is one of the most successful and far-reaching strategies used in machine learning today. However, the scale and utility of neural networks is still greatly limited by the current hardware used to train them. These concerns have become increasingly pressing as conventional computers are soon expected to approach the physical limitations that will slow their performance improvements in the near future. For these reasons, scientists have begun to explore alternative computing platforms, like quantum computers, for training neural networks. In recent years, variational quantum circuits have emerged as one of the most successful approaches to quantum deep learning on noisy intermediate scale quantum devices. We propose a hybrid quantum-classical neural network architecture where each neuron is a variational quantum circuit. We empirically analyze the performance of this hybrid neural network on a series of binary classification data sets using a simulated IBM universal quantum computer and a state-of-the-art IBM universal quantum computer. On the simulated hardware, we observe that the hybrid neural network achieves around 10% higher classification accuracy and 20% better minimization of the cost function than an individual variational quantum circuit. On the quantum hardware, we observe that each model only performs well when the qubit and gate count is sufficiently small.

Arthur, Davis↗

DOE OSTI2021

Optimal Control of the Energy-Saving Hybrid Hydraulic-Electric Architecture (HHEA) for Off-Highway Mobile Machines

Most off-highway constructions and agriculture equipment use hydraulics, which has unmatched power density, for power transmission and throttling as a means for control. A novel hybrid hydraulic-electric architecture (HHEA) has recently been proposed to improve efficiency for high-power machines that would have been cost-prohibitive to electrify directly. HHEA uses a set of common pressure rails (CPRs) to transmit the majority of power hydraulically and small electric motor drives to modulate that power and to achieve precise control. This article proposes a computationally efficient Lagrange multiplier method (LMM) for computing the optimal sequence of pressure rail selections to minimize energy use. This is needed to evaluate HHEA's energy-saving potential and for iterative architecture design and sizing. An interesting complication is that the cost function is not fully defined until the candidate control sequence is fully specified. This issue is dealt with by decomposing the original problem into a set of sub-problems with additional constraints that can be solved efficiently. Computational effort can be further reduced if actuators are optimized individually instead of together. However, additional steps are required to prevent the constraint functions from becoming discontinuous with respect to the Lagrange multipliers, which is necessary for meeting the constraints. Lastly, a case study of a construction machine demonstrates the efficacy of the method and shows that the HHEA reduces energy consumption by 68%-73% compared to the baseline load-sensing architecture.

Lagrange multiplier↗

DOE OSTI2022

Enabling DER Participation in Frequency Regulation Markets

Distributed energy resources (DERs) are playing an increasing role in ancillary services for the bulk grid, particularly in frequency regulation. In this article, we propose a framework for collections of DERs, combined to form microgrids and controlled by aggregators, to participate in frequency regulation markets. Our approach covers both the identification of bids for the market clearing stage and the mechanisms for the real-time allocation of the regulation signal. The proposed framework is hierarchical, consisting of a top layer and a bottom layer. The top layer consists of the aggregators communicating in a distributed fashion to optimally disaggregate the regulation signal requested by the system operator. The bottom layer consists of the DERs inside each microgrid whose power levels are adjusted so that the tie line power matches the output of the corresponding aggregator in the top layer. The coordination at the top layer requires the knowledge of cost functions, ramp rates, and capacity bounds of the aggregators. We develop meaningful abstractions for these quantities respecting the power flow constraints and taking into account the load uncertainties and propose a provably correct distributed algorithm for optimal disaggregation of regulation signals among the microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Rethinking the Price Formation Problem–Part 1: Participant Incentives under Uncertainty

Operators of organized wholesale electricity markets attempt to form prices in such a way that the private incentives of market participants are consistent with a socially optimal commitment and dispatch schedule. In the U.S. context, several competing price formation schemes have been proposed to address the non-convex production cost functions characteristic of most generation technologies. Here, this paper considers how the design and analysis of price formation policies for non-convex markets are affected by the uncertainty inherent in electricity demand and supply. We argue that by excluding uncertainty, the analytical framework underlying existing policies mischaracterizes the incentives of market participants, leading to inefficient price formation and poor incentives for flexibility. We establish favorable theoretical properties of a new construct, ex ante convex hull pricing , and demonstrate the difference between this idealized benchmark and existing methods on a large-scale test system. Given increased operational uncertainty with a transition to wind and solar generation, distortions caused by poor incentives for flexibility are likely to grow without improved price formation in organized wholesale markets.

24 POWER TRANSMISSION AND DISTRIBUTION↗