Search NASA⌕ Search

SEARCH · Search NASA

Results for “Robustness guarantees”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗
DOE OSTI2022

Differentiable Predictive Control with Safety Guarantees: A Control Barrier Function Approach

In this paper, we develop a novel form of differentiable predictive control (DPC) with safety and robustness guarantees. DPC is a form of approximate model predictive control (MPC), wherein the control policy is a neural network that learns a receding horizon, optimal control law. The proposed approach exploits a new form of sampled-data barrier function to enforce safety, while only interrupting the neural network-based controller near the boundary of the safe set. The effectiveness of the proposed approach is demonstrated in simulation.

Shaw Cortez, Wenceslao E.↗
DOE OSTI2024

A block-spectral adaptive H-/$p$-refinement strategy for shock-dominated problems

An adaptive H-/p-refinement strategy using a novel sensor is devised and tested in a block-spectral compressible Euler code equipped with adaptive-mesh refinement (AMR) and high-order flux-reconstruction numerics. At each Gauss quadrature point (or solution point) within each spectral block (or mesh element) the discrete velocity jump ΔU = ∂U/∂y 1 Δy 1 + ∂V/∂y 2 Δy 2 + ∂W/∂y 3 Δy 3 is calculated and normalized by the local speed of sound, a. Here, the grid spacing, Δx i , is calculated in each direction as the distance between auxiliary Gauss-Lobatto points, staggered relative to the solution points. The polynomial order is increased from p = 0 to p = p max in regions of weak compression, (ΔU/a) crit < ΔU/a < 0 and kept at p = p max in regions of flow expansion ΔU/a ≥ 0, while staying at the H = 0 base mesh level. Regions experiencing strong compressions, i.e. ΔU/a < (ΔU/a) crit , are H-refined up to H = H max where H max is applied at the location of maximum compression, ΔU/a = min(ΔU/a) in the domain, while keeping p = 0 to guarantee robustness and monotonicity of the solution in the H refined region. The critical value of (ΔU/a) crit = -0.06 is found to effectively separate smooth and non-smooth solution regions, supported by a 1D detonation initiation test case in ideal gas and a shock-to-detonation transition in high explosives. Using this value, the Sod shock tube, Shu-Osher problem, double Mach reflection and a 2D detonation in a high-explosive are simulated with the proposed adaptive H-/p-refinement. In the Sod shock tube case, p-refinement resolves the (weak) contact discontinuity while H-refinement enhances the grid resolution in the shock exploiting the monotonicity of the p = 0 reconstruction. For the Shu-Osher problem, p-refinement captures the small-scale oscillations trailing the shock that would be otherwise attenuated, while H-refinement triggered by the ΔU-sensor appropriately tracks the shock. In the double Mach reflection problem, H-refinement confines the numerical diffusion around the reflected shock while p-refinement recaptures many physical features trailing the shock. Finally, in the 2D high-explosive detonation case, H-refinement follows the leading shock and resolves the curvature of the detonation wave, while p-refinement adds resolution to the trailing reaction zone. Finally, the proposed methodology is tested in a detonation-wave propagation test case in high-explosives with numerical predictions comparing favorably against experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Data-driven linear time advance operators for the acceleration of plasma physics simulation

In this study, we demonstrate the application of data-driven linear operator construction for time advance with a goal of accelerating plasma physics simulation. We apply dynamic mode decomposition (DMD) to data produced by the nonlinear SOLPS-ITER (Scrape-off Layer Plasma Simulator - International Thermonuclear Experimental Reactor) plasma boundary code suite in order to estimate a series of linear operators and monitor their predictive accuracy via online error analysis. We find that this approach defines when these dynamics can be represented by a sequence of approximate linear operators and is essential for providing consistent projections when compared to an unconstrained application. For linear diffusion and advection–diffusion fluid test problems, we construct and apply operators within explicit and implicit time advance schemes, demonstrating that stability can be robustly guaranteed in each case. We further investigate the use of the linear time advance operators within several integration methods including forward Euler, backward Euler, and the matrix exponential. The application of this method to simulation data from SOLPS-ITER, with varying levels of Markov chain Monte Carlo numerical noise, shows that constrained DMD operators yield a capability to identify, extract, and integrate a (slow) subset of the present timescales. Example applications show that for projected speedup factors of [Formula: see text], and [Formula: see text], a mean relative error of 3%, 5%, and 8% and maximum relative error less than 20% are achievable, which appears acceptable for typical SOLPS-ITER steady-state simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Optimal Control for X-Ray Mircroscopes

