SEARCH · Engineering Papers

Results for “hard constraint”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2022

A simplified, efficient approach to hybrid wind and solar plant site optimization

Abstract. Wind plant layout optimization is a difficult, complex problem with a large number of variables and many local minima. Layout optimization only becomes more difficult with the addition of solar generation. In this paper, we propose a parameterized approach to wind and solar hybrid power plant layout optimization that greatly reduces problem dimensionality while guaranteeing that the generated layouts have a desirable regular structure. Thus far, hybrid power plant optimization research has focused on system sizing. We go beyond sizing and present a practical approach to optimizing the physical layout of a wind–solar hybrid power plant. We argue that the evolution strategy class of derivative-free optimization methods is well-suited to the parameterized hybrid layout problem, and we demonstrate how hard layout constraints (e.g., placement restrictions) can be transformed into soft constraints that are amenable to optimization using evolution strategies. Next, we present experimental results on four test sites, demonstrating the viability, reliability, and effectiveness of the parameterized evolution strategy approach for generating optimized hybrid plant layouts. Completing the tool kit for parameterized layout generation, we include a brief tutorial describing how the parameterized evolutionary approach can be inspected, understood, and debugged when applied to hybrid plant layouts.

14 SOLAR ENERGY↗

DOE OSTI2022

Automation of FARM from Alpha Phase to Beta Phase

Integrated energy systems (IES) combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework and the RAVEN plugin for grid and capacity optimization (HERON) are used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES, by respecting the limits on the production variables and the corresponding rates of variation (explicit constraints). Besides, there are other process variables whose evolution needs to be bounded to avoid damaging the components (e.g., condensers, heat exchangers, steam generators, etc.) or degrading the process efficiency (e.g., electrolysis in the hydrogen production process). To avoid violating these latter limits (implicit constraints), a proof-of-concept HERON validator based on Feasible Actuator Range Modifier (FARM-Alpha) was developed by Argonne National Laboratory in January 2021. This FARM-Alpha validator calculates the evolution of process variables on whom the implicit constraints are placed, and then provides feedback to HERON dispatcher to adjust the power setpoints of three IES components, i.e., Balance of Plant, Secondary Energy Source, and Thermal Energy Storage, so as to meet both the explicit and implicit constraints. FARM-Alpha was designed to assess the performance of FARM as a HERON validator only, i.e., the list of components and implicit operational constraints were hard-coded within the source code. The lack of flexibility of the corresponding software structure does not allow the deployment in production environment. This report describes the development and the implementation of an enhanced version of the FARM-based validator (FARM-Beta), which ensures more flexibility for the end user in modeling multiple IES configurations and scenarios. Several test cases of the power dispatch problem were then selected to demonstrate the capabilities offered by FARM-beta. The test cases illustrate the efficiency of the closed-loop optimization scheme and the capability to calculate set-point trajectories satisfying both explicit and implicit constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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 OSTI2024

Beyond Single-Reference Fixed-Node Approximation in Ab Initio Diffusion Monte Carlo Using Antisymmetrized Geminal Power Applied to Systems with Hundreds of Electrons

Diffusion Monte Carlo (DMC) is an exact technique to project out the ground state (GS) of a Hamiltonian. Since the GS is always bosonic, in Fermionic systems, the projection needs to be carried out while imposing antisymmetric constraints, which is a nondeterministic polynomial hard problem. In practice, therefore, the application of DMC on electronic structure problems is made by employing the fixed-node (FN) approximation, consisting of performing DMC with the constraint of having a fixed, predefined nodal surface. How do we get the nodal surface? The typical approach, applied in systems having up to hundreds or even thousands of electrons, is to obtain the nodal surface from a preliminary mean-field approach (typically, a density functional theory calculation) used to obtain a single Slater determinant. This is known as single reference. In this paper, we propose a new approach, applicable to systems as large as the C 60 fullerene, which improves the nodes by going beyond the single reference. In practice, we employ an implicitly multireference ansatz (antisymmetrized geminal power wave function constraint with molecular orbitals), initialized on the preliminary mean-field approach, which is relaxed by optimizing a few parameters of the wave function determining the nodal surface by minimizing the FN-DMC energy. We highlight the improvements of the proposed approach over the standard single-reference method on several examples and, where feasible, the computational gain over the standard multireference ansatz, which makes the methods applicable to large systems. We also show that physical properties relying on relative energies, such as binding energies, are affordable and reliable within the proposed scheme.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Quantum Annealing with Inequality Constraints: The Set Cover Problem

