Engineering Papers⌕ Search

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.

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

At least 73 records · Page 4

Multi-objective Eco-Routing Model Development and Evaluation for Battery Electric Vehicles.

This paper develops a multi-objective eco-routing algorithm (combined eco- and travel time-optimum routing) for battery electric vehicles (BEVs) and internal combustion engine vehicles (ICEVs) and investigates the network-wide impacts of the proposed multi-objective Nash optimum (user equilibrium) traffic assignment on a large-scale network. Eco-routing is a technique that finds the most energy efficient route. ICEV and BEV energy consumption patterns are significantly different with regard to their sensitivity to driving cycles. Unlike ICEVs, BEVs are more energy efficient on low-speed arterial trips compared to highway trips. Different energy consumption patterns require different eco-routing strategies for ICEVs and BEVs. This study found that single objective eco-routing could significantly reduce the energy consumption of BEVs but also significantly increase their average travel time. Consequently, the study developed a multi-objective routing model (eco- and travel time-routing) to improve both energy and travel time measures. The model introduced a link cost function that uses the specification of the value of time and the cost of fuel/energy. The simulation study found that multi-objective routing could reduce the BEV energy consumption by 13.5%, 14.2%, 12.9%, and 10.7%, as well as ICEV fuel consumption by 0.1%, 4.3%, 3.4%, and 10.6% for “not congested, “slightly congested,” “moderately congested,” and “highly congested” conditions, respectively. The study also found that multi-objective user equilibrium routing reduced the average vehicle travel time by up to 10.1% compared to the standard user equilibrium traffic assignment for highly congested conditions, producing a solution closer to the system optimum traffic assignment. The results indicate that the proposed multi-objective eco-routing strategy can reduce vehicle fuel/energy consumption effectively with minimum impacts on travel times for both BEVs and ICEVs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Cost- and Risk-Based Seismic Design Optimization of Nuclear Power Plant Safety Systems

Seismic analysis, design, and qualification of systems, structures, and components (SSCs) is a significant contributor to the capital cost of a nuclear power plant. To reduce capital costs of advanced nuclear power plants and make commercial nuclear energy more competitive, innovations are needed in their structural design and construction, and not just in the reactor core and associated systems. Seismic isolation has been identified as an important cost-cutting technology that enables standardization of equipment across various sites. This paper develops and demonstrates a cost- and risk-based seismic design optimization of a representative safety system in a nuclear power plant with the dual goals of minimizing overnight capital cost and meeting safety goals. The design optimization can also include component seismic isolation, in which case, the optimized design includes a set of equipment that needs to be seismically isolated to minimize capital cost. The open-source codes MASTODON and Dakota are used for seismic probabilistic risk assessment and design optimization, respectively. A generic nuclear facility with a safety system comprising SSCs that are common to nuclear power plants is considered for the demonstration of the design optimization and is assumed to be located at the Idaho National Laboratory site. Generic costs and seismic design cost functions are assumed for the SSCs of the safety system. The sum of the costs of the SSCs is minimized in the optimization process, while the risk of failure of the safety system is provided as a constraint. Furthermore, results show that the optimization process reduces capital costs significantly while automatically prioritizing the safety of SSCs that contribute most to the risk of the safety system.

42 ENGINEERING↗

Optimal control of large quantum systems: assessing memory and runtime performance of GRAPE

Abstract Gradient Ascent Pulse Engineering (GRAPE) is a popular technique in quantum optimal control, and can be combined with automatic differentiation (AD) to facilitate on-the-fly evaluation of cost-function gradients. We illustrate that the convenience of AD comes at a significant memory cost due to the cumulative storage of a large number of states and propagators. For quantum systems of increasing Hilbert space size, this imposes a significant bottleneck. We revisit the strategy of hard-coding gradients in a scheme that fully avoids propagator storage and significantly reduces memory requirements. Separately, we present improvements to numerical state propagation to enhance runtime performance. We benchmark runtime and memory usage and compare this approach to AD-based implementations, with a focus on pushing towards larger Hilbert space sizes. The results confirm that the AD-free approach facilitates the application of optimal control for large quantum systems which would otherwise be difficult to tackle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating and Optimizing Quantum State Transport

