Search NASA⌕ Search

SEARCH · Search NASA

Results for “satisfiability problems”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗
DOE OSTI2020

On the Convergence of Physics Informed Neural Networks for Linear Second-Order Elliptic and Parabolic Type PDEs

Physics informed neural networks (PINNs) are deep learning based techniques for solving partial differential equations (PDEs) encountered in computational science and engineering. Guided by data and physical laws, PINNs find a neural network that approximates the solution to a system of PDEs. Such a neural network is obtained by minimizing a loss function in which any prior knowledge of PDEs and data are encoded. Despite its remarkable empirical success in one, two or three dimensional problems, there is little theoretical justification for PINNs. As the number of data grows, PINNs generate a sequence of minimizers which correspond to a sequence of neural networks. We want to answer the question: Does the sequence of minimizers converge to the solution to the PDE? We consider two classes of PDEs: linear second-order elliptic and parabolic. By adapting the Schauder approach and the maximum principle, we show that the sequence of minimizers strongly converges to the PDE solution in C 0 . Furthermore, we show that if each minimizer satisfies the initial/boundary conditions, the convergence mode becomes H 1 . Computational examples are provided to illustrate our theoretical findings. To the best of our knowledge, this is the first theoretical work that shows the consistency of PINNs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multi-Agent Safe Policy Learning for Power Management of Networked Microgrids

This paper presents a supervised multi-agent safe policy learning (SMAS-PL) method for optimal power management of networked microgrids (MGs) in distribution systems. While unconstrained reinforcement learning (RL) algorithms are black-box decision models that could fail to satisfy grid operational constraints, our proposed method considers AC power flow equations and other operational limits. Accordingly, the training process employs the gradient information of operational constraints to ensure that the optimal control policy functions generate safe and feasible decisions. Furthermore, we have developed a distributed consensus-based optimization approach to train the agents’ policy functions while maintaining MGs’ privacy and data ownership boundaries. After training, the learned optimal policy functions can be safely used by the MGs to dispatch their local resources, without the need to solve a complex optimization problem from scratch. Lastly, numerical experiments have been devised to verify the performance of the proposed method.

, policy gradient↗
DOE OSTI2020

Model predictive control for voltage restoration in microgrids using temporal logic specifications

Power system operation will encounter numerous voltage variabilities as the proliferation of renewable energy continues. Real-time monitoring and communication technologies can potentially improve voltage stability by enabling the rapid detection of voltage deviations and the implementation of corrective actions. These corrective actions will only be effective in restoring stability if they are chosen in a timely and scalable manner. This paper considers the problem of power systems’ load voltage control in order to simultaneously address both magnitude and time voltage specifications. In order to comply with grid codes and avoid unnecessary relay protection actions, a model predictive control (MPC)-based control strategy employing temporal logic specifications (TLSs) is proposed. The TLSs strategy is introduced as a formalism to control the voltage variation at a critical load bus against operational bounds over time. The control objective is to schedule optimal control input signals from the available supportive energy storage systems, which provide reactive power injections, leading to satisfying the specified finite-time restoration described by the TLSs with minimal control efforts. The simulation results display that the TLSs strategy for power systems’ voltage control synthesis is extremely significant.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Does the vacuum gravitate on microscopic scales? Rydberg atoms indicate probably not

The cosmological constant presents one of the most fascinating and confounding problems in physics. A straightforward, seemingly robust prediction of quantum mechanics and general relativity is that the vacuum energy gravitates. Therefore, the cosmological constant should be enormous. It is minuscule. Since there is no understanding of why the cosmological constant is so small, it is important to test this idea in many different situations. In particular, given the span of distances in astronomy and particle physics, it is vital to test the gravitation of vacuum energy on as many distance scales as we can. Rydberg atoms open up a new set of distances for exploration. It is satisfying to measure the cosmological constant with an atom, but its main significance is extending measurements to microscopic distances. Here, too, there is no evidence of the gravitation of the vacuum. At scales of a micron and less, we place a limit of 7 GeV on the scale of gravitating vacuum energy, well below the scale of 100 GeV of the Standard Model of particle physics.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Exploring quantum statistics for massive Dirac and Majorana neutrinos using spinor-helicity techniques

