Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear constraints”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Data-Driven Optimal Control of Traffic Signals for Urban Road Networks

This paper studies the issue of data-driven optimal control design for traffic signals of oversaturated urban road networks. The signal control system based on the store and forward model is generally uncontrollable for which the controllable decomposition is needed. Instead of identifying the unknown parameters like saturation rates and turning ratios, a finite number of measured trajectories can be used to parametrize the system and help directly construct a transformation matrix for Kalman controllable decomposition through the fundamental lemma of J. C. Willems. On top of that, an infinite-horizon linear quadratic regulator (LQR) problem is formulated considering the constraints of green times for traffic signals. The problem can be solved through a two-phase data-driven learning process, where one solves an infinite-horizon unconstrained LQR problem and the other solves a finite-horizon constrained LQR problem. The simulation result shows the theoretical analysis is effective and the proposed data-driven controller can yield desired performance for reducing traffic congestion.

Liu, Tong↗
DOE OSTI2020

A Generalized Framework for Service Restoration in a Resilient Power Distribution System

An electric power grid is one of the complex infrastructures, and because of its complex nature, there is simply no way that outages can be completely avoided. Thus, a modern society that depends on reliable electric supply requires a resilient electric system that can recover from disruptions while integrating emerging smart grid technologies. Here, this article presents a novel approach for service restoration in a modern power distribution system with controllable switches and distributed generation (DG) resources for any kind of outage. The proposed framework supports both the traditional service restoration using feeder reconfiguration and the grid-forming DG-assisted intentional islands that are dynamically sized using algorithms based on the fault scenario, available resources, and priority of loads. The problem is formulated as a mixed-integer linear program that incorporates critical system connectivity and operating constraints. Simulations are performed to demonstrate the effectiveness of the proposed approach using a large-scale four-feeder 1069-bus three-phase unbalanced distribution test system. It is demonstrated that the framework is effective in utilizing all available resources in quickly restoring the power supply to improve resiliency during extreme events and is scalable for a large-scale unbalanced power distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗
DOE OSTI2026

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Here, this paper addresses stochastic charger location and allocation problems under queue congestion for last-mile delivery using electric vehicles (EVs). The objective is to decide where to open charging stations and how many chargers of each type to install, subject to budgetary and waiting-time constraints. We formulate the problem as a mixed-integer non-linear program, where each station-charger pair is modeled as a multiserver queue with stochastic arrivals and service times to capture the notion of waiting in fleet operations. The model is extremely large, with billions of variables and constraints for a typical metropolitan area; even loading the model in solver memory is difficult, let alone solving it. To address this challenge, we develop a Lagrangian-based dual decomposition framework that decomposes the problem by station and leverages parallelization on high-performance computing systems, where the subproblems are solved by using a cutting plane method and their solutions are collected at the master level. We also develop a three-step rounding heuristic to transform the fractional subproblem solutions into feasible integral solutions. Computational experiments on data from the Chicago metropolitan area with hundreds of thousands of households and thousands of candidate stations show that our approach produces high-quality solutions in cases where existing exact methods cannot even load the model in memory. We also analyze various policy scenarios, demonstrating that combining existing depots with newly built stations under multiagency collaboration substantially reduces costs and congestion. These findings offer a scalable and efficient framework for developing sustainable large-scale EV charging networks.

Capacity allocation↗
DOE OSTI2021

Parallelized POD-based suboptimal economic model predictive control of a state-constrained Boussinesq approximation

Motivated by an energy efficient building application, we want to optimize a quadratic cost functional subject to the Boussinesq approximation of the Navier-Stokes equations and to bilateral state and control constraints. Since the computation of such an optimal solution is numerically costly, we design an efficient strategy to compute a sub-optimal (but applicationally acceptable) solution with significantly reduced computational effort. We employ an economic Model Predictive Control (MPC) strategy to obtain a feedback control. The MPC sub-problems are based on a linear-quadratic optimal control problem subjected to mixed control and state constraints and a convection-diffusion equation, reduced with proper orthogonal decomposition. Finally, to solve each sub-problem, we apply a primal-dual active set strategy. The method can be fully parallelized, which enables the solution of large problems with real-world parameters.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Non-invertible defects from the Conway SCFT to K3 sigma models. Part I. General results