The goal of this project was to produce an accurate simulator of the “pitch and catch” process of sending quantum states between SRF cavities, and to find a method for optimizing the control pumps. We developed a program in C++ to integrate the equations of motion with high speed and precision, and used this as a basis for finding an optimal control function to maximize the state transfer efficiency. To demonstrate this we have shown an example of an optimal drive function and the resulting system dynamics, as well as a heat map of the cost function for a range of drive amplitudes.

Weston, Jacob↗

Multi‐objective optimization for cost‐efficient and resilient machining under tool wear

Abstract With the onset and rapid growth of smart manufacturing, there is a constant increase in the demand for automation technologies to enhance productivity while providing uninterrupted, cost‐efficient, and resilient machining. Traditional manufacturing systems, however, suffer from several losses due to machine faults and degradation. Specifically, tool wear directly impacts the precision and quality of the milled parts, which causes an increase in the scrap production. Hence, more attempts are required to meet the desired quota of successful parts, which in turn results in wasted material, longer delays, further tool degradation, and higher energy, machining, and labor costs. As such, this paper develops a multi‐objective optimization framework to generate the optimal control set points (e.g., feed rate and width of cut) that minimize the total cost of machining operations resulting from multiple contradictory cost functions (e.g., material, energy, tardiness, machining, labor, and tool) in the presence of tool wear. Notably, we estimate the total expected cost in dollars, which provides automatic and intuitive weighting in this multi‐objective formulation. The optimization framework is tested on a high‐fidelity face milling model that has been validated on real data from industry. Results show significant dollar savings of up to as compared to the default control scheme.

Wilson, James P.↗

Bayesian Monte Carlo Evaluation Framework for Imperfect Data and Models [Abstract]

Nuclear data evaluation methods conventionally make the following assumptions: prior and posterior probability distribution functions (PDFs) of all model parameters and data are normal (Gaussian); the linear approximation is sufficiently accurate for minimization of a cost function (even for non-linear models); and that both the model (of, e.g., neutron cross section) and experimental data (including their covariance data) are perfect. These assumptions are inherent to the well-known generalized linear least squares (GLLS) minimization method commonly used for evaluations of resolved resonance region (RRR) neutron cross sections. However, these assumptions are often not justified due to the presence of non-normal PDFs, non-linear models (e.g. R -matrix formalism), and inherent imperfections in data and models (e.g. discrepant data sets, discrepancies between the previous evaluation and newly measured data, or imperfect covariance data). We remove the said assumptions in a mathematical framework of Bayes’ theorem, and implement it using the Metropolis-Hastings Monte Carlo method. Parameters of a new kind are introduced to parameterize inherent imperfections, e.g. , any discrepancies between the theoretical model and measured data. These new parameters enable evaluators to quantify their expert judgement about any discrepancies or imperfections in a reproducible manner. We demonstrate the framework with an ongoing evaluation of 233 U in the eV region using the ENDF-B/VIII library and transmission data measured by Guber, et al. , and compare the posterior parameters to those obtained by conventional evaluation methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Classical Preoptimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications

The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work, we report the implementation and performance of ADAPT-VQE with our recently developed sparse wave function circuit solver (SWCS) in terms of accuracy and efficiency for molecular systems with up to 52 spin orbitals. The SWCS can be tuned to balance computational cost and accuracy, which extends the application of ADAPT-VQE for molecular electronic structure calculations to larger basis sets and a larger number of qubits. Using this tunable feature of the SWCS, we propose an alternative optimization procedure for ADAPT-VQE to reduce the computational cost of the optimization. Furthermore, by preoptimizing a quantum simulation with a parametrized ansatz generated with ADAPT-VQE/SWCS, we aim to utilize the power of classical high-performance computing in order to minimize the work required on noisy intermediate-scale quantum hardware, which offers a promising path toward demonstrating quantum advantage for chemical applications.

ADAPT-VQE↗

Phased: Phase-Aware Submodularity-Based Energy Disaggregation

Energy disaggregation is the task of discerning the energy consumption of individual appliances from aggregated measurements, which holds promise for understanding and reducing energy usage. In this paper, we propose PHASED, an optimization approach for energy disaggregation that has two key features: PHASED (i) exploits the structure of power distribution systems to make use of readily available measurements that are neglected by existing methods, and (ii) poses the problem as a minimization of a difference of sub-modular functions. We leverage this form by applying a discrete optimization variant of the majorization-minimization algorithm to iteratively minimize a sequence of global upper bounds of the cost function to obtain high-quality approximate solutions. PHASED improves the disaggregation accuracy of state-of-the-art models by up to 61% and achieves better prediction on heavy load appliances.

ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATION↗

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗

