Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint handling”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1984

A new minimax algorithm

The representation min t s.t. F(I)(x). - t less than or equal to 0 for all i is examined. An active set strategy is designed of functions: active, semi-active, and non-active. This technique will help in preventing zigzagging which often occurs when an active set strategy is used. Some of the inequality constraints are handled with slack variables. Also a trust region strategy is used in which at each iteration there is a sphere around the current point in which the local approximation of the function is trusted. The algorithm is implemented into a successful computer program. Numerical results are provided.

Vardi, A.↗
NASA NTRS1988

Performance limits for optimal microburst encounter

An effort has been made to ascertain the envelope-edges for uneventful aircraft penetrations of microburst windshears on the basis of optimal aircraft control strategies. Over 1100 such trajectories have been computed for contemporary airliners and general aviation aircraft, in the case of idealized microbursts, using a successive quadratic program trajectory optimization algorithm able to directly handle inequality constraints. Variations of optimal performance with microburst type, intensity, length scale, and location, define performance limits; these limits fall into short, intermediate, and long microburst length scale regimes. The ability to safely transit a microburst also varies strongly with microburst location.

Psiaki, Mark L.↗
NASA NTRS1988

A dynamic case-based planning system for space station application

We are currently investigating the use of a case-based reasoning approach to develop a dynamic planning system. The dynamic planning system (DPS) is designed to perform resource management, i.e., to efficiently schedule tasks both with and without failed components. This approach deviates from related work on scheduling and on planning in AI in several aspects. In particular, an attempt is made to equip the planner with an ability to cope with a changing environment by dynamic replanning, to handle resource constraints and feedback, and to achieve some robustness and autonomy through plan learning by dynamic memory techniques. We briefly describe the proposed architecture of DPS and its four major components: the PLANNER, the plan EXECUTOR, the dynamic REPLANNER, and the plan EVALUATOR. The planner, which is implemented in Smalltalk, is being evaluated for use in connection with the Space Station Mobile Service System (MSS).

Oppacher, F.↗
NASA NTRS1991

Time variant analysis of large scale constrained rotorcraft systems dynamics - An exploitation of IBM-3090 vector-processor's pipe-lining feature

A generalized algorithmic procedure is presented for handling the constraints in transmissions, which are treated as a multibody system of interconnected rigid/flexible bodies. The type of constraints are classified based on the interconnection of the bodies, assuming one or more points of contact to exist between them. The method is explained through flow charts and configuration/interaction tables. A significant increase in speed of execution is achieved by vectorizing the developed code in computationally intensive areas. The study of an example consisting of two meshing disks rotating at high angular velocity is carried out. The dynamic behavior of the constraint forces associated with the generalized coordinates of the system are plotted by selecting various modes. Applications are intended for the study of dynamic and subsequent prediction of constraint forces at the gear teeth contacting points in helicopter transmissions with the aim of improving performance dependability.

Amirouche, F. M. L.↗
NASA NTRS2003

XV-15 Tiltrotor Aircraft: 1999 Acoustic Testing - Test Report

An XV-15 acoustic test is discussed, and measured results are presented. The test was conducted by NASA Langley and Bell Helicopter Textron, Inc., during October 1999, at the BHTI test site near Waxahachie, Texas. As part of the NASA-sponsored Short Haul Civil Tiltrotor noise reduction initiative, this was the third in a series of three major XV-15 acoustic tests. Their purpose was to document the acoustic signature of the XV-15 tiltrotor aircraft for a variety of flight conditions and to minimize the noise signature during approach. Tradeoffs between flight procedures and the measured noise are presented to illustrate the noise abatement flight procedures. The test objectives were to support operation of future tiltrotors by further developing and demonstrating low-noise flight profiles, while maintaining acceptable handling and ride qualities, and refine approach profiles, selected from previous (1995 & 1997) tiltrotor testing, to incorporate Instrument Flight Rules (IFR), handling qualities constraints, operations and tradeoffs with sound. Primary emphasis was given to the approach flight conditions where blade-vortex interaction (BVI) noise dominates, because this condition influences community noise impact more than any other. An understanding of this part of the noise generating process could guide the development of low noise flight operations and increase the tiltrotor's acceptance in the community.