We initiate the study of supersymmetry-preserving topological defect lines (TDLs) in the Conway moonshine module V f♮ . We show that the tensor category of such defects, under suitable assumptions, admits a surjective but non-injective ring homomorphism into the ring of $\mathbb{Z}$-linear maps of the Leech lattice into itself. This puts strong constraints on possible defects and their quantum dimensions. We describe a simple construction of non-invertible TDLs from orbifolds of holomorphic (super)vertex operator algebras, which yields non-trivial examples of TDLs satisfying our main theorem. We conjecture a correspondence between four-plane-preserving TDLs in V f♮ and supersymmetry-preserving TDLs in K3 non-linear sigma models, which extends the correspondence between symmetry groups to the level of tensor category symmetry. We establish evidence for this conjecture by constructing non-invertible TDLs in special K3 non-linear sigma models.

Conformal Field Models in String Theory↗
DOE OSTI2023

Joint analysis of Dark Energy Survey Year 3 data and CMB lensing from SPT and P l a n c k . II. Cross-correlation measurements and cosmological constraints

Cross-correlations of galaxy positions and galaxy shears with maps of gravitational lensing of the cosmic microwave background (CMB) are sensitive to the distribution of large-scale structure in the Universe. Such cross-correlations are also expected to be immune to some of the systematic effects that complicate correlation measurements internal to galaxy surveys. We present measurements and modeling of the cross-correlations between galaxy positions and galaxy lensing measured in the first three years of data from the Dark Energy Survey with CMB lensing maps derived from a combination of data from the 2500 deg 2 SPT-SZ survey conducted with the South Pole Telescope and full-sky data from the Planck satellite. The CMB lensing maps used in this analysis have been constructed in a way that minimizes biases from the thermal Sunyaev Zel’dovich effect, making them well suited for cross-correlation studies. The total signal-to-noise of the cross-correlation measurements is 23.9 (25.7) when using a choice of angular scales optimized for a linear (nonlinear) galaxy bias model. Here we use the cross-correlation measurements to obtain constraints on cosmological parameters. For our fiducial galaxy sample, which consist of four bins of magnitude-selected galaxies, we find constraints of Ω m =0.272$^{+0.032}_{-0.052}$ and S 8 ≡σ8$\sqrt{Ω_m/0.3}$=0.736$^{+0.032}_{-0.028}$ (Ω m =0.245$^{+0.026}_{-0.044}$ and S 8 =0.734$^{+0.035}_{-0.028}$) when assuming linear (nonlinear) galaxy bias in our modeling. Considering only the cross-correlation of galaxy shear with CMB lensing, we find Ω m =0.270$^{+0.043}_{-0.061}$ and S 8 =0.740$^{+0.034}_{-0.029}$. Our constraints on S8 are consistent with recent cosmic shear measurements, but lower than the values preferred by primary CMB measurements from Planck.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Incremental Interval Assignment by Integer Linear Algebra with Improvements

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. Here we add vectors from the nullspace to improve the initial solution, maintaining Ax = b Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dark Energy Survey year 3 results: Constraints on cosmological parameters and galaxy-bias models from galaxy clustering and galaxy-galaxy lensing using the redMaGiC sample

We constrain cosmological parameters and galaxy-bias parameters using the combination of galaxy clustering and galaxy-galaxy lensing measurements from the Dark Energy Survey (DES) year-3 data. We describe our modeling framework and choice of scales analyzed, validating their robustness to theoretical uncertainties in small-scale clustering by analyzing simulated data. Using a linear galaxy-bias model and redMaGiC galaxy sample, we obtain 10% constraints on the matter density of the Universe. Here, we also implement a nonlinear galaxy-bias model to probe smaller scales that includes parametrization based on hybrid perturbation theory and find that it leads to a 17% gain in cosmological constraining power. We perform robustness tests of our methodology pipeline and demonstrate stability of the constraints to changes in the theory model. Using the redMaGiC galaxy sample as foreground lens galaxies and adopting the best-fitting cosmological parameters from DES year-1 data, we find the galaxy clustering and galaxy-galaxy lensing measurements to exhibit significant signals akin to decorrelation between galaxies and mass on large scales, which is not expected in any current models. This likely systematic measurement error biases our constraints on galaxy bias and the S 8 parameter. We find that a scale-, redshift- and sky-area-independent phenomenological decorrelation parameter can effectively capture this inconsistency between the galaxy clustering and galaxy-galaxy lensing. We trace the source of this correlation to a color-dependent photometric issue and minimize its impact on our result by changing the selection criteria of redMaGiC galaxies. Using this new sample, our constraints on the S 8 parameter are consistent with previous studies and we find a small shift in the Ω m constraints compared to the fiducial redMaGiC sample. We infer the constraints on the mean host-halo mass of the redMaGiC galaxies in this new sample from the large-scale bias constraints, finding the galaxies occupy halos of mass approximately 1.6 × 10 13 M ⊙ /h.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Physics-informed regularization and structure preservation for learning stable reduced models from data with operator inference