Reinforcement Learning for Volt- Var Control: A Novel Two-stage Progressive Training Strategy

This paper develops a reinforcement learning (RL) approach to solve a cooperative, multi-agent Volt-Var Control (VVC) problem for high solar penetration distribution systems. The ingenuity of our RL method lies in a novel two-stage progressive training strategy that can effectively improve training speed and convergence of the machine learning algorithm. In Stage 1 (individual training), while holding all the other agents inactive, we separately train each agent to obtain its own optimal VVC actions in the action space: fconsume, generate, do-nothingg. In Stage 2 (cooperative training), all agents are trained again coordinatively to share VVC responsibility. Rewards and costs in our RL scheme include (i) a system-level reward (for taking an action), (ii) an agent-level reward (for doing-nothing), and (iii) an agent-level action cost function. This new framework allows rewards to be dynamically allocated to each agent based on their contribution while accounting for the trade-off between control effectiveness and action cost. The proposed methodology is tested and validated in a modified IEEE 123-bus system using realistic PV and load profiles. Simulation results confirm that the proposed approach is robust and computationally efficient; and it achieves desirable volt-var control performance under a wide range of operation conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Unsupervised Learning for Equitable DER Control: Preprint

In the context of managing distributed energy resources (DERs) within distribution networks (DNs), this work focuses on the task of developing local controllers. We propose an unsupervised learning framework to train functions that can closely approximate optimal power flow (OPF) solutions. The primary aim is to establish specific conditions under which these learned functions can collectively guide the network towards desired configurations asymptotically, leveraging an incremental control approach. The flexibility of the proposed methodology allows to integrate fairness-driven components into the cost function associated with the OPF problem. This addition seeks to mitigate power curtailment disparities among DERs, thereby promoting equitable power injections across the network. To demonstrate the effectiveness of the proposed approach, power flow simulations are conducted using the IEEE 37-bus feeder. The findings not only showcase the guaranteed system stability but also underscore its improved overall performance.

asymptotic stability↗

Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?

Variational Quantum Algorithms (VQAs) are often viewed as the best hope for near-term quantum advantage. However, recent studies have shown that noise can severely limit the trainability of VQAs, e.g., by exponentially flattening the cost landscape and suppressing the magnitudes of cost gradients. Error Mitigation (EM) shows promise in reducing the impact of noise on near-term devices. Thus, it is natural to ask whether EM can improve the trainability of VQAs. In this work, we first show that, for a broad class of EM strategies, exponential cost concentration cannot be resolved without committing exponential resources elsewhere. This class of strategies includes as special cases Zero Noise Extrapolation, Virtual Distillation, Probabilistic Error Cancellation, and Clifford Data Regression. Second, we perform analytical and numerical analysis of these EM protocols, and we find that some of them (e.g., Virtual Distillation) can make it harder to resolve cost function values compared to running no EM at all. As a positive result, we do find numerical evidence that Clifford Data Regression (CDR) can aid the training process in certain settings where cost concentration is not too severe. Our results show that care should be taken in applying EM protocols as they can either worsen or not improve trainability. On the other hand, our positive results for CDR highlight the possibility of engineering error mitigation methods to improve trainability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Technoeconomic Design Optimization for Fast Reactors. Part II: Impact of Technoeconomic Constraints on Optimal Design

There is a current drive toward optimizing reactors, particularly small/micro reactors to minimize cost and maximize performance. Previous work has investigated the development of technoeconomic workflows for the design optimization of pool-type fast reactors that aim to deploy into district energy grids. Initial scoping studies verified that the workflow was capable of capturing design trends throughout a variety of design configurations and problem formulations while remaining sufficiently flexible. In this paper, this methodology is applied to understand how cost functions and technoeconomic constraints can drive optimal reactor design. Specifically, the UPu10Zr-fueled fast reactor model from Part I is adapted to include changes in the fissile content limits, control rod worth limits, control rod drive cost, and assumed fuel form. In the case of constraint relaxation at fixed power (fissile content and control rod worth limits), cost sensitivities of 5% to 10% were uncovered. Multi-objective optimization at varying reactor power levels with individualized control rod drives for each assembly (as opposed to one operational and one safety drive) increased cost by $\$10$ to $\$25$ million and substantially altered the optimal core geometry, favoring geometries with substantially fewer control rod placements relative to baseline optimization. Finally, a multi-objective optimization was performed at varying power levels with the fuel form overhauled to metallic, high-assay low-enriched uranium–based U10Zr with more refined fuel cost models. In the case of uranium fueling, the costs increased by at least $50 million relative to the baseline case. Furthermore, economic fuel zoning and lower reactivity swing cores were recovered. Each case serves to demonstrate the value of applying technoeconomic workflows to initial reactor design scoping studies to better understand the trade-off for a proposed concept between different design options.

