Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributionally robust optimization”

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

Strategic Planning with Unscented Optimal Guidance for Urban Air Mobility

This study proposes a strategic trajectory planning framework to support development of Urban Air Mobility (UAM) traffic networks and optimization of UAM aircraft trajectories that are robust to uncertain wind fields. The development of UAM traffic networks considers static aviation constraints and dynamic weather constraints in urban airspace and the connections to ground transportation networks for preliminary selection of feasible time-optimal routes. The trajectory optimization of UAM aircraft utilizes an unscented optimal guidance approach to generate cost-optimal trajectories constrained on the selected sigma values of probability distribution of uncertain wind fields while ensuring that the end-point constraints are met for reducing wind-induced trajectory uncertainty. Unscented guidance commands are assessed based on trajectory perturbations at subsequent end-points in various wind fields by conducting Monte Carlo simulations.An example of wind-optimal UAM corridor and the associated trajectory-based operation volume is created utilizing the perturbations of the unscented trajectories for preliminary assessment of required aircraft separation minima without knowledge of aircraft navigation performance.

Strategic Planning↗

Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

Robust Design Under Uncertainty in Quantum Error Mitigation

Error mitigation techniques are crucial to achieving near-term quantum advantage. Classical postprocessing of quantum computation outcomes is a popular approach for error mitigation, which includes methods, such as zero noise extrapolation, virtual distillation, and learning-based error mitigation. However, these techniques have limitations due to the propagation of uncertainty resulting from the finite shot number of a quantum measurement. In this work, we introduce general and unbiased methods for quantifying the uncertainty and error of error-mitigated observables based on the strategic sampling of error mitigation outcomes. We then extend our approach to demonstrate the optimization of performance and robustness of error mitigation under uncertainty. To illustrate our methods, we apply them to zero noise extrapolation and Clifford date regression in the ground state of the XY model simulated using depolarizing and International Business Machines Corporation (IBM) Toronto noise models, respectively. In particular, we optimize the choice of noise levels and the allocation of shots for zero noise extrapolation and the distribution of the training circuits for Clifford data regression. While our methods are readily applicable to any postprocessing-based error mitigation approach, in practice they must not be prohibitively expensive—even though they perform optimizations of the error mitigation hyperparameters requiring sampling of a statistical distribution of error mitigation outcomes. By leveraging surrogate-based optimization, we show that our methods can efficiently perform optimal design for a zero noise extrapolation implementation. We then further demonstrate the transferability of learned zero noise extrapolation hyperparameters to other similar circuits.

97 MATHEMATICS AND COMPUTING↗

The dosimetric impact of inversely optimized arc radiotherapy plan modulation for real-time dynamic MLC tracking delivery