Abstract Quantum annealing is a promising method for solving hard optimization problems by transforming them into quadratic unconstrained binary optimization (QUBO) problems. However, when constraints are involved, particularly multiple inequality constraints, incorporating them into the objective function poses challenges. In this paper, the authors present two novel approaches for solving problems with multiple inequality constraints on a quantum annealer and apply them to the set cover problem (SCP). The first approach uses the augmented Lagrangian method to represent the constraints, while the second approach employs a higher‐order binary optimization (HUBO) formulation. The experiments show that both approaches outperform the standard approach for solving the SCP on the D‐Wave Advantage quantum annealer. The HUBO formulation performs slightly better than the augmented Lagrangian method in solving the SCP, but its scalability in terms of embeddability in the quantum chip is worse. The results demonstrate that the proposed augmented Lagrangian and HUBO methods can successfully implement a large number of inequality constraints, making them applicable to a broad range of constrained problems beyond the SCP.

Djidjev, Hristo N.↗

DOE OSTI2023

Inference of the optical depth to reionization τ from Planck CMB maps with convolutional neural networks

The optical depth to reionization, τ, is the least constrained parameter of the cosmological Λ cold dark matter (ΛCDM) model. To date, its most precise value is inferred from large-scale polarized cosmic microwave background (CMB) power spectra from the High Frequency Instrument (HFI) aboard the Planck satellite. These maps are known to contain significant contamination by residual non-Gaussian systematic effects, which are hard to model analytically. Therefore, robust constraints on τ are currently obtained through an empirical cross-spectrum likelihood built from simulations. In this paper, we present a likelihood-free inference of τ from polarized Planck HFI maps which, for the first time, is fully based on neural networks (NNs). NNs have the advantage of not requiring an analytical description of the data and can be trained on state-of-the-art simulations, combining the information from multiple channels. By using Gaussian sky simulations and Planck SRoll2 simulations, including CMB, noise, and residual instrumental systematic effects, we trained, tested, and validated NN models considering different setups. We inferred the value of τ directly from Stokes Q and U maps at ~4° pixel resolution, without computing angular power spectra. On Planck data, we obtained τ NN = 0.0579 ± 0.0082, which is compatible with current EE cross-spectrum results but with a ~30% larger uncertainty, which can be assigned to the inherent nonoptimality of our estimator and to the retraining procedure applied to avoid biases. While this paper does not improve on current cosmological constraints on τ, our analysis represents a first robust application of NN-based inference on real data, and highlights its potential as a promising tool for complementary analysis of near-future CMB experiments, also in view of the ongoing challenge to achieve the first detection of primordial gravitational waves.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Radiation-Hard Smart-Pixel Detector ASIC ReadOut with Digital AI in 28nm

Detectors at future high energy colliders will face enormous technical challenges. Disentangling the unprecedented numbers of particles expected in each event will require highly granular silicon pixel detectors with billions of readout channels. With event rates as high as 40 MHz, these detectors will generate petabytes of data per second. To enable discovery within strict bandwidth and latency constraints, future trackers must be capable of fast, power efficient, and radiation hard data-reduction at the source. This effort is pursuing the co-design development of high-performance readout smart pixel ASICs for a future Phase III High Luminosity upgrade of the Large Hadron Collider. A 1.6mm2 ASIC prototype was designed by Fermilab in CMOS 28 nm bulk process and submitted for manufacturing in February 2024. It leverages the analog front-end pixel design of a previous prototype fabricated and tested in 2023, which achieved a simulated detection level of ~400e- with 30fF input capacitance. The ROIC consists of two matrices of 16×16 smart pixels, each 25×25 μm2 in size. Each smart pixel contains a charge-sensitive preamplifier with leakage current compensation and three auto-zero comparators for a 2-bit flash-type ADC. There is digital space for the integration of our fully combinatorial AI that performs momentum classification at the bunch crossing rate. The total power consumption is ∼6μW per pixel, which corresponds to ~1mW/cm2. The ASIC incorporates programmable front-end charge injection circuitry to generate pixel cluster charges during characterization. The cluster profile will be generated to duplicate hit characteristics of various momentum (pT). We will present early results from chip testing.

Parpillon, Benjamin↗

DOE OSTI2024

Intelligent Pixel Detectors: Towards a Radiation Hard ASIC with On-Chip Machine Learning in 28 nm CMOS

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2026

A Material Frame: Hard Recoils from Slow Force Carriers

We modify the Standard Model by making the longitudinal component of the photon physical, propagating with small speed $c_L \ll 1$. This modification breaks gauge invariance and Lorentz symmetry, defining a preferred reference frame. No new fields or scales are introduced, and the photon mass is protected by a Galilean higher-form symmetry. The theory has a smooth $c_L\to0$ limit: the new modes decouple from standard matter and ordinary gauge theory predictions are recovered. Experimental constraints are severe. Charged particles Cherenkov-emit these slow modes, experiencing hard recoils against the preferred frame. The recoil rate decreases with $c_L$, but the momentum transfer remains of the order of the particle's momentum. Dark matter detectors, sensitive to keV-scale nuclear recoils, imply an order-of-magnitude bound $c_L \lesssim 10^{-60}$, tens of orders of magnitude stronger than speed-difference bounds. At such values, $c_L$ is better understood as a recoil-rate factor rather than a physically relevant speed. The slow modes, practically fixed in space, make the reference frame a material medium capable of absorbing momentum from charged particles.

