Theory and Algorithms for PDE-Constrained Optimization under Uncertainty.
Abstract not provided.
SEARCH · Engineering Papers
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.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Heat transfer through windows accounts for a significant percentage of a building’s energy use and adds substantially to the peak cooling load of a home. Window attachment manufacturers currently offer motorized shading devices for certain product lines, but this automation is typically marketed as a convenience and security feature for the homeowner and often does not include energy optimized control algorithms or dynamic and responsive features. This paper describes the experimental results of testing the energy performance of high-efficiency, dynamically operated, cellular shades in Pacific Northwest National Laboratory’s (PNNL) Lab Homes. The results of both heating and cooling season experiments will be presented, where testing is designed to assess the whole home energy savings resulting from both the thermal insulating properties as well as the automated and dynamic control strategies of shading devices. Control schemes tested include common “connected home” strategies where controls are integrated and coordinated between the window shading device, building thermostats, and external sensors. The presentation will also include results from testing designed to examine the benefits (in terms of comfort, energy savings, and responsiveness) of coordinating the operation of cellular shades with HVAC as a demand-response measure. These experiments demonstrate that highly insulating, dynamic window coverings that are reliably controlled can dramatically reduce the heating and cooling energy associated with windows and should be considered an important component of any “smart” home design.
With the emergence of autonomous technology, shared autonomous vehicles (SAVs) will potentially be the prevalent transportation mode for urban mobility. On one hand, relying on SAV fleets can provide several operational benefits. On the other hand, SAVs can increase travel distance and add congestion due to unoccupied trips such as pickup and repositioning trips. One important aspect for a SAV fleet's success is to serve the incoming requests at reasonably low waiting time. This is achieved by an adequate fleet size that is spatially distributed thoughtfully so that incoming requests can be served by a nearby vehicle. Unfortunately, it is challenging to keep a satisfactory spatial distribution of vehicles due to imbalances in the origin and destination patterns of incoming requests. This paper focuses on the impact of SAV relocation on traveler wait times using a novel optimization-based algorithm for repositioning. POLARIS, an agent-based tool, is used for a case study of Bloomington, Illinois to quantify the benefits of allowing SAV repositioning. On average, the wait times were around 20% lower with repositioning for all adequate fleet sizes. SAVs were available more uniformly across the region's zones, and proportional to trip-making at different times of day. In addition, enabling repositioning led to a higher share of demands being served. These benefits, however, are achieved at the expense of 6% added vehicles miles traveled.
The devastating impact of extreme weather-related events is increasingly evident on power grids, especially on distribution grids. The severity of their potential impact calls for 1) developing a suitable resilience assessment framework to capture the system performance and 2) assessing relevant mitigative strategies to lessen the impact of such events. This paper proposes a framework to identify grid vulnerabilities using the energy-at-risk concept to select, disconnect and isolate grid portions due to a resilience event. The proposed framework mainly consists of two steps; i) processing the utility's available infrastructure, i.e., a network model, possible switching combinations, and outage information for those combinations, as a graph-based database, and ii) implementing a novel optimal switching algorithm leveraging database and grid simulated metrics. These switching actions are generated to implement load curtailment in a rolling manner during anticipated grid scarcity conditions. In this study, a test case is created using two taxonomy feeders and is simulated against an extreme temperature event, e.g., a long, relatively cold, and prolonged freeze peak, thereby creating stress on the grid. It is demonstrated that the proposed framework allows utilities to predict the energy-at-risk during such resilience events and design suitable outage management strategies.
Traditional verification of spent nuclear fuel (SNF) includes determination of initial enrichment, burnup and cool down time (IE, BU, CT). Along with neutron measurements, passive gamma assay provides important information for determining BU and CT. Other gamma-ray-based assay methods such as passive tomography and active delayed gamma offer the potential to measure the spatial distribution of fission products and the fissile isotopic concentration of the fuel, respectively. All fuel verification methods involving gamma-ray spectroscopy require that the spectrometers manage very high count rates while extracting the signatures of interest. PNNL has developed new digital filtering and analysis techniques to produce an ultra-high rate gamma-ray spectrometer from a standard coaxial high-purity germanium (HPGe) crystal. This 37% relative efficiency detector has been operated for SNF measurements at input count rates of 500-1300 kcps and throughput in excess of 150 kcps. Optimized filtering algorithms preserve the spectroscopic capability of the system even at these high rates. This paper will present the results of both passive and active SNF measurement performed with this system at PNNL. (authors)
We introduce a novel Proximal Policy Optimization (PPO) algorithm aimed at addressing the challenge of maintaining a uniform proton beam intensity delivery in the Muon to Electron Conversion Experiment (Mu2e) at Fermi National Accelerator Laboratory (Fermilab). Our primary objective is to regulate the spill process to ensure a consistent intensity profile, with the ultimate goal of creating an automated controller capable of providing real-time feedback and calibration of the Spill Regulation System (SRS) parameters on a millisecond timescale. We treat the Mu2e accelerator system as a Markov Decision Process suitable for Reinforcement Learning (RL), utilizing PPO to reduce bias and enhance training stability. A key innovation in our approach is the integration of a neuralized Proportional-Integral-Derivative (PID) controller into the policy function, resulting in a significant improvement in the Spill Duty Factor (SDF) by 13.6%, surpassing the performance of the current PID controller baseline by an additional 1.6%. This paper presents the preliminary offline results based on a differentiable simulator of the Mu2e accelerator. It paves the groundwork for real-time implementations and applications, representing a crucial step towards automated proton beam intensity control for the Mu2e experiment.
We perform a scaling and performance portability study of the particle-in-cell scheme for plasma physics applications through a set of mini-apps we name "Alpine", which can make use of exascale computing capabilities. The mini-apps are based on Independent Parallel Particle Layer, a framework that is designed around performance portable and dimension independent particles and fields. We benchmark the simulations with varying parameters such as grid resolutions (5123 to 20483) and number of simulation particles (109 to 1011) with the following mini-apps: weak and strong Landau damping, bump-on-tail and two-stream instabilities, and the dynamics of an electron bunch in a charge-neutral Penning trap. We show strong and weak scaling and analyze the performance of different components on several pre-exascale architectures such as Piz-Daint, Cori, Summit and Perlmutter. While the scaling and portability study helps identify the performance critical components of the particle-in-cell scheme in the current state-of-the-art computing architectures, the mini-apps by themselves can be used to develop new algorithms and optimize their high performance implementations targeting exascale architectures.
An increasing interest in high quality and high current electron beams necessitates a thorough understanding and prediction of coherent synchrotron radiation effects. The self-interaction of charged particles in a beam undergoing synchrotron motion is a physically significant process that is all too often computationally intensive with very little analytical results to rely on for the general case. The coherent spectrum of this interaction is of utmost importance to the design of free electron lasers (FELs) and an accurate assessment is imperative for their design. This work presents a novel implementation to the numerical simulation of charged particle beams. The simulation is a self-consistent approach including the self-fields generated by the beam of which coherent synchrotron radiation effects are of primary interest. A particle-in-cell model is used where a planar beam sampled by point particles is deposited on an encompassing grid at each timestep. The electromagnetic fields are calculated on the grid using the retarded potentials according to causality. The electromagnetic forces from the fields are interpolated on each particle which in turn advance in time. The simulation is benchmarked against well-established results for coherent synchrotron radiation effects. In addition, studies are provided that show the convergence of simulation results for increasing resolution. A study into the transverse beam size effects on beam dynamics is performed as well as a proof of concept where the simulation is used by a genetic algorithm to optimize the design parameters of a beam lattice. The results of these studies in tandem verify the efficacy of the simulation for its practical use in accelerator design or the study of synchrotron radiation effects
The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.
Modeling count data is important in physics and other scientific disciplines, where measurements often involve discrete, non-negative quantities such as photon or neutrino detection events. Traditional parametric approaches can be trained to generate integer-count predictions but may struggle with capturing complex, non-linear dependencies often observed in the data. Gaussian process (GP) regression provides a robust non-parametric alternative to modeling continuous data; however, it cannot generate integer outputs. We propose the Poisson Log-Normal (PoLoN) process, a framework that employs GP to model Poisson log-rates. As in GP regression, our approach relies on the correlations between data points captured via GP kernel structure rather than explicit functional parameterizations. We demonstrate that the PoLoN predictive distribution is Poisson-LogNormal and provide an algorithm for optimizing kernel hyperparameters. Furthermore, we adapt the PoLoN approach to the problem of detecting weak localized signals superimposed on a smoothly varying background - a task of considerable interest in many areas of science and engineering. Our framework allows us to predict the strength, location and width of the detected signals. We evaluate PoLoN's performance using both synthetic and real-world datasets, including the open dataset from CERN which was used to detect the Higgs boson at the Large Hadron Collider. Our results indicate that the PoLoN process can be used as a non-parametric alternative for analyzing, predicting, and extracting signals from integer-valued data.
We present algorithms for searching for azimuthally symmetric features in CMB data. Our algorithms are fully optimal for masked all-sky data with inhomogeneous noise, computationally fast, simple to implement, and make no approximations. We show how to implement the optimal analysis in both Bayesian and frequentist cases. In the Bayesian case, our algorithm for evaluating the posterior likelihood is so fast that we can do a brute-force search over parameter space, rather than using a Monte Carlo Markov chain. Our motivating example is searching for bubble collisions, a pre-inflationary signal which can be generated if multiple tunneling events occur in an eternally inflating spacetime, but our algorithms are general and should be useful in other contexts.
Community Microgrids are increasingly gaining popularity worldwide for their efficiency, cost-effectiveness, and local resilience improvement. Microgrid planning tools play a crucial role in their deployment. In the process, tentative designs of the microgrid are simulated, analyzed, and optimized. Due to the complexity of the problem, planning tools must carefully balance computational efficiency while seeking the most optimal solutions. This paper investigates the impact of algorithm selection on CPU and memory utilization of a Community Microgrid planning tool that is specifically designed for non-technical users. We compare two version of the code with two alternatives for Community Microgrid planning tools: a Greedy Algorithm, and a Linear Programming Approach. This comparison examines scenarios spanning from 2 to 50 buildings. Our findings revealed a significant difference in performance between the two algorithms, underscoring the critical role of algorithm selection in optimizing the efficiency of Community Microgrid Planning Tools.
Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.
For the nanostructured thin films, the study of surface physical parameters is often of crucial importance. For example, the transport properties of ZnO thin film are strongly affected by the geometry of this film. In this study sol—gel ZnO thin film was spin coated on glass substrate. The inverse problem of thin film characterization is formulated as a parameter identification problem in which a set of parameters corresponding to the thin film property can be found by minimizing fitness functions formulated using theoretical and experimental X-ray reflectivity. Atomic force microscopy (AFM) measurements used as an independent procedure for extracting structural parameters of the film and accurate interpretation of X-ray reflectivity data. After applying Fractal calculations on the AFM measured data the Genetic algorithm (GA) method was applied for extracting other important structural parameters. Optimization of specular X-ray reflectivity by GA method gives information along the depth such as thickness, roughness, and electron density profile of layers in the film.
An array of antennas is usually used in long distance communication. The observation of celestial objects necessitates a large array of antennas, such as the Giant Metrewave Radio Telescope (GMRT). Optimizing this kind of array is very important when observing a high performance system. The genetic algorithm (GA) is an optimization solution for these kinds of problems that reconfigures the position of antennas to increase the u-v coverage plane or decrease the sidelobe levels (SLLs). This paper presents how to optimize a correlator antenna array using the GA. A brief explanation about the GA and operators used in this paper (mutation and crossover) is provided. Then, the results of optimization are discussed. The results show that the GA provides efficient and optimum solutions among a pool of candidate solutions in order to achieve the desired array performance for the purposes of radio astronomy. The proposed algorithm is able to distribute the u-v plane more efficiently than GMRT with a more than 95% distribution ratio at snapshot, and to fill the u-v plane from a 20% to more than 68% filling ratio as the number of generations increases in the hour tracking observations. Finally, the algorithm is able to reduce the SLL to –21.75 dB.
Here, we introduce a hierarchical distributed algorithm to solve optimal power flow (OPF) problems that aim at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm highlights unprecedented scalability to large multi-phase distribution networks by jointly exploring the tree/subtrees structure of a large radial distribution network and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation loads compared to the centrally coordinated implementation of the same primal-dual algorithm without compromising optimality. Numerical findings on a 4,521-node test feeder show that the designed algorithm achieves more than 10-fold acceleration in the speed of convergence compared to the centrally coordinated primal-dual algorithm through reducing and distributing computational loads.