Purpose: Real-time dynamic multileaf collimator (MLC) tracking for management of intrafraction tumor motion can be challenging for highly modulated beams, as the leaves need to travel far to adjust for target motion perpendicular to the leaf travel direction. The plan modulation can be reduced by using a leaf position constraint (LPC) that reduces the difference in the position of adjacent MLC leaves in the plan. The purpose of this study was to investigate the impact of the LPC on the quality of inversely optimized arc radiotherapy plans and the effect of the MLC motion pattern on the dosimetric accuracy of MLC tracking delivery. Specifically, the possibility of predicting the accuracy of MLC tracking delivery based on the plan modulation was investigated. Methods: Inversely optimized arc radiotherapy plans were created on CT-data of three lung cancer patients. For each case, five plans with a single 358 deg. arc were generated with LPC priorities of 0 (no LPC), 0.25, 0.5, 0.75, and 1 (highest possible LPC), respectively. All the plans had a prescribed dose of 2 Gy x 30, used 6 MV, a maximum dose rate of 600 MU/min and a collimator angle of 45 deg. or 315 deg. To quantify the plan modulation, an average adjacent leaf distance (ALD) was calculated by averaging the mean adjacent leaf distance for each control point. The linear relationship between the plan quality [i.e., the calculated dose distributions and the number of monitor units (MU)] and the LPC was investigated, and the linear regression coefficient as well as a two tailed confidence level of 95% was used in the evaluation. The effect of the plan modulation on the performance of MLC tracking was tested by delivering the plans to a cylindrical diode array phantom moving with sinusoidal motion in the superior-inferior direction with a peak-to-peak displacement of 2 cm and a cycle time of 6 s. The delivery was adjusted to the target motion using MLC tracking, guided in real-time by an infrared optical system. The dosimetric results were evaluated using gamma index evaluation with static target measurements as reference. Results: The plan quality parameters did not depend significantly on the LPC (p {>=} 0.066), whereas the ALD depended significantly on the LPC (p < 0.001). The gamma index failure rate depended significantly on the ALD, weighted to the percentage of the beam delivered in each control point of the plan (ALD{sub w}) when MLC tracking was used (p < 0.001), but not for delivery without MLC tracking (p {>=} 0.342). The gamma index failure rate with the criteria of 2% and 2 mm was decreased from > 33.9% without MLC tracking to <31.4% (LPC 0) and <2.2% (LPC 1) with MLC tracking. Conclusions: The results indicate that the dosimetric robustness of MLC tracking delivery of an inversely optimized arc radiotherapy plan can be improved by incorporating leaf position constraints in the objective function without otherwise affecting the plan quality. The dosimetric robustness may be estimated prior to delivery by evaluating the ALD{sub w} of the plan.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Effects of phase and coupling between the vibrational modes on selective excitation in coherent anti-Stokes Raman scattering microscopy

Coherent anti-Stokes Raman scattering (CARS) microscopy has been a major tool of investigation of biological structures as it contains the vibrational signature of molecules. A quantum control method based on chirped pulse adiabatic passage was recently proposed for selective excitation of a predetermined vibrational mode in CARS microscopy [Malinovskaya and Malinovsky, Opt. Lett. 32, 707 (2007)]. The method utilizes the chirp sign variation at the peak pulse amplitude and gives a robust adiabatic excitation of the desired vibrational mode. Using this method, we investigate the impact of coupling between vibrational modes in molecules on controllability of excitation of the CARS signal. We analyze two models of two coupled two-level systems (TLSs) having slightly different transitional frequencies. The first model, featuring degenerate ground states of the TLSs, gives robust adiabatic excitation and maximum coherence in the resonant TLS for positive value of the chirp. In the second model, implying nondegenerate ground states in the TLSs, a population distribution is observed in both TLSs, resulting in a lack of selectivity of excitation and low coherence. It is shown that the relative phase and coupling between the TLSs play an important role in optimizing coherence in the desired vibrational mode and suppressing unwanted transitions in CARS microscopy.

74 ATOMIC AND MOLECULAR PHYSICS↗

Aerodynamic Shape Optimization Using Hybridized Differential Evolution

An aerodynamic shape optimization method that uses an evolutionary algorithm known at Differential Evolution (DE) in conjunction with various hybridization strategies is described. DE is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Various hybridization strategies for DE are explored, including the use of neural networks as well as traditional local search methods. A Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the hybrid DE optimizer. The method is implemented on distributed parallel computers so that new designs can be obtained within reasonable turnaround times. Results are presented for the inverse design of a turbine airfoil from a modern jet engine. (The final paper will include at least one other aerodynamic design application). The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated.

Madavan, Nateri K.↗

Automatically Finding the Control Variables for Complex System Behavior

Testing large-scale systems is expensive in terms of both time and money. Running simulations early in the process is a proven method of finding the design faults likely to lead to critical system failures, but determining the exact cause of those errors is still time-consuming and requires access to a limited number of domain experts. It is desirable to find an automated method that explores the large number of combinations and is able to isolate likely fault points. Treatment learning is a subset of minimal contrast-set learning that, rather than classifying data into distinct categories, focuses on finding the unique factors that lead to a particular classification. That is, they find the smallest change to the data that causes the largest change in the class distribution. These treatments, when imposed, are able to identify the factors most likely to cause a mission-critical failure. The goal of this research is to comparatively assess treatment learning against state-of-the-art numerical optimization techniques. To achieve this, this paper benchmarks the TAR3 and TAR4.1 treatment learners against optimization techniques across three complex systems, including two projects from the Robust Software Engineering (RSE) group within the National Aeronautics and Space Administration (NASA) Ames Research Center. The results clearly show that treatment learning is both faster and more accurate than traditional optimization methods.