In this article, a systematic framework for designing the control for fine positioning (scanning) stages of X-ray microscopes is presented. This framework facilitates designs that simultaneously achieve specifications on positioning resolution and tracking bandwidth while guaranteeing robustness of the closed loop device to unmodeled uncertainties. We use robust optimal control techniques for modeling, quantifying design objectives and system-specific challenges, and designing the control laws. The control designs were implemented on a three degree of freedom piezoactuated flexure stages dedicated for fine positioning of X-ray optics. Experimental results demonstrate significant improvements in positioning performance of 134%, 150%, and 132% in tracking bandwidths along the lateral (X), vertical (Y), and beam (Z) directions, respectively, when compared to proportional-integral-derivative controller designs. This was achieved while keeping similar or better positioning resolution and robustness measures. Fast scanning for X-ray imaging was demonstrated in both the step scan and flyscan modes, where bandwidth was improved by over 450 times with flyscan compared to the step scan.

42 ENGINEERING↗
DOE OSTI2022

Asymptotic preserving methods for fluid electron-fluid models in the large magnetic field limit with mathematically guaranteed properties (Final Report)

The current manuscript is a final report on the activities carried out under the Project LDRD-CIS #226834. In scientific terms, the work reported in this manuscript is a continuation of the efforts started with Project LDRD-express #223796 with final report of activities SAND2021-11481, see [83]. In this section we briefly explain what pre-existing developments motivated the current body of work and provide an overview of the activities developed with the funds provided. The overarching goal of the current project LDRD-CIS #226834 and the previous project LDRD-express #223796 is the development of numerical methods with mathematically guaranteed properties in order to solve the Euler-Maxwell system of plasma physics and generalizations thereof. Even though Project #223796 laid out general foundations of space and time discretization of Euler-Maxwell system, overall, it was focused on the development of numerical schemes for purely electrostatic fluid-plasma models. In particular, the project developed a family of schemes with mathematically guaranteed robustness in order to solve the Euler-Poisson model. This model is an asymptotic limit where only electrostatic response of the plasma is considered. Its primary feature is the presence of a non-local force, the electrostatic force, which introduces effects with infinite speed propagation into the problem. Even though instantaneous propagation of perturbations may be considered nonphysical, there are plenty of physical regimes of technical interest where such an approximation is perfectly valid.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Feasibility and strategic implications of deploying nuclear power reactors in Africa

This report assesses the feasibility and strategic implications of deploying nuclear power reactors, including large-scale plants, advanced small modular reactors (SMRs), and microreactors, in African countries. Case studies focus on South Africa, Egypt, Kenya, Ghana, and Nigeria, examining nuclear energy’s role in Africa’s rapidly evolving energy landscape, marked by fast-growing demand, significant electricity access gaps, increasing renewable penetration, and strong policy commitments to industrialization and energy security. Several U.S. reactor technologies and designs are considered based on their development status and readiness for deployment. The analysis finds that nuclear power can provide reliable, clean baseload and flexible generation, as well as high-temperature process heat for desalination, hydrogen production, and industrial applications. However, suitability is highly country-specific, depending on grid size and stability, transmission capacity, cooling water availability, regulatory readiness, and fuel supply chains. Near-term deployment opportunities are strongest for light-water reactors (such as NuScale, BWRX-300, AP300, and SMR-300) that use low-enriched uranium and build on proven technology. More advanced concepts, including gas-cooled, sodium-cooled, molten-salt cooled reactors, and microreactors, will likely be relevant for African deployment in the 2030s or later, contingent on demonstration projects, high-assay low-enriched uranium (HALEU) fuel availability, and mature international licensing frameworks. Economic analysis shows that SMRs are capital-intensive, with projected overnight costs for 300 MWe units in 2025 ranging from approximately 1.4 to 2.6 billion USD per module. The levelized cost of electricity (LCOE) is highly sensitive to the weighted average cost of capital (WACC). Given typically higher financing costs and utility balance-sheet weaknesses in many African countries, bankable project structures will require sovereign guarantees, robust offtake arrangements, and layered financing from export credit agencies, development finance institutions, and vendor nations. Comparisons with recent large nuclear projects in the United Arab Emirates (UAE) and Egypt underscore the central role of state-backed loans, long tenors, and concessional terms. Country case studies illustrate a spectrum of readiness and opportunity. South Africa operates two 920 MWe pressurized light water reactors (totaling 1,840 MWe) at Koeberg and has the most mature regulatory and industrial base, positioning it as a prime candidate for both large reactors and SMRs to replace coal, support desalination, and anchor industrial hubs. Egypt is constructing four VVER-1200 units at El Dabaa with strong state leadership and could later complement this fleet with SMRs for coastal and industrial applications. Kenya and Ghana are advancing through IAEA Milestones with growing institutional capacity and clear interest in SMRs that match their smaller grids and industrialization plans. Nigeria has the largest demand potential but faces acute constraints in grid reliability, project bankability, and regulatory capacity; targeted deployments of large reactors and SMRs near coastal or industrial sites could have high impact if accompanied by major grid upgrades and institutional reforms. The report identifies cross-cutting challenges such as financing, political continuity, public acceptance, nonproliferation and security, waste and back-end management, regulatory capacity, grid adequacy, and long deployment timelines for first-of-a-kind designs, and ANL/NSE-26/3 ii proposes broad directions for resolution. These include stronger multifaceted financing for nuclear, long-term national energy strategies that transcend electoral cycles, proactive stakeholder engagement, strengthened regional and national regulators, and systematic workforce development through centers of excellence and expanded training. The United States should develop partnerships with African countries and offer end-to-end nuclear package similar to those used effectively by competitors: coordinated project development, state-backed financing, long-term fuel services, and durable in-country support through regional offices and sustained workforce/regulatory training. With timely planning, sustained political commitment, and appropriate financing and institutional support, nuclear energy, both large reactors and advanced SMRs, can become a meaningful, though not dominant, pillar of Africa’s future power mix, enhancing energy security, enabling industrial growth, and supporting climate goals.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Optimal Power Flow in DC Networks with Robust Feasibility and Stability Guarantees