Recently, there has been interest in the applicability of quantum statistics to distinguish Dirac from Majorana neutrinos in multineutrino final states. In particular, debate has arisen over the validity of the Dirac-Majorana confusion theorem in these processes, i.e., that any distinction between the Dirac and Majorana processes goes to zero as the neutrino mass goes to zero. Here we approach this problem equipped with spinor-helicity methods generalized for massive Dirac and Majorana fermions. We explicitly calculate all helicity amplitudes, and their squares, for the decay of a light scalar particle to two neutrinos and two oppositely charged leptons. This allows us to pinpoint the crucial steps which could lead to claims of a violation of the confusion theorem. We show that, if the correct antisymmetrization of Dirac to Majorana amplitudes is used, identification of which is clear in this framework, and all relevant contributions are appropriately summed, a scalar decay into two charged leptons and two neutrinos satisfies the Dirac-Majorana confusion theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Nucleon Mass and Charges with Lattice Quantum Chromodynamics

Neutrino oscillation experiments are designed to measure neutrino masses and mixing parameters by scattering them off nuclei such as carbon, oxygen, and argon in detectors. Predictions of neutrino-nuclei cross sections from the Standard Model are needed to extract these parameters, but their theoretical uncertainties remain large due to the complexity of nuclear and hadronic physics. This situation needs to be improved in order to satisfy the precision needs of future experiments.In this dissertation, we focus on working towards a first-principles calculation of the nucleon axial form factor with lattice quantum chromodynamics (QCD). Nucleon axial form factor, which parametrizes the weak responses of a proton or neutron, is difficult to measure experimentally, and it is a dominant uncertainty in neutrino-nuclei cross-section calculations for incoming neutrino energies at around 1 GeV. So a theoretical calculation with lattice QCD provides a non-ambiguous determination of the form factor that could help reducing the uncertainty.The notorious signal-to-noise problem renders calculations of nucleon observables computationally intensive in lattice QCD. In this work, we investigate the use of staggered fermions in nucleon calculations. Staggered fermions are the most computationally efficient fermion discretization in lattice field theory, but certain theoretical issues have so far prevented their applications to nucleon physics. As a stepping stone towards a full calculation of the nucleon axial form factor, this dissertation provides a comprehensive theoretical framework on how to calculate the nucleon mass, vector charge, and axial charge with staggered fermions, together with numerical results demonstrating the methodology. This framework can be generalized to the form factor calculation that will appear in the near future.

Lin, Yin↗
DOE OSTI2021

(U) A Theoretical Study of Asay Foil Trajectories (V.02)

We consider the trajectory of a generic Asay foil ejecta momentum diagnostic sensor, for scenarios where ejecta are produced at a planar surface and fly ballistically through a perfect vacuum to the sensor. To do so, we build upon a previously established mathematical formalism derived for the analytic study of stationary sensors (i.e., piezopins). First, we derive the momentum conservation equation for the problem, in a form amenable to accelerating sensors, in terms of a generic ejecta source areal mass function (“source model”). This defines an integro-differential equation (IDE) for the foil trajectory. When ejecta production is instantaneous - as is generally assumed in momentum diagnostic data analyses - the IDE leads to an implicit and easily calculable closed-form solution for the foil trajectory in a perfect system, as long as the ejecta particle velocity distribution is twice-integrable. General properties of the instant-production trajectory solution indicate the existence of a boundary condition the particle velocity distribution must satisfy in order for the analytically predicted foil trajectories to be compatible with certain features commonly observed in foil data. This boundary condition is identical to one derived previously from a consideration of piezopin data. Armed with the analytic solution for instant production, we also consider various techniques used to extract time-dependent cumulative ejecta masses from foil trajectories, and derive an expression for the error imposed by using an approximated equation of motion. This analytic trajectory solution furthermore makes it possible to examine the common practice of presenting inferred cumulative ejecta masses as a function of a normalized implied velocity; we derive conditions under which this methodology is and is not meaningful. We also propose a strategy for extending the instant-production trajectory solution to time-dependent source functions.

42 ENGINEERING↗
DOE OSTI2022

Analytical benchmark solution for 1-D neutron transport coupled with thermal conduction and material expansion