Gay, Gregory↗

Peer-to-Peer Communication Trade-Offs for Smart Grid Applications: Preprint

Peer-to-peer energy management systems for smart grids require developers to consider the trade-offs between the amount of communication traffic generated and the quality and speed of convergence of the control algorithms that are deployed. Employing a fully connected communication causes messages to scale exponentially with the number of nodes, while using a sparse connectivity causes less information dissemination leading to degradation of the algorithm performance. The best communication topology for a particular application lies somewhere in between and often requires empirical evaluation by application designers. Existing methods do not put focus on the needs for smart grid applications, which is information dissemination throughout the network and they do not provide a flexible solution for application developers to prototype and deploy different topologies without modifying the application code. This paper introduces a configurable virtual communication topology framework TopLinkMgr, allowing users to specify any chosen communication topology and deploy peer-to-peer applications using it. It also introduces a self-adaptive, fault-tolerant topology management algorithm, Bounded Path Dissemination that can ensure the dissemination of information to all peers within a specified threshold for a sparsely connected topology. Experiments show that the algorithm improves on convergence speed and accuracy over state-of-the-art methods and is also robust against node failures. The results indicate the possibility of achieving a close-to optimal convergence without overloading the network allowing the realization of peer-to-peer control platforms covering larger and more complex power systems.

Bounded Path Dissemination↗

Voltage positioning using co-optimization of controllable grid assets in radial networks

With increasing penetration of solar PV, some distribution feeders are experiencing highly variable net-load flows and even reverse flows. To optimize distribution systems under such conditions, the scheduling of mechanical devices, such as OLTCs and capacitor banks, needs to take into account forecasted solar PV and actual grid conditions. However, these legacy switching assets are operated on a daily or hourly timescale, due to the wear and tear associated with mechanical switching, which makes them unsuitable for real-time control. Therefore, there is a natural timescale- separation between these slower mechanical assets and the responsive nature of inverter-based resources. In this paper, we present a network admissible convex formulation for holistically scheduling controllable grid assets to position voltage optimally against solar PV. An optimal hourly schedule is presented that utilizes mechanical resources to position the predicted voltages close to nominal values, while minimizing the use of inverter-based resources (i.e., DERs), making them available for control at a faster time-scale (after the uncertainty reveals itself). A convex, inner approximation of the OPF problem is adapted to a mixed-integer linear program that minimizes voltage deviations from nominal (i.e., maximizes voltage margins). Here, the resulting OPF solution respects all the network constraints and is, hence, robust against modeling simplifications. Simulation based analysis on IEEE distribution feeders validates the approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Impact of cyber attacks on distributed compressive sensing based state estimation in power distribution grids

Modern power distribution grids suffer from multiple vulnerabilities due to the tight integration between the physical system and the cyber infrastructure. Sophisticated and malicious cyber attacks continue to adversely impact the grid operation leading to performance degradation, service interruption, and grid failure. State estimation plays an essential role in grid monitoring and advancing cyber-attack situational awareness. In this regard, this paper first proposes a distributed compressive sensing (CS) state estimation approach for an unobservable distribution grid. Further, the proposed distributed CS approach divides the distribution grid into sub-areas to perform local state estimation. Then an alternating direction method of multipliers (ADMM) based iterative information exchange among neighboring areas is employed to complete the estimation process. In this estimation process, the impact of loss of measurement data, false data injection (FDI), replay, and neighborhood cyber-attacks is analyzed. Extensive simulations are performed on the IEEE 37-bus and IEEE 123-bus standard networks to demonstrate the algorithm’s robustness to the aforementioned cyber-attacks. A quantitative analysis of computational complexity and simulation time of the distributed CS based approach is also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sizing battery energy storage and PV system in an extreme fast charging station considering uncertainties and battery degradation

