SEARCH · Search NASA

Results for “Constraint programming”

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 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Linear optimal power flow system and method

An electric power system or power grid is optimized using a computer-implemented tool the represents in computer memory the optimization function and at least one constraint, which the processor operates upon using a linear programming solver algorithm. The constraints are represented in memory as data structures that include both real and reactive power terms, corresponding to at least one of a power flow model and a transmission line model. The transmission line model is represented using a piecewise linear representation. The power flow model may also include for each node in the power system a real power loss term representing transmission line loss allocated to that node.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Phlex: Parallel, Hierarchical, and Layered EXecution of data-processing algorithms

Phlex is a computing framework supporting the parallel, hierarchical, and layered execution of data-processing algorithms. It is based on the functional-programming paradigm, thus guaranteeing thread-safety when invoking user-defined pure functions. Phlex allows users to specify arbitrary graph-based hierarchies of data organization, enabling more flexible processing of data as required by the constraints of the program.

Knoepfel, KyleJ. [Fermi National Accelerator Labor↗

NASA NTRS1990

A knowledge-based approach to configuration layout, justification, and documentation

The design, development, and implementation is described of a prototype expert system which could aid designers and system engineers in the placement of racks aboard modules on Space Station Freedom. This type of problem is relevant to any program with multiple constraints and requirements demanding solutions which minimize usage of limited resources. This process is generally performed by a single, highly experienced engineer who integrates all the diverse mission requirements and limitations, and develops an overall technical solution which meets program and system requirements with minimal cost, weight, volume, power, etc. This system architect performs an intellectual integration process in which the underlying design rationale is often not fully documented. This is a situation which lends itself to an expert system solution for enhanced consistency, thoroughness, documentation, and change assessment capabilities.

Craig, F. G.↗

NASA NTRS1991

A Knowledge-Based Approach to Configuration Layout, Justification, and Documentation

The design, development, and implementation of a prototype expert system which could aid designers and system engineers in the placement of racks aboard modules on the Space Station Freedom are described. This type of problem is relevant to any program with multiple constraints and requirements demanding solutions which minimize usage of limited resources. This process is generally performed by a single, highly experienced engineer who integrates all the diverse mission requirements and limitations, and develops an overall technical solution which meets program and system requirements with minimal cost, weight, volume, power, etc. This system architect performs an intellectual integration process in which the underlying design rationale is often not fully documented. This is a situation which lends itself to an expert system solution for enhanced consistency, thoroughness, documentation, and change assessment capabilities.

Craig, F. G.↗

DOE OSTI2016

SU-F-T-340: Direct Editing of Dose Volume Histograms: Algorithms and a Unified Convex Formulation for Treatment Planning with Dose Constraints

Purpose: To develop a procedure for including dose constraints in convex programming-based approaches to treatment planning, and to support dynamic modification of such constraints during planning. Methods: We present a mathematical approach that allows mean dose, maximum dose, minimum dose and dose volume (i.e., percentile) constraints to be appended to any convex formulation of an inverse planning problem. The first three constraint types are convex and readily incorporated. Dose volume constraints are not convex, however, so we introduce a convex restriction that is related to CVaR-based approaches previously proposed in the literature. To compensate for the conservatism of this restriction, we propose a new two-pass algorithm that solves the restricted problem on a first pass and uses this solution to form exact constraints on a second pass. In another variant, we introduce slack variables for each dose constraint to prevent the problem from becoming infeasible when the user specifies an incompatible set of constraints. We implement the proposed methods in Python using the convex programming package cvxpy in conjunction with the open source convex solvers SCS and ECOS. Results: We show, for several cases taken from the clinic, that our proposed method meets specified constraints (often with margin) when they are feasible. Constraints are met exactly when we use the two-pass method, and infeasible constraints are replaced with the nearest feasible constraint when slacks are used. Finally, we introduce ConRad, a Python-embedded free software package for convex radiation therapy planning. ConRad implements the methods described above and offers a simple interface for specifying prescriptions and dose constraints. Conclusion: This work demonstrates the feasibility of using modifiable dose constraints in a convex formulation, making it practical to guide the treatment planning process with interactively specified dose constraints. This work was supported by the Stanford BioX Graduate Fellowship and NIH Grant 5R01CA176553.

60 APPLIED LIFE SCIENCES↗

NASA NTRS1987

Dynamic delamination buckling in composite laminates under impact loading: Computational simulation

A unique dynamic delamination buckling and delamination propagation analysis capability has been developed and incorporated into a finite element computer program. This capability consists of the following: (1) a modification of the direct time integration solution sequence which provides a new analysis algorithm that can be used to predict delamination buckling in a laminate subjected to dynamic loading, and (2) a new method of modeling the composite laminate using plate bending elements and multipoint constraints. This computer program is used to predict both impact induced buckling in composite laminates with initial delaminations and the strain energy release rate due to extension of the delamination. It is shown that delaminations near the outer surface of a laminate are susceptible to local buckling and buckling-induced delamination propagation when the laminate is subjected to transverse impact loading. The capability now exists to predict the time at which the onset of dynamic delamination buckling occurs, the dynamic buckling mode shape, and the dynamic delamination strain energy release rate.

Grady, Joseph E.↗

NASA NTRS1989

Dynamic delamination buckling in composite laminates under impact loading - Computational simulation

Grady, Joseph E.↗

NASA NTRS1977

Shuttle's 160 hour ground turnaround - A design driver

Turnaround analysis added a new dimension to the Space Program with the advent of the Space Shuttle. The requirement to turn the flight hardware around in 160 working hours from landing to launch was a significant design driver and a useful tool in forcing the integration of flight and ground systems design to permit an efficient ground operation. Although there was concern that time constraints might increase program costs, the result of the analysis was to minimize facility requirements and simplify operations with resultant cost savings.

Widick, F.↗

DOE OSTI2021

Agent-based Disease Surveillance and Transmission Model

The SARS-CoV-2 pandemic has driven a need for models that can predict transmission among populations and test the effectiveness of proposed interventions to control it such as testing, quarantining, vaccinations, and nonpharmaceutical interventions. Some questions of interest include:1. How rapidly will the virus spread if no action is taken? 2. How frequently should people be tested and quarantined if necessary? 3. Should unvaccinated persons be tested more frequently than the vaccinated? 4. If test results are delayed, how will that affect the spread? 5. How do test false negative rates affect the overall efficacy of testing programs? 6. How do constraints on testing resources impact the overall efficacy of testing programs? 7. How does the patient’s failure to recognize COVID symptoms and quarantine affect the spread? 8. What level of vaccination coverage is needed to suppress the epidemic? 9. What is the risk of a large outbreak (probability exceeding x infections)? 10. What is the cost effectiveness of interventions (dollars per avoided infection)? This report describes the structure of a discrete event simulation model that provides actionable information to address these questions. Parameter inputs and results of analyses have been reported in briefings provided to LLNL management and are not discussed here.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1994

Damage-Mitigating Control of Space Propulsion Systems for High Performance and Extended Life

A major goal in the control of complex mechanical system such as spacecraft rocket engine's advanced aircraft, and power plants is to achieve high performance with increased reliability, component durability, and maintainability. The current practice of decision and control systems synthesis focuses on improving performance and diagnostic capabilities under constraints that often do not adequately represent the materials degradation. In view of the high performance requirements of the system and availability of improved materials, the lack of appropriate knowledge about the properties of these materials will lead to either less than achievable performance due to overly conservative design, or over-straining of the structure leading to unexpected failures and drastic reduction of the service life. The key idea in this report is that a significant improvement in service life could be achieved by a small reduction in the system dynamic performance. The major task is to characterize the damage generation process, and then utilize this information in a mathematical form to synthesize a control law that would meet the system requirements and simultaneously satisfy the constraints that are imposed by the material and structural properties of the critical components. The concept of damage mitigation is introduced for control of mechanical systems to achieve high performance with a prolonged life span. A model of fatigue damage dynamics is formulated in the continuous-time setting, instead of a cycle-based representation, for direct application to control systems synthesis. An optimal control policy is then formulated via nonlinear programming under specified constraints of the damage rate and accumulated damage. The results of simulation experiments for the transient upthrust of a bipropellant rocket engine are presented to demonstrate efficacy of the damage-mitigating control concept.

Ray, Asok↗

DOE OSTI2017

pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations

We describe pyomo.dae, an open source Python-based modeling framework that enables high-level abstract specification of optimization problems with differential and algebraic equations. The pyomo.dae framework is integrated with the Pyomo open source algebraic modeling language, and is available at http://www.pyomo.org. One key feature of pyomo.dae is that it does not restrict users to standard, predefined forms of differential equations, providing a high degree of modeling flexibility and the ability to express constraints that cannot be easily specified in other modeling frameworks. Other key features of pyomo.dae are the ability to specify optimization problems with high-order differential equations and partial differential equations, defined on restricted domain types, and the ability to automatically transform high-level abstract models into finite-dimensional algebraic problems that can be solved with off-the-shelf solvers. Moreover, pyomo.dae users can leverage existing capabilities of Pyomo to embed differential equation models within stochastic and integer programming models and mathematical programs with equilibrium constraint formulations. Collectively, these features enable the exploration of new modeling concepts, discretization schemes, and the benchmarking of state-of-the-art optimization solvers.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2008

Life Support Systems for Lunar Landers

Engineers designing life support systems for NASA s next Lunar Landers face unique challenges. As with any vehicle that enables human spaceflight, the needs of the crew drive most of the lander requirements. The lander is also a key element of the architecture NASA will implement in the Constellation program. Many requirements, constraints, or optimization goals will be driven by interfaces with other projects, like the Crew Exploration Vehicle, the Lunar Surface Systems, and the Extravehicular Activity project. Other challenges in the life support system will be driven by the unique location of the vehicle in the environments encountered throughout the mission. This paper examines several topics that may be major design drivers for the lunar lander life support system. There are several functional requirements for the lander that may be different from previous vehicles or programs and recent experience. Some of the requirements or design drivers will change depending on the overall Lander configuration. While the configuration for a lander design is not fixed, designers can examine how these issues would impact their design and be prepared for the quick design iterations required to optimize a spacecraft.

Anderson, Molly↗

DOE OSTI2025

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗

NASA NTRS2018

Quantification of Dynamic Model Validation Metrics Using Uncertainty Propagation from Requirements

The Space Launch System, NASA's new large launch vehicle for long range space exploration, is presently in the final design and construction phases, with the first launch scheduled for 2019. A dynamic model of the system has been created and is critical for calculation of interface loads and natural frequencies and mode shapes for guidance, navigation, and control (GNC). Because of the program and schedule constraints, a single modal test of the SLS will be performed while bolted down to the Mobile Launch Pad just before the first launch. A Monte Carlo and optimization scheme will be performed to create thousands of possible models based on given dispersions in model properties and to determine which model best fits the natural frequencies and mode shapes from modal test. However, the question still remains as to whether this model is acceptable for the loads and GNC requirements. An uncertainty propagation and quantification (UP and UQ) technique to develop a quantitative set of validation metrics that is based on the flight requirements has therefore been developed and is discussed in this paper. There has been considerable research on UQ and UP and validation in the literature, but very little on propagating the uncertainties from requirements, so most validation metrics are "rules-of-thumb;" this research seeks to come up with more reason-based metrics. One of the main assumptions used to achieve this task is that the uncertainty in the modeling of the fixed boundary condition is accurate, so therefore that same uncertainty can be used in propagating the fixed-test configuration to the free-free actual configuration. The second main technique applied here is the usage of the limit-state formulation to quantify the final probabilistic parameters and to compare them with the requirements. These techniques are explored with a simple lumped spring-mass system and a simplified SLS model. When completed, it is anticipated that this requirements-based validation metric will provide a quantified confidence and probability of success for the final SLS dynamics model, which will be critical for a successful launch program, and can be applied in the many other industries where an accurate dynamic model is required.

Brown, Andrew M.↗

NASA NTRS2019

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗

DOE OSTI2023

Machine learning-based jet and event classification at the Electron-Ion Collider with applications to hadron structure and spin physics

We explore machine learning-based jet and event identification at the future Electron-Ion Collider (EIC). We study the effectiveness of machine learning-based classifiers at relatively low EIC energies, focusing on (i) identifying the flavor of the jet and (ii) identifying the underlying hard process of the event. We propose applications of our machine learning-based jet identification in the key research areas at the future EIC and current Relativistic Heavy Ion Collider program, including enhancing constraints on (transverse momentum dependent) parton distribution functions, improving experimental access to transverse spin asymmetries, studying photon structure, and quantifying the modification of hadrons and jets in the cold nuclear matter environment in electron-nucleus collisions. We establish first benchmarks and contrast the estimated performance of flavor tagging at the EIC with that at the Large Hadron Collider. We perform studies relevant to aspects of detector design including particle identification, charge information, and minimum transverse momentum capabilities. Additionally, we study the impact of using full event information instead of using only information associated with the identified jet. These methods can be deployed either on suitably accurate Monte Carlo event generators, or, for several applications, directly on experimental data. We provide an outlook for ultimately connecting these machine learning-based methods with first principles calculations in quantum chromodynamics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2018

A method to improve prediction of secondary structure for large single RNA sequences

The function of a particular RNA molecule within an organic system is principally determined by its structure. The current physical methods available for structure determination are time consuming and expensive. Hence, computational methods for structure prediction are often used. }The prediction of the structure of a large single sequence of RNA needs a lot of research work. In the present work, a method is introduced to improve the prediction of large single sequence RNA secondary structure obtained by Mfold program using the concept of minimum free energy. The Mfold program contains a constraint option that allows forcing some helices in the predicted structure. In our method, some of the firstly formed hairpins that are expected, by a statistical study, to be present in the real structure are forced in the Mfold predicted structure. The results show improvement, toward the real structure, in the Mfold predicted structure and this gives evidence to the RNA kinetic folding.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2018

A link-node reformulation of ridesharing user equilibrium with network design

Though the conventional network design is extensively studied, the network design problem for ridesharing, in particular, the deployment of high-occupancy toll (HOT) lanes, remains understudied. Here this paper focuses on one type of network design problem as to whether existing roads should be retrofit into HOT lanes. It is a continuous bi-level mathematical program with equilibrium constraints. The lower level problem is ridesharing user equilibrium (RUE). To reduce the problem size and facilitate computation, we reformulate RUE in the link-node representation. Then we extend the RUE framework to accommodate the presence of HOT lanes and tolls. Algorithms are briefly discussed and numerical examples are illustrated on the Braess network and the Sioux Falls network, respectively. Results show that carefully selecting the deployment of HOT lanes can improve the overall system travel time.

42 ENGINEERING↗