In this work we present fully analytical solutions for a class of finite, homogeneous, 1-D slab benchmark problems with nonlinear temperature feedback effects. The proposed class of benchmarks include multiplicative 1-D neutron transport (limited to quasistatic S{sub 2} with μ = ±1) coupled with thermal conduction, convection, Doppler broadening, and expansion effects along the length of the slab. This class of benchmark models, along with the corresponding analytical solutions, are valuable for validating multiphysics analysis frameworks that support coupled neutronics/thermal/structural calculations. Analytical solutions for the benchmarks are obtained by introducing an ansatz that the equilibrium flux and temperature distributions in the slab have the same shape. Specific values for the total microscopic cross section, σ{sub t,0}, and conductive heat transfer coefficient, h, that satisfy the assumed ansatz are then determined. A discussion of the procedure for generating benchmark models and analytical solutions is provided, along with numerical results for an example set of model parameters and thoughts on practical applications of the benchmarks for multiphysics code validation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Towards a classification of rank r $\mathscr{N}$ = 2 SCFTs. Part II. Special Kahler stratification of the Coulomb branch

We study the stratification of the singular locus of four dimensional $\mathscr{N}$ = 2 Coulomb branches. We present a set of self-consistency conditions on this stratification which can be used to extend the classification of scale-invariant rank 1 Coulomb branch geometries to two complex dimensions, and beyond. The calculational simplicity of the arguments presented here stems from the fact that the main ingredients needed - the rank 1 deformation patterns and the pattern of inclusions of rank 2 strata - are discrete topological data which satisfy strong self-consistency conditions through their relationship to the central charges of the SCFT. This relationship of the stratification data to the central charges is used here, but is derived and explained in a companion paper by one of the authors. We illustrate the use of these conditions by re-analyzing many previously-known examples of rank 2 SCFTs, and also by finding examples of new theories. The power of these conditions stems from the fact that for Coulomb branch stratifications a conjecturally complete list of physically allowed “elementary slices” is known. By contrast, constraining the possible elementary slices of symplectic singularities relevant for Higgs branch stratifications remains an open problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A Comparison of Exact and Model Exchange–Correlation Potentials for Molecules

Accurate exchange–correlation (XC) potentials for three-dimensional systems–via solution of the inverse density functional theory (DFT) problem–are now available to test the quality of DFT approximations. Herein, the exact XC potential for seven molecules–dihydrogen at four different bond-lengths, lithium hydride, water, and ortho-benzyne–are computed from full configuration interaction reference densities. These are compared to model XC potentials from nonlocal (B3LYP, HSE06, SCAN0, and M08-HX) and semilocal/local (SCAN, PBE, and PW92) XC functionals. Whereas for most systems, relative errors in the ground-state densities are O(10 –3 –10 –2 ) , the model XC potentials have much higher errors of O(10 –1 –10 0 ) . Among the model XC functionals, SCAN0 offers the best agreement with the exact XC potential, underlining the significance of satisfying exact conditions as well as including nonlocal effects in XC functionals. This work indicates that tests against the exact XC potential will provide a promising new direction for building more accurate XC functionals for DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

U-splines: Splines over unstructured meshes

U-splines are a novel approach to the construction of a spline basis for representing smooth objects in Computer-Aided Design (CAD) and Computer-Aided Engineering (CAE). A spline is a piecewise-defined function that satisfies continuity constraints between adjacent cells in a mesh. U-splines differ from existing spline constructions, such as Non-Uniform Rational B-splines (NURBS), subdivision surfaces, T-splines, and hierarchical B-splines, in that they can accommodate local variation in cell size, polynomial degree, and smoothness simultaneously over more varied mesh configurations. Mixed cell types (e.g., triangle and quadrilateral cells in the same mesh) and T-junctions are also supported, although the continuity of interfaces with triangle and tetrahedral cells is limited in the present work. The U-spline algorithm introduces a new technique for using local null space solutions to construct basis functions for the global spline null space problem. The U-spline construction is presented for curves, surfaces, and volumes with higher dimensional generalizations possible. Lastly, a set of requirements are given to ensure that the U-spline basis is positive, forms a partition of unity, is complete, and is locally linearly independent.

42 ENGINEERING↗
DOE OSTI2024

Dynamic Shaping of Grid Response of Multi-Machine Multi-Inverter Systems Through Grid-Forming IBRs

We consider the problem of controlling the frequency response of weakly-coupled multi-machine multi-inverter low-inertia power systems via grid-forming inverter-based resources (IBRs). In contrast to existing methods, our approach relies on dividing the larger system into multiple strongly-coupled subsystems, without ignoring either the underlying network or approximating the subsystem response as an aggregate harmonic mean model. Rather, through a structured clustering and recursive dynamic shaping approach, the frequency response of the overall system to load perturbations is shaped appropriately. We demonstrate the proposed approach for a three-node triangular configuration and a small-scale radial network. Furthermore, previous synchronization analysis for heterogeneous systems requires the machines to satisfy certain proportionality property. In our approach, the effective transfer functions for each cluster can be tuned by the IBRs to satisfy such property, enabling us to apply the shaping control to systems with a wider range of heterogeneous machines.