With high penetrations of renewable generation and variable loads, there is significant uncertainty associated with power flows in DC networks such that stability and operational constraint satisfaction are of concern. Most existing DC network optimal power flow (DN-OPF) formulations assume exact knowledge of loading conditions and do not provide stability guarantees. Here, in contrast, this paper studies a DN-OPF formulation which considers both stability and operational constraint satisfaction under uncertainty. The need to account for a range of uncertainty realizations in this paper's robust optimization formulation results in a challenging semi-infinite program (SIP). The proposed solution algorithm reformulates this SIP into a computationally tractable problem by constructing a tight convex inner approximation of the stability set using sufficient conditions for the existence of a feasible and stable power flow solution. Optimal generator set-points are obtained by optimizing over the proposed convex stability set. The validity and effectiveness of the propose algorithm is demonstrated through various DC networks adapted from IEEE test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Certifiably Robust Neural ODE With Learning-Based Barrier Function

Neural Ordinary Differential Equations (ODEs) have gained traction in many applications. While recent studies have focused on empirically increasing the robustness of neural ODEs against natural or adversarial attacks, certified robustness is still lacking. In this work, we propose a framework for training a neural ODE using barrier functions and demonstrate improved robustness for classification problems. Finally, we further provide the first generalization guarantee of robustness against adversarial attacks using a wait-and-judge scenario approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Robust vehicle routing under uncertainty via branch-price-and-cut

Here, this paper contemplates how branch-price-and-cut solvers can be employed along with the robust optimization paradigm to address parametric uncertainty in the context of vehicle routing problems. In this setting, given postulated uncertainty sets for customer demands and vehicle travel times, one aims to identify a set of cost-effective routes for vehicles to traverse, such that the vehicle capacities and customer time window constraints are respected under any anticipated demand and travel time realization, respectively. To tackle such problems, we propose a novel approach that combines cutting-plane techniques with an advanced branch-price-and-cut algorithm. Specifically, we use deterministic pricing procedures to generate "partially robust" vehicle routes and then utilize robust versions of rounded capacity inequalities and infeasible path elimination constraints to guarantee complete robust feasibility of routing designs against demand and travel time uncertainty. In contrast to recent approaches that modify the pricing algorithm, our approach is both modular and versatile. It permits the use of advanced branch-price-and-cut technologies without significant modification, while it can admit a variety of uncertainty sets that are commonly used in robust optimization but could not be previously employed in a branch-price-and-cut setting.

42 ENGINEERING↗
DOE OSTI2020

Statistical Tests for Diagnosing Fission Source Convergence and Undersampling in Monte Carlo Criticality Calculations [Slides]

There is a very strong need for statistical testing to determine fission source convergence in Monte Carlo criticality calculations. Automation of such tests will greatly streamline and support the work carried out by NCS practitioners. Recent R&D work has shown that no single statistical test for convergence is sufficiently reliable, robust, and “guaranteed.” However, a combination of several standard statistical tests for the similarity of distributions, coupled with a high-fidelity estimate of the fission-matrix source is sufficiently robust, reliable, and repeatable that convergence can be “guaranteed.” During the course of the EG-AMCT studies, a number of statistical metrics and tests were proposed for diagnosing clustering and undersampling. None of these was robust and reliable enough for practical use in production codes. However, the expert group efforts came close. Some recent R&D work stemming from those past efforts has been very successful and promising. This Sub-Group will provide international input and collaboration on the development and implementation of statistical tests for convergence, with the primary goal of having the MC codes automatically detect convergence (or lack thereof). Newly proposed statistical tests to detect undersampling (after convergence) will also be reviewed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Angle-robust two-qubit gates in a linear ion crystal