Edwards, Bryan D.↗
NASA NTRS2003

XV-15 Tiltrotor Aircraft: 1997 Acoustic Testing

XV-15 acoustic test is discussed, and measured results are presented. The test was conducted by NASA Langley and Bell Helicopter Textron, Inc., during June - July 1997, at the BHTI test site near Waxahachie, Texas. This was the second in a series of three XV-15 tests to document the acoustic signature of the XV-15 tiltrotor aircraft for a variety of flight conditions and minimize the noise signature during approach. Tradeoffs between flight procedures and the measured noise are presented to illustrate the noise abatement flight procedures. The test objectives were to: (1) support operation of future tiltrotors by further developing and demonstrating low-noise flight profiles, while maintaining acceptable handling and ride qualities, and (2) refine approach profiles, selected from previous (1995) tiltrotor testing, to incorporate Instrument Flight Rules (IFR), handling qualities constraints, operations and tradeoffs with sound. Primary emphasis was given to the approach flight conditions where blade-vortex interaction (BVI) noise dominates, because this condition influences community noise impact more than any other. An understanding of this part of the noise generating process could guide the development of low noise flight operations and increase the tiltrotor's acceptance in the community.

Edwards, Bryan D.↗
DOE OSTI2024

Gains in operational flexibility, safety margins, and cost efficiencies via integrated Plant Reload Optimization platform

The U.S. Department of Energy Light Water Reactor Sustainability Program Risk-Informed Systems Analysis Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimizing core design. Optimizing the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible core configuration options, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization platform, which supports artificial-intelligence-based reactor core designing, is now fully capable of handling realistic problems. The Plant ReLoad Optimization platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual ENvironment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multiobjective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Pressurized-Water Reactor Core Design using Multi-Objective Plant Fuel Reload Optimization Platform

The United States (U.S.) Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program Risk-Informed Systems Analysis (RISA) Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimization of core design. The optimization of the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible options of core configuration, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization (PRLO) platform which supports artificial-intelligence-based reactor core designing is now fully capable of handling realistic problems. The PRLO Platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm-II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual Environment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multi-objective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

42 ENGINEERING↗
NASA NTRS2021

Integrated Demand Management Techport Closeout

Over the period 2016 to 2020, Integrated Demand Management (IDM) concept, procedures, and tools have been developed - first for clear-weather and a single airport constraint and then expanded to handle a multi-constraint problem during convective weather at Newark (EWR), LaGuardia (LGA) and Philadelphia (PHL) airports. The concept was evaluated in a series of human-in-the-loop simulations to confirm concept benefits in terms of better schedule predictability, reduction of delays, and increased throughput, especially during convective weather. In addition, other conditions with mixed participation of multi-trajectories from the airlines were evaluated that showed significant benefits to the individual airlines as well as the overall traffic flow. The IDM concept was initiated in the SMART-NAS project, was completed under the ATM-X project, and was developed collaboratively with the FAA and airline partners. Over the course of IDM development, NASA researchers produced 19 conference papers and publications. Outside supporting organizations, funded by IDM, produced 20 additional conference papers and publications, in which they advanced fundamental research on topics such as better stochastic traffic demand prediction, and application of machine learning techniques for modeling traffic management initiatives. Final concept procedures and tool specifications have been transferred to the FAA Air Traffic Organization Operational Concepts, Validation, and Requirements group.

William N Chan↗
NASA NTRS2002

Universal Quantification in a Constraint-Based Planner