Operator inference learns low-dimensional dynamical-system models with polynomial nonlinear terms from trajectories of high-dimensional physical systems (non-intrusive model reduction). Here, this work focuses on the large class of physical systems that can be well described by models with quadratic and cubic nonlinear terms and proposes a regularizer for operator inference that induces a stability bias onto learned models. The proposed regularizer is physics informed in the sense that it penalizes higher-order terms with large norms and so explicitly leverages the polynomial model form that is given by the underlying physics. This means that the proposed approach judiciously learns from data and physical insights combined, rather than from either data or physics alone. Additionally, a formulation of operator inference is proposed that enforces model constraints for preserving structure such as symmetry and definiteness in linear terms. Numerical results demonstrate that models learned with operator inference and the proposed regularizer and structure preservation are accurate and stable even in cases where using no regularization and Tikhonov regularization leads to models that are unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Exploiting non-linear scales in galaxy–galaxy lensing and galaxy clustering: A forecast for the dark energy survey

ABSTRACT The combination of galaxy–galaxy lensing (GGL) and galaxy clustering is a powerful probe of low-redshift matter clustering, especially if it is extended to the non-linear regime. To this end, we use an N-body and halo occupation distribution (HOD) emulator method to model the redMaGiC sample of colour-selected passive galaxies in the Dark Energy Survey (DES), adding parameters that describe central galaxy incompleteness, galaxy assembly bias, and a scale-independent multiplicative lensing bias Alens. We use this emulator to forecast cosmological constraints attainable from the GGL surface density profile ΔΣ(rp) and the projected galaxy correlation function wp, gg(rp) in the final (Year 6) DES data set over scales $r_p=0.3\!-\!30.0\, h^{-1} \, \mathrm{Mpc}$. For a $3{{\ \rm per\ cent}}$ prior on Alens we forecast precisions of $1.9{{\ \rm per\ cent}}$, $2.0{{\ \rm per\ cent}}$, and $1.9{{\ \rm per\ cent}}$ on Ωm, σ8, and $S_8 \equiv \sigma _8\Omega _m^{0.5}$, marginalized over all halo occupation distribution (HOD) parameters as well as Alens. Adding scales $r_p=0.3\!-\!3.0\, h^{-1} \, \mathrm{Mpc}$ improves the S8 precision by a factor of ∼1.6 relative to a large scale ($3.0\!-\!30.0\, h^{-1} \, \mathrm{Mpc}$) analysis, equivalent to increasing the survey area by a factor of ∼2.6. Sharpening the Alens prior to $1{{\ \rm per\ cent}}$ further improves the S8 precision to $1.1{{\ \rm per\ cent}}$, and it amplifies the gain from including non-linear scales. Our emulator achieves per cent-level accuracy similar to the projected DES statistical uncertainties, demonstrating the feasibility of a fully non-linear analysis. Obtaining precise parameter constraints from multiple galaxy types and from measurements that span linear and non-linear clustering offers many opportunities for internal cross-checks, which can diagnose systematics and demonstrate the robustness of cosmological results.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

The effect of non-linear mutual friction on pulsar glitch sizes and rise times