Serra, Francesco [Johns Hopkins U.]↗

DOE OSTI2020

NuSTAR Survey of Obscured Swift/BAT-selected Active Galactic Nuclei. II. Median High-energy Cutoff in Seyfert II Hard X-Ray Spectra

Broadband X-ray spectroscopy of the X-ray emission produced in the coronae of active galactic nuclei (AGNs) can provide important insights into the physical conditions very close to their central supermassive black holes. The temperature of the Comptonizing plasma that forms the corona is manifested through a high-energy cutoff that has been difficult to directly constrain even in the brightest AGN because it requires high-quality data at energies above 10 keV. In this paper we present a large collection of coronal cutoff constraints for obscured AGNs based on a sample of 130 AGNs selected in the hard X-ray band with Swift/BAT and observed nearly simultaneously with NuSTAR and Swift/XRT. Additionally, we find that under a reasonable set of assumptions regarding partial constraints the median cutoff is well constrained to 290 ± 20 keV, where the uncertainty is statistical and given at the 68% confidence level. We investigate the sensitivity of this result to our assumptions and find that consideration of various known systematic uncertainties robustly places the median cutoff between 240 and 340 keV. The central 68% of the intrinsic cutoff distribution is found to be between about 140 and 500 keV, with estimated uncertainties of 20 and 100 keV, respectively. In comparison with the literature, we find no clear evidence that the cutoffs in obscured and unobscured AGNs are substantially different. Our analysis highlights the importance of carefully considering partial and potentially degenerate constraints on the coronal high-energy cutoff in AGNs.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2026

Multiomics and deep learning dissect regulatory syntax in human development

Transcription factors establish cell identity during development by binding regulatory DNA in a sequence-specific manner, often promoting local chromatin accessibility and regulating gene expression1. Mapping accessible chromatin offers critical insights into transcriptional control, but available datasets for human development are restricted to bulk tissue, single organs or single modalities2. Here we present the Human Development Multiomic Atlas, a single-cell atlas of chromatin accessibility and gene expression from 817,740 fetal cells across 12 organs, spanning 203 cell types and more than 1 million candidate cis-regulatory elements, many of which exhibit organ-specific in vivo enhancer activity. Deep learning models trained to predict accessibility from local DNA sequence unravel a comprehensive lexicon of motifs that influence accessibility, including composite motifs exhibiting distinct syntactic constraints that are predicted to mediate transcription factor cooperativity. We identify ‘hard’ syntactic rules requiring precise motif spacing and orientation, ‘soft’ rules allowing flexible motif arrangements, and ubiquitous motifs inhibiting accessibility. Model-based interpretation of genetic variants reveals that disruption of motifs with positive and negative effects is associated with concordant effects on gene expression. Our work delineates how motif syntax governs cell-type-specific chromatin accessibility and provides a foundational resource for decoding cis-regulatory logic and interpreting genetic variation during human development.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Optimal Management of Grid-Interactive Efficient Buildings via Safe Reinforcement Learning

Reinforcement learning (RL)-based methods have achieved significant success in managing grid-interactive efficient buildings (GEBs). However, RL does not carry intrinsic guarantees of constraint satisfaction, which may lead to severe safety consequences. Besides, in GEB control applications, most existing safe RL approaches rely only on the regularisation parameters in neural networks or penalty of rewards, which often encounter challenges with parameter tuning and lead to catastrophic constraint violations. To provide enforced safety guarantees in controlling GEBs, this paper designs a physics-inspired safe RL method whose decision-making is enhanced through safe interaction with the environment. Different energy resources in GEBs are optimally managed to minimize energy costs and maximize customer comfort. The proposed approach can achieve strict constraint guarantees based on prior knowledge of a set of developed hard steady-state rules. Simulations on the optimal management of GEBs, including heating, ventilation, and air conditioning (HVAC), solar photovoltaics, and energy storage systems, demonstrate the effectiveness of the proposed approach.

Huo, Xiang↗

DOE OSTI2023

Mobility-On-Demand Transportation: A System for Microtransit and Paratransit Operations