Argonne Reactor Computation (ARC) codes↗

Feasible region-based heuristics for optimal transmission switching

In this paper, we develop a optimal transmission switching (OTS) heuristic based on DC optimal power flow (OPF) and assess the efficacy of the approach when implemented within AC OPF. Traditional formulations of the OTS problem can result in hundreds or thousands of binary variables for large networks, making the OTS problem challenging to solve on fast timescales even for relatively small networks. Here, we identify which constraints and therefore which variables are constraining the DC OPF feasible region, and rank them based on their impact on the cost function. We develop a heuristic algorithm which iteratively removes these constraints and solves a series of standard DC OPF problems. The heuristic is tested on a variety of PGlib networks and the results show that the algorithm can provide substantial cost decreases without having to solve any mixed integer programs. Additionally, we provide insights about the OTS problem, including identifying scenarios outside congestion where OTS can prove useful. Lastly, the performance of the DC-based heuristic is shown when the line switching decisions are implemented within AC OPF.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Equivalence of quantum barren plateaus to cost concentration and narrow gorges

Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers. However, very little is known about the cost function landscape for PQCs, which hinders progress towards quantum-aware optimizers. In this work, we investigate the connection between three different landscape features that have been observed for PQCs: (1) exponentially vanishing gradients (called barren plateaus (BPs)), (2) exponential cost concentration about the mean, and (3) the exponential narrowness of minima (called narrow gorges). Here we analytically prove that these three phenomena occur together, i.e., when one occurs then so do the other two. A key implication of this result is that one can numerically diagnose BPs via cost differences rather than via the computationally more expensive gradients. More broadly, our work shows that quantum mechanics rules out certain cost landscapes (which otherwise would be mathematically possible), and hence our results could be interesting from a quantum foundations perspective.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced Switching Frequency Finite Control Set Model Predictive Control (FCS-MPC) for DFIG

An enhanced Finite Control Set Model Predictive Control (FCS-MPC) strategy with a two-step prediction horizon for a Doubly-Fed Induction Generator (DFIG) is the focus of this paper. The DFIG and RL filter's discrete-time model is used in the proposed control scheme for a two-step prediction horizon of rotor and filter currents for the converter's eight possible switching states. Afterward, the control algorithm selects the ideal switching state, which minimizes currents' objective function. The proposed control scheme does not require a modulation stage for internal controllers. We use Lagrange extrapolations to predict the dynamic changes in currents. The switching frequency reduction is achieved by integrating an optimization constraint in the algorithm's cost function. Furthermore, the Total Harmonic Distortion level of currents is kept below 5%, according to IEEE Std 519-14. Obtained results reveal that the switching frequency of the DFIG converters is considerably reduced without losing control; it is reduced by 13.89KHz for the Grid Side Converter (GSC) and by 1.78KHz for the Rotor Side Converter (RSC).

doubly-fed induction generator↗

Efficient online quantum circuit learning with no upfront training

Optimization is a promising candidate for studying the utility of variational quantum algorithms (VQAs). However, evaluating cost functions using quantum hardware introduces runtime overheads that limit exploration. Surrogate-based methods can reduce calls to a quantum computer, yet existing approaches require hyperparameter pre-training and have been tested only on small problems. Here, we show that surrogate-based methods can enable successful optimization at scale, without pre-training, by using radial basis function interpolation (RBF) to construct an adaptive, hyperparameter-free surrogate. Using the surrogate as an acquisition function drives hardware queries to the vicinity of the true optima. For 16-qubit random 3-regular Max-Cut instances with the Quantum Approximate Optimization Algorithm (QAOA), our method outperforms state-of-the-art approaches, without considering their upfront training costs. Furthermore, we successfully optimize QAOA circuits for 127-qubit random Ising models on an IBM processor using 10 4 −10 5 measurements. Strong empirical performance demonstrates the promise of automated surrogate-based learning for large-scale VQA applications.

97 MATHEMATICS AND COMPUTING↗