In this paper, we present mixed integer linear programming (MILP) formulations to obtain optimal sizing for a battery energy storage system (BESS) and solar generation system in an extreme fast charging station (XFCS) to reduce the annualized total cost. The proposed model characterizes a typical year with eight representative scenarios and obtains the optimal energy management for the station and BESS operation to exploit the energy arbitrage for each scenario. Contrasting extant literature, this paper proposes a constant power constant voltage (CPCV) based improved probabilistic approach to model the XFCS charging demand for weekdays and weekends. This paper also accounts for the monthly and annual demand charges based on realistic utility tariffs. Furthermore, BESS life degradation is considered in the model to ensure no replacement is needed during the considered planning horizon. Different from the literature, this paper offers pragmatic MILP formulations to tally BESS charge/discharge cycles using the cumulative charge/discharge energy concept. McCormick relaxations and the Big-M method are utilized to relax the bi-linear terms in the BESS operational constraints. Finally, a robust optimization-based MILP model is proposed and leveraged to account for uncertainties in electricity price, solar generation, and XFCS demand. Case studies were performed to signify the efficacy of the proposed formulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Epistemology of voltage control in DER-rich power system

Despite the recent development of several scalable, robust, and resilient control approaches with superior convergence properties considering an increasing penetration of distributed energy resources (DERs), cognitive oversights often simplify several aspects of the cyber–physical power system in the controller development. Here, following the identification of the limitations of classical controller definitions, we justify alternative definitions of voltage control approaches classifiers considering three inter-disciplinary domains: (i) power system, (ii) optimization and decision-making, and (iii) networking and cyber-security, to develop a taxonomy for helping in real-world comparative performance analysis and deployability of these controllers. We observe that classical and introduced domain-based definitions together can better classify the control algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Muon radiography applied to volcanoes imaging: the MURAVES experiment at Mt. Vesuvius

Muon radiography is a technique based on the measurement of absorption profiles of muons as they pass through matter. This measurement allows to obtain an image of the inner structure of large volume objects and is suitable to be applied in several fields, such as volcanology, archaeology and civil engeneering. One of the main applications concerns the study of volcanic structures; indeed it is possible to use this technique to measure the mass distribution inside the edifice of a volcano providing useful information to better understand the possible eruption mechanisms. The MURAVES (MUon RAdiography of VESuvius) project aims to the study of the summital cone of Mt. Vesuvius near Naples in Italy, one of the most dangerous active volcanoes in the world. The MURAVES apparatus is a modular, robust muon hodoscope system with a low power consumption, optimized to be used in inhospitable environments like the surroundings of volcanoes. The complete detection system is an array of identical tracking modules, each with an area of 1 m2, based on the use of plasic scintillators. The technologies, the status and the data analysis strategy of the experiment will be presented in this paper.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SAIGE-GPU: accelerating genome- and phenome-wide association studies using GPUs

Genome-wide association studies (GWAS) at biobank scale are computationally intensive, especially for admixed populations requiring robust statistical models. SAIGE is a widely used method for generalized linear mixed-model GWAS but is limited by its CPU-based implementation, making phenome-wide association studies impractical for many research groups. We developed SAIGE-GPU, a GPU-accelerated version of SAIGE that replaces CPU-intensive matrix operations with GPU-optimized kernels. The core innovation is distributing genetic relationship matrix calculations across GPUs and communication layers. Applied to 2068 phenotypes from 635 969 participants in the Million Veteran Program, including diverse and admixed populations, SAIGE-GPU achieved a 5-fold speedup in mixed model fitting on supercomputing infrastructure and cloud platforms. We further optimized the variant association testing step through multi-core and multi-trait parallelization. Deployed on Google Cloud Platform and Azure, the method provided substantial cost and time savings. Source code and binaries are available for download at https://github.com/saigegit/SAIGE/tree/SAIGE-GPU-1.3.3. A code snapshot is archived at Zenodo for reproducibility (DOI: [10.5281/zenodo.17642591]). SAIGE-GPU is available in a containerized format for use across HPC and cloud environments and is implemented in R/C++ and runs on Linux systems.