Constraints and universal quantification are both useful in planning, but handling universally quantified constraints presents some novel challenges. We present a general approach to proving the validity of universally quantified constraints. The approach essentially consists of checking that the constraint is not violated for all members of the universe. We show that this approach can sometimes be applied even when variable domains are infinite, and we present some useful special cases where this can be done efficiently.

Golden, Keith↗
NASA NTRS2012

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗
DOE OSTI2021

pnnl/neural_ODE_ICLR2020

We show how to model discrete ordinary differential equations (ODE) with algebraic nonlinearities as deep neural networks with varying degrees of prior knowledge. We derive the stability guarantees of the network layers based on the implicit constraints imposed on the weight's eigenvalues. Moreover, we show how to use barrier methods to generically handle additional inequality constraints. We demonstrate the prediction accuracy of learned neural ODEs evaluated on open-loop simulations compared to ground truth dynamics with bi-linear terms.

Tuor, Aaron↗
NASA NTRS1991

Minimum fuel coplanar aeroassisted orbital transfer using collocation and nonlinear programming

The fuel optimal control problem arising in coplanar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) without plane change. The basic approach here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the coplanar aeroassisted HEO to LEO orbit transfer consists of three phases. In the first phase, the transfer begins with a deorbit impulse at HEO which injects the vehicle into a elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and drag modulation to satisfy heating constraints and to exit the atmosphere with the desired flight path angle and velocity so that the apogee of the exit orbit is the altitude of the desired LEO. Finally, the second impulse is required to circularize the orbit at LEO. The performance index is maximum final mass. Simulation results show that the coplanar aerocapture is quite different from the case where orbital plane changes are made inside the atmosphere. In the latter case, the vehicle has to penetrate deeper into the atmosphere to perform the desired orbital plane change. For the coplanar case, the vehicle needs only to penetrate the atmosphere deep enough to reduce the exit velocity so the vehicle can be captured at the desired LEO. The peak heating rates are lower and the entry corridor is wider. From the thermal protection point of view, the coplanar transfer may be desirable. Parametric studies also show the maximum peak heating rates and the entry corridor width are functions of maximum lift coefficient. The problem is solved using a direct optimization technique which uses piecewise polynomial representation for the states and controls and collocation to represent the differential equations. This converts the optimal control problem into a nonlinear programming problem which is solved numerically by using a modified version of NPSOL. Solutions were obtained for the described problem for cases with and without heating constraints. The method appears to be more robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun Yuan↗
DOE OSTI2020

Simulating sticky particles: A Monte Carlo method to sample a stratification

Many problems in materials science and biology involve particles interacting with strong, short-ranged bonds that can break and form on experimental timescales. Treating such bonds as constraints can significantly speed up sampling their equilibrium distribution, and there are several methods to sample probability distributions subject to fixed constraints. We introduce a Monte Carlo method to handle the case when constraints can break and form. More generally, the method samples a probability distribution on a stratification: a collection of manifolds of different dimensions, where the lower-dimensional manifolds lie on the boundaries of the higher-dimensional manifolds. We show several applications of the method in polymer physics, self-assembly of colloids, and volume calculation in high dimensions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1990

Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun. Y.↗
NASA NTRS1991

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗
DOE OSTI2022

Diagnostics for Burning Plasmas

Here, recent progress in the design and manufacturing development of in-vessel diagnostic components by the U.S. ITER team is reported. Design and manufacturing choices are driven by engineering challenges stemming from ITER’s burning plasma mission, which entails levels of plasma neutron emission, pulse lengths, and size scales well beyond the existing database. Challenges include port access limitations, neutron irradiation and activation risks, nuclear heating of components, complex interfaces, remote handling compatibility, and constraints on component and processing materials. Responses to these challenges are presented using examples from the low field side reflectometer, toroidal interferometer polarimeter, and electron cyclotron emission diagnostics. Relevance of the experience from ITER diagnostics engineering to the design of future integrated fusion facilities based on burning plasmas is addressed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