frequency-shaping control↗
DOE OSTI2020

A conservative, consistent, and scalable meshfree mimetic method

Mimetic methods discretize divergence by restricting the Gauss theorem to mesh cells. Because point clouds lack such geometric entities, construction of a compatible meshfree divergence remains a challenge. In this work, we define an abstract Meshfree Mimetic Divergence (MMD) operator on point clouds by contraction of field and virtual face moments. This MMD satisfies a discrete divergence theorem, provides a discrete local conservation principle, and is first-order accurate. We consider two MMD instantiations. The first one assumes a background mesh and uses generalized moving least squares (GMLS) to obtain the necessary field and face moments. This MMD instance is appropriate for settings where a mesh is available but its quality is insufficient for a robust and accurate mesh-based discretization. The second MMD operator retains the GMLS field moments but defines virtual face moments using computationally efficient weighted graph-Laplacian equations. This MMD instance does not require a background grid and is appropriate for applications where mesh generation creates a computational bottleneck. It allows one to trade an expensive mesh generation problem for a scalable algebraic one, without sacrificing compatibility with the divergence operator. We demonstrate the approach by using the MMD operator to obtain a virtual finite-volume discretization of conservation laws on point clouds. Finally, numerical results in the paper confirm the mimetic properties of the method and show that it behaves similarly to standard finite volume methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Tri-level hybrid interval-stochastic optimal scheduling for flexible residential loads under GAN-assisted multiple uncertainties

Various building loads, such as heating, ventilation, and air conditioners (HVACs), electric water heaters (EWHs), and electric vehicles (EVs), can introduce opportunities for improving the flexibility of electricity consumption while satisfying the needs of building owners as well as benefiting the resilience of distribution system. To utilize such flexibility, a tri-level distribution market framework is established, including residential consumers, load aggregators (LAs), and the distribution system operator (DSO). In this work, the uncertainties from all three levels are considered. The random consumption behavior at the consumer level is modeled as a Gaussian noise that is also aggregated and transmitted to the LA level. The weather temperature in the LA level is forecasted as an interval, and the photovoltaic (PV) power in the market-clearing level is modeled by a set of power scenarios generated by Generative Adversarial Networks (GANs). Then, a hybrid interval-stochastic programming is proposed to transform the uncertain problems in the first two levels into deterministic ones. For real-time implementations, a rolling horizon optimization (RHO) scheme is employed to continuously optimize the power consumption based on the latest operating information. Finally, case studies on a modified IEEE 69-bus system validate the effectiveness of the proposed uncertainty modeling strategies and the RHO scheme.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

$\mathrm{IH}$-$\mathrm{GAN}$: A conditional generative model for implicit surface-based inverse design of cellular structures

Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly those represented as discrete density maps. However, the optimization of such cellular structures is challenging due to the multiscale design problem. Past work addressing this problem generally either only optimizes the volume fraction of single-type unit cells but ignoring the effects of unit cell geometry on properties, or considers the geometry–property relation but builds this relation via heuristics. In contrast, we propose a simple yet more principled way to accurately model the property to geometry mapping using a conditional deep generative model, named Inverse Homogenization Generative Adversarial Network (IH-GAN). It learns the conditional distribution of unit cell geometries given properties and can realize the one-to-many mapping from properties to geometries. Here we further reduce the complexity of IH-GAN by using the implicit function parameterization to represent unit cell geometries. Results show that our method can 1) generate various unit cells that satisfy given material properties with high accuracy (R 2 -scores between target properties and properties of generated unit cells >98%) and 2) improve the optimized structural performance over the conventional variable-density single-type structure. In the minimum compliance example, our IH-GAN generated structure achieves a 79.7% reduction in concentrated stress and an extra 3.03% reduction in displacement. In the target deformation examples, our IH-GAN generated structure reduces the target matching error by 86.4% and 79.6% for two test cases, respectively. We also demonstrated that the connectivity issue for multi-type unit cells can be solved by transition layer blending.

42 ENGINEERING↗