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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS1986

Constraints on dark matter from cosmic background anisotropies

The major stages in the linear evolution of the statistical ensemble of adiabatic fluctuations in radiation, baryons, and dark matter are discussed. If it is assumed that the distribution of light emitters (i.e., of galaxies) follows the distribution of mass (i.e., of dark matter), then universes dominated by massive collisionless relics of the Big Bang must have Omega larger than 0.2 h exp -4/3 to avoid exceeding the current observational limits on small-scale anisotropies in the microwave background. However, values of Omega of about 0.2 are indicated by dynamical studies of galaxy clustering. It is concluded that universes dominated by cold dark matter in which light traces mass are probably not viable models.

Bond, J. R.↗
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↗
NASA NTRS2009

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗
NASA NTRSDate not supplied

An Optimization Approach to Support Science Decision Making for Lunar Surface Exploration

Introduction: Scientific exploration is one of the three pillars of NASA’s Moon2Mars architecture, with crew surface extra vehicular activities (EVA) serving a critical enabling function. Development of surface EVA operational planning and execution, specifically integrating science and flight control teams (FCT), is currently being explored through analog scenarios. This integration, exercised, for example, through the Joint EVA and Hu-man Surface Mobility Test Team (JETT), allows for science input on EVA activities in near real-time through a Science Evaluation Room (SER), or Arte-mis science backroom, which integrates with the broader FCT through the Science Officer. The SER works within the FCT to support dynamic EVA planning in response to changes in operational constraints as well as science opportunities and re-prioritization, increasing the mission science return and accelerating the accomplishment of the Moon2Mars science objectives. The SER works within the FCT to provide recommendations to traverse execution in near real-time. One challenge is the requirement to deliver SER inputs to the FCT on operationally relevant timelines. Failure to do so may result in suboptimal execution of science exploration EVAs or even loss of key science objectives. To close this gap, we present a network optimization tool to allow the SER to provide rapid input to the FCT in response to changes in operational constraints or science opportunities. Inputs are predicated on approved science objectives, and clear rationale must be provided to the FCT for any requested change. Accordingly, this tool incorporates the Science Traceability Matrix (STM), SER prioritization scheme, and station characterization and action planning with operational constraints such as duration, traverse speed, and distance to maximize science objectives based on SER priorities, consistent with FCT operational requirements. Method: As a proof of concept, we used an existing linear programing software package used to simulate optimal routes through cellular metabolism. We built a Demonstrative Model with three STM objectives and four stations on a region of the Moon. The objectives were given an arbitrary prioritization and mapped to the stations through four possible crew actions. (Figs. 1 and 2). This station to STM mapping is consistent with the method used by the JETT5 Science Team to develop analog surface EVA science planning. We used a grid system with the landing site at the origin and the four stations placed across the positive x,y quadrant. Actions were assigned to each station and the accomplishment of those actions resulted in a numerical “reward” based on the ability of that action to achieve science objectives. The aggregate reward from each individual STM objective contributes to a global score (Science Yield), weighted by its priority. Operational constraints included a requirement to start and end at the landing site, 5 minutes each for initial station characterization and “clean up,” and variable total EVA time, traverse rate (fixed to 0.5 meters per second in our example), and time to perform each action (10, 5, 7, and 15 min for actions 1, 2, 3, and 4, respectively). Additional constraints and variables will be added in the future (e.g., sample mass, number of stations, traverse route constraints, illumination). Optimization. We converted the connections (arcs) between these stations (nodes) into a mixed integer linear programming optimization problem (arcs = constraints, nodes = variables) with the objective to maximize Science Yield. For any action, the Science Yield is equal to the relevance of that action to an STM objective [3, 2, and 1 point(s) for High, Med., and Low relevance, respectively], multiplied by the STM Objective Priority [3, 2, and 1 point(s) for High, Med., and Low priority, respectively]. This resulted in a model that computes the optimal station and action combination to maximize the Science Yield. These weightings can be adjusted by the SER as desired. Results: We explored three test cases for the Demonstrative Model. First, we set the maximum EVA duration to 120 minutes and computed the optimal route (Fig. 3A). The model suggested per-forming Actions 1 and 2 at Station P01, followed by Actions 1 and 2 at Station P02, and finally Actions 1 and 3 at Station P04 before returning to the Landing Site. Second, we adjusted the STM Objective Priori-ty order and computed the new optimal route (Fig. 3B). Under this situation, the model suggested per-forming all Actions at Station P02 followed by all Actions at Station P03. The previous test cases were relevant to SER planning activities. Next, we explored providing mid-EVA replanning input to the FCT. Scenario: While executing the Route in Fig. 3A the crew finishes at Station P01 and FCT decides that the EVA needs to finish in 45 minutes back at the Landing Site. FCT asks SER to recommend changes to the plan to accommodate this operation-al change. Using the model and incorporating these new constraints (start at Station P01, max. time of 45 min), the model suggested performing Actions 2 and 4 at Station P03 (Fig. 4), requiring 41 minutes to complete and return to the Landing Site. Interestingly, Station 3 was not part of the original route. Using the model, we determined the EVA would need 66 minutes, instead of 45, in order for the original Station P04 to yield a larger Science Yield than Station P03. The parametrization and simulation was per-formed in less than a minute, demonstrating the operational relevance of the approach. Future Efforts: The results from the Demonstrative Model suggest this tool can accelerate SER decision making on operationally relevant timelines. Use in analog activities, such as JETT5 or follow-ons, which have over a dozen stations for a crew to explore and over a dozen actions per station, will provide needed validation of the utility of this tool for planning EVAs, replanning mid-EVA, or planning follow-on EVAs based on previous results. Further integration with FCT execution monitoring tools may provide additional efficiency gains, al-lowing rapid and iterative exploration of operation-al and science decision space by the FCT and SER.