Rodriguez, Alex [Argonne National Laboratory (ANL)↗

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗

A Survey of Collective Intelligence

This chapter presents the science of "COllective INtelligence" (COIN). A COIN is a large multi-agent systems where: i) the agents each run reinforcement learning (RL) algorithms; ii) there is little to no centralized communication or control; iii) there is a provided world utility function that, rates the possible histories of tile full system. Tile conventional approach to designing large distributed systems to optimize a world utility does not use agents running RL algorithms. Rather that approach begins with explicit modeling of the overall system's dynamics, followed by detailed hand-tuning of the interactions between the components to ensure that they "cooperate" as far as the world utility is concerned. This approach is labor-intensive, often results in highly non-robust systems, and usually results in design techniques that, have limited applicability. In contrast, with COINs we wish to solve the system design problems implicitly, via the 'adaptive' character of the RL algorithms of each of the agents. This COIN approach introduces an entirely new, profound design problem: Assuming the RL algorithms are able to achieve high rewards, what reward functions for the individual agents will, when pursued by those agents, result in high world utility? In other words, what reward functions will best ensure that we do not have phenomena like the tragedy of the commons, or Braess's paradox? Although still very young, the science of COINs has already resulted in successes in artificial domains, in particular in packet-routing, the leader-follower problem, and in variants of Arthur's "El Farol bar problem". It is expected that as it matures not only will COIN science expand greatly the range of tasks addressable by human engineers, but it will also provide much insight into already established scientific fields, such as economics, game theory, or population biology.

Wolpert, David H.↗

SU-F-T-347: An Absolute Dose-Volume Constraint Based Deterministic Optimization Framework for Multi-Co60 Source Focused Radiotherapy

Purpose: Treatment plan optimization in multi-Co60 source focused radiotherapy with multiple isocenters is challenging, because dose distribution is normalized to maximum dose during optimization and evaluation. The objective functions are traditionally defined based on relative dosimetric distribution. This study presents an alternative absolute dose-volume constraint (ADC) based deterministic optimization framework (ADC-DOF). Methods: The initial isocenters are placed on the eroded target surface. Collimator size is chosen based on the area of 2D contour on corresponding axial slice. The isocenter spacing is determined by adjacent collimator sizes. The weights are optimized by minimizing the deviation from ADCs using the steepest descent technique. An iterative procedure is developed to reduce the number of isocenters, where the isocenter with lowest weight is removed without affecting plan quality. The ADC-DOF is compared with the genetic algorithm (GA) using the same arbitrary shaped target (254cc), with a 15mm margin ring structure representing normal tissues. Results: For ADC-DOF, the ADCs imposed on target and ring are (D100>10Gy, D50,10, 0<12Gy, 15Gy and 20Gy) and (D40<10Gy). The resulting D100, 50, 10, 0 and D40 are (9.9Gy, 12.0Gy, 14.1Gy and 16.2Gy) and (10.2Gy). The objectives of GA are to maximize 50% isodose target coverage (TC) while minimize the dose delivered to the ring structure, which results in 97% TC and 47.2% average dose in ring structure. For ADC-DOF (GA) techniques, 20 out of 38 (10 out of 12) initial isocenters are used in the final plan, and the computation time is 8.7s (412.2s) on an i5 computer. Conclusion: We have developed a new optimization technique using ADC and deterministic optimization. Compared with GA, ADC-DOF uses more isocenters but is faster and more robust, and achieves a better conformity. For future work, we will focus on developing a more effective mechanism for initial isocenter determination.

60 APPLIED LIFE SCIENCES↗