ABSTRACT Observations of pulsar glitches have the potential to provide constraints on the dynamics of the high density interior of neutron stars. However, to do so, realistic glitch models must be constructed and compared to the data. We take a step towards this goal by testing non-linear models for the mutual friction force, which is responsible for the exchange of angular momentum between the neutron superfluid and the observable normal component in a glitch. In particular, we consider a non-linear dependence of the drag force on the relative velocity between superfluid vortices and the normal component, in which the contributions of both kelvin and phonon excitations are included. This non-linear model produces qualitatively new features, and is able to reproduce the observed bimodal distribution of glitch sizes in the pulsar population. The model also suggests that the differences in size distributions in individual pulsars may be due to the glitches being triggered in regions with different pinning strengths, as stronger pinning leads to higher vortex velocities and a qualitatively different mutual friction coupling with respect to the weak pinning case. Glitches in pulsars that appear to glitch quasi-periodically with similar sizes may thus be due to the same mechanisms as smaller events in pulsars that have no preferred glitch size, but simply originate in stronger pinning regions, possibly in the core of the star.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Integrate FARM with PID controllers: IES Simulation Ecosystem Control System Development

The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM was designed to support the HERON software module in the solution of the optimal dispatch problem for IES units. As the result of HERON-FARM dispatch simulation, the set-point trajectories are optimized to meet constraints on both the production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and the process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.) at a coarse time resolution (every 10 or 100 seconds) over long time horizons (several days or weeks). In case the operational constraints need to be met at finer time resolution, the computational burden of HERON-FARM would linearly increase with the sampling rate, and sub-optimal solutions might be obtained. System responses characterized by overshoots and damped oscillations temporarily violating the imposed constraints might occur during abrupt power transients. In this report, a hierarchical control system architecture for the operation of the Dynamic Energy Technology and Integration Laboratory (DETAIL) facility constructed at INL was proposed. First, the preliminary studies on the proposed control strategy for operating the facility and the designed PI controllers were reviewed. In particular, the current approach for generating the set-point trajectories was studied, and its limits were identified. To this aim, the inclusion of a Supervisory Control layer embedding a modified version of the FARM algorithm for preserving the system safe operation over both long and real-time horizons was proposed. In this way, FARM would be applied twice, i.e., the original version (“FARM Validator”) aiding the solution of the power dispatch problem, and the modified version (“FARM Supervisory” coordinating the PI controllers to address the real-time control tasks. Despite the kernel of the two modules is the same algorithm, their roles, tasks, and capabilities are quite different. A detailed description of the role of FARM at addressing low-level control tasks is provided, along with tentative operational procedures for training the models embedded into the algorithm by using the collected experimental data.

42 ENGINEERING↗
DOE OSTI2023

Constraining the Varied Response of Northern Hemisphere Winter Circulation Waviness to Climate Change

Abstract While a large latitudinal displacement of the westerly jet brings about disproportionate socioeconomic impacts over Northern Hemisphere midlatitude continents, it is not well understood as to whether the winter circulation will become wavier or less in response to climate change. Here, using observations and large ensembles of climate models, we show that changes in atmospheric waviness can be estimated from the optimal structures of the westerly jet for wavier circulation, which are obtained from an advection‐diffusion model. Thus, the changes in westerly jet structure in climate models under climate change provide a physical constraint on changes in atmospheric waviness, indicating that the North Atlantic wave activity will experience a robust decline in a warmer climate, while future North Pacific wave activity is obscured by model uncertainty rather than internal variability. These findings highlight the changes to jet stream structure as a constraint for regional circulation waviness in a changing climate.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Composite entanglement topology and extensional rheology of symmetric ring-linear polymer blends

Extensive molecular simulations are applied to characterize the equilibrium dynamics, entanglement topology, and nonlinear extensional rheology of symmetric ring-linear polymer blends with systematically varied ring fraction ϕR. Chains with degree of entanglement Z≈14 are mixed to produce 10 well-entangled systems with ϕR varying from neat linear to neat ring melts. Z is large enough that except for very large ϕR, the rings are threaded by multiple linear chains in equilibrium. Primitive path analysis is used to visualize and quantify the structure of the composite ring-linear entanglement network. We measure the quantity of ring-linear threading and linear-linear entanglement as a function of ϕR and identify with simple arguments a ring fraction ϕR≈0.4 where the topological constraints of the composite entanglement network are maximized. These topological analyses are used to rationalize the ϕR-dependence of ring and linear chain dynamics, conformations, and rheology. Simulations of startup uniaxial elongation flows demonstrate the extensional stress overshoot observed in recent filament stretching experiments and characterize how it depends on the blend composition and entanglement topology. The overshoot is driven by an overstretching and recoil of ring polymers due to the convective unthreading of rings from linear chains.

O’Connor, Thomas C.↗
DOE OSTI2021

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