In trapped-ion quantum computers, two-qubit entangling gates are generated by applying spin-dependent force which uses phonons to mediate interaction between the internal states of the ions. To maintain high-fidelity two-qubit gates under fluctuating experimental parameters, robust pulse-design methods are applied to remove the residual spin-motion entanglement in the presence of motional mode-frequency drifts. Here we propose an improved pulse-design method that also guarantees the robustness of the two-qubit rotation angle against uniform mode-frequency drifts by concatenating pulses with opposite sensitivity of the angle to mode-frequency drifts. Here we experimentally verify significantly improved robustness of the rotation angle against uniform mode-frequency drifts, as well as observe an improvement in gate fidelity from 97.84(10)% to 98.11(11)%, compared to a single frequency-modulated pulse.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Weak-form latent space dynamics identification

Recent work in data-driven modeling has demonstrated that a weak formulation of model equations enhances the noise robustness of a wide range of computational methods. In this paper, we demonstrate the power of the weak form to enhance the LaSDI (Latent Space Dynamics Identification) algorithm, a recently developed data-driven reduced order modeling technique. We introduce a weak form-based version WLaSDI (Weak-form Latent Space Dynamics Identification). WLaSDI first compresses data, then projects onto the test functions and learns the local latent space models. Notably, WLaSDI demonstrates significantly enhanced robustness to noise. With WLaSDI, the local latent space is obtained using weak-form equation learning techniques. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form guarantees a robust and precise latent space recovery, hence allowing for a fast, robust, and accurate simulation. We demonstrate the efficacy of WLaSDI vs. LaSDI on several common benchmark examples including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in the case of 1D inviscid Burgers' simulations with the addition of up to 100% Gaussian white noise, the relative error remains consistently below 6% for WLaSDI, while it can exceed 10,000% for LaSDI. Similarly, for radial advection simulations, the relative errors stay below 15% for WLaSDI, in stark contrast to the potential errors of up to 10,000% with LaSDI. Moreover, speedups of several orders of magnitude can be obtained with WLaSDI. For example applying WLaSDI to 1D Burgers' yields a 140X speedup compared to the corresponding full order model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimization-based approaches to control of connected and automated vehicles: Principles, complexities, applications, challenges, and outlook

Safe and optimal motion control for connected and automated vehicles (CAVs) poses a fundamental optimization challenge at the intersection of system complexity, environmental uncertainty, and stringent real-time constraints. Existing surveys address this challenge in isolation – focusing either on specific control techniques or individual uncertainty sources – without providing a unified framework that characterizes the trade-offs among computational tractability, performance verifiability, and adaptive generalization across paradigms. This review addresses that gap by presenting a cohesive analytical framework concentrated on the decision-making and trajectory optimization layers of the CAV autonomy stack. We systematically analyze three major optimization paradigms – first-principles model-based optimization, data-driven methods, and hybrid synergistic architectures – evaluating each against four core complexity axes: problem formulation, constraint handling, optimality guarantees, and robustness. Key applications including platooning, trajectory planning, collision avoidance, and cooperative control are examined to reveal recurring methodological patterns and critical operational constraints that limit real-world performance. Our synthesis identifies verifiable hybrid architectures, incentive-aligned multi-agent cooperation, and hardware-algorithm co-design as the defining research frontiers, and distills a targeted agenda for developing CAV control systems that are simultaneously safe, computationally efficient, and deployable in the full complexity of real-world traffic environments.

Muzahid, Abu Jafar Md [University of Tennessee, Kn↗
DOE OSTI2020

Comparative Study of Differentially Private Data Synthesis Methods

When sharing data among researchers or releasing data for public use, there is a risk of exposing sensitive information of individuals in the data set. Data synthesis is a statistical disclosure limitation technique for releasing synthetic data sets with pseudo individual records. Traditional data synthesis techniques often rely on strong assumptions of a data intruder’s behaviors and background knowledge to assess disclosure risk. Differential privacy (DP) formulates a theoretical approach for a strong and robust privacy guarantee in data release without having to model intruders’ behaviors. Efforts have been made aiming to incorporate the DP concept in the data synthesis process. Here, we examine current DIfferentially Private Data Synthesis (DIPS) techniques for releasing individual-level surrogate data for the original data, compare the techniques conceptually and evaluate the statistical utility and inferential properties of the synthetic data via each DIPS technique through extensive simulation studies. Our work sheds light on the practical feasibility and utility of the various DIPS approaches, and suggests future research directions for DIPS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

BigData Express: Toward Predictable, Schedulable, and High-Performance Data Transfer [Slides]

BigData Express: a schedulable, predictable, and high-performance data transfer service. A peer-to-peer, scalable, and extensible data transfer model; A visually appealing, easy-to-use web portal; A high-performance data transfer engine; On-demand provisioning of end-to-end network paths with guaranteed QoS; Robust and flexible error handling; CILogon-based security (certificate version); A rich set of REST APIs to support scientific workflows

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