Science Operations↗
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↗
NASA NTRSDate not supplied

Robust Trajectory Design for Rendezvous in a Near Rectilinear Halo Orbit

Future NASA Artemis missions will require complex docking plans between the Orion capsule and Lunar Gateway that meet predetermined safety constraints while minimizing fuel usage and state uncertainty at rendezvous. In this paper, linear covariance analysis is applied to a first order relative form of Near-Rectilinear Halo Orbit dynamics to determine the nominal trajectories and state dispersions associated with various maneuver profiles in the Sun-referenced Local Vertical Local Horizontal reference frame of the lunar Gateway. These maneuver profiles are optimized using a particle swarm optimizer and direct search algorithm to find trajectories that satisfy approach corridor, free drift, velocity magnitude, under-burn, and maneuver transfer time safety constraints to 3-sigma certainty.

Linear Covariance Analysis↗
NASA NTRS1991

Periodic trim solutions with HP-version finite elements in time

Finite Element in Time has been proven to be a powerful alternative solving strategy for the rotor craft trim problem. Additionally, Finite Element Method in Time has been developed in various versions like time-marching framework, Galerkin framework, Rayleigh-Ritz framework, and mixed formulation. Recently, this method was applied to the rotorcraft trim problem to obtain linearized solutions. The rotorcraft trim problem consists of trying to find a period solution for period-coefficient, differential equations subject to side constraints where certain force and momentum balance equations are forced to be equal to zero. There are free (or trim) parameters that are chosen to meet these side constraints. This project aims at expanding the application, in terms of the rotorcraft trim problem, from a linearized solution to nonlinear solution.

Source record↗
NASA NTRS1976

On the design of optimal controllers with certain structural constraints

This paper considers the problem of designing certain structurally constrained optimal regulators for linear systems subjected to additive white process noise and measurement noise. Three types of controller structures are considered, using direct output feedback, prespecified time constant filters, and optimal dynamic compensators. Necessary conditions are obtained for minimizing quadratic performance criteria. The techniques are demonstrated by application to a helicopter/slung load system, and a flexible space station.

Joshi, S. M.↗
NASA NTRS1983

Closed-form solutions for feedback control with terminal constraints

The problem of closed-loop control of maneuvers between two states for linear dynamical systems, subject to an arbitrarily specified terminal state, is considered. The feedback controller design is based on finite-time quadratic regulator theory. Closed-form expressions for the optimal control law are developed. Solutions are presented for both conventional and smoothed control profiles with fixed and/or free end condition problems. In the maneuvers using control-rate penalties, smooth profiles are generated throughout the maneuvers, in the sense that the initial condition jump discontinuities have been eliminated. Several examples involving large-angle maneuvers of a spacecraft are demonstrated. Results include control maneuvers from one state to another such as rest to rest and spin to rest, which effectively justify the solutions developed in this paper.

Juang, J.-N.↗
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↗
NASA NTRS1975

The auxiliary problem for feasible directions

The present work compares the computational efficiency of two means of determining a direction vector S at constraint boundaries and demonstrates the advantages of using the alternative that formulates the S-determination subproblem with a single quadratic constraint, which in turn can be cast as a special linear problem and solved directly.

Gwin, L. B.↗
NASA NTRS1989

Coordination of two redundant robots

A solution is presented for the optimal force distributions of two redundant coordinating robots. Two robots whose end-effectors firmly grasp a common inertial load form a closed-chain structure, and thus the robots must observe a set of constraint conditions on (1) the end-effector positions, orientations, linear and angular velocities and (2) the forces and torques inserted onto the end-effectors by the load. To achieve the maximum load capability, the optimal force distribution under the known posture is developed. If the robots are redundant, joint solutions may be obtained if some optimization criterion such as manipulability is imposed. The singularity, manipulability, and force ellipsoids are investigated in terms of the two manipulator Jacobian matrices. The manipulability is shown to correspond to the cascade structure, while the force ellipsoid corresponds to the parallel structure in terms of the manipulator Jacobian matrices.

Tao, Jian M.↗