New rideshare and shared-mobility services have transformed urban mobility in recent years. Therefore, transit agencies are looking for ways to adapt to this rapidly changing environment. In this space, ridepooling has the potential to improve efficiency and reduce costs by allowing users to share rides in high-capacity vehicles and vans. Most transit agencies already operate various ridepooling services including microtransit and paratransit. However, the objectives and constraints for implementing these services vary greatly between agencies. This brings multiple challenges. First, off-the-shelf ridepooling formulations must be adapted for real-world conditions and constraints. Second, the lack of modular and reusable software makes it hard to implement and evaluate new ridepooling algorithms and approaches in real-world settings. Therefore, we propose an on-demand transportation scheduling software for microtransit and paratransit services. This software is aimed at transit agencies looking to incorporate state-of-the-art rideshare and ridepooling algorithms in their everyday operations. We provide management software for dispatchers and mobile applications for drivers and users. Lastly, we discuss the challenges in adapting state-of-the-art methods to real-world operations.

Wilbur, Michael↗

DOE OSTI2024

SmartTransit.AI: A Dynamic Paratransit and Microtransit Application

New rideshare and shared mobility services have transformed urban mobility in recent years. Such services have the potential to improve efficiency and reduce costs by allowing users to share rides in high-capacity vehicles and vans. Most transit agencies already operate various ridepooling services, including microtransit and paratransit. However, the objectives and constraints for implementing these services vary greatly between agencies and can be challenging. First, off-the-shelf ridepooling formulations must be adapted for real-world conditions and constraints. Second, the lack of modular and reusable software makes it hard to implement and evaluate new ridepooling algorithms and approaches in real-world settings. We demonstrate a modular on-demand public transportation scheduling software for microtransit and paratransit services. The software is aimed at transit agencies looking to incorporate state-of-the-art rideshare and ridepooling algorithms in their everyday operations. We provide management software for dispatchers and mobile applications for drivers and users and conclude with results from the demonstration in Chattanooga, TN.

Pavia, Sophie↗

DOE OSTI2023

Soft error-mitigating semiconductor design system and associated methods

A soft error-mitigating semiconductor design system and associated methods that tailor circuit design steps to mitigate corruption of data in storage elements (e.g., flip flops) due to Single Events Effects (SEEs). Required storage elements are automatically mapped to triplicated redundant nodes controlled by a voting element that enforces majority-voting logic for fault-free output (i.e., Triple Modular Redundancy (TMR)). Storage elements are also optimally positioned for placement in keeping with SEE-tolerant spacing constraints. Additionally, clock delay insertion (employing either a single global clock or clock triplication) in the TMR specification may introduce useful skew that protects against glitch propagation through the designed device. The resultant layout generated from the TMR configuration may relax constraints imposed on register transfer level (RTL) engineers to make rad-hard designs, as automation introduces TMR storage registers, memory element spacing, and clock delay/triplication with minimal designer input.

Miryala, Sandeep↗

DOE OSTI2024

Soft error-mitigating semiconductor design system and associated methods

Miryala, Sandeep↗

DOE OSTI2022

Numerical relativity simulations of the neutron star merger GW190425: microphysics and mass ratio effects

ABSTRACT GW190425 was the second gravitational wave (GW) signal compatible with a binary neutron star (BNS) merger detected by the Advanced LIGO and Advanced Virgo detectors. Since no electromagnetic counterpart was identified, whether the associated kilonova was too dim or the localization area too broad is still an open question. We simulate 28 BNS mergers with the chirp mass of GW190425 and mass ratio 1 ≤ q ≤ 1.67, using numerical-relativity simulations with finite-temperature, composition dependent equations of state (EOS) and neutrino radiation. The energy emitted in GWs is $\lesssim 0.083\mathrm{\, M_\odot }c^2$ with peak luminosity of 1.1–$2.4\times ~10^{58}/(1+q)^2\, {\rm {erg \, s^{-1}}}$. Dynamical ejecta and disc mass range between 5 × 10−6–10−3 and 10−5–$0.1 \mathrm{\, M_\odot }$, respectively. Asymmetric mergers, especially with stiff EOSs, unbind more matter and form heavier discs compared to equal mass binaries. The angular momentum of the disc is 8–$10\mathrm{\, M_\odot }~GM_{\rm {disc}}/c$ over three orders of magnitude in Mdisc. While the nucleosynthesis shows no peculiarity, the simulated kilonovae are relatively dim compared with GW170817. For distances compatible with GW190425, AB magnitudes are always dimmer than ∼20 mag for the B, r, and K bands, with brighter kilonovae associated to more asymmetric binaries and stiffer EOSs. We suggest that, even assuming a good coverage of GW190425’s sky location, the kilonova could hardly have been detected by present wide-field surveys and no firm constraints on the binary parameters or EOS can be argued from the lack of the detection.

79 ASTRONOMY AND ASTROPHYSICS↗