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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

A Framework for Dynamic Constraint Reasoning Using Procedural Constraints

Many complex real-world decision and control problems contain an underlying constraint reasoning problem. This is particularly evident in a recently developed approach to planning, where almost all planning decisions are represented by constrained variables. This translates a significant part of the planning problem into a constraint network whose consistency determines the validity of the plan candidate. Since higher-level choices about control actions can add or remove variables and constraints, the underlying constraint network is invariably highly dynamic. Arbitrary domain-dependent constraints may be added to the constraint network and the constraint reasoning mechanism must be able to handle such constraints effectively. Additionally, real problems often require handling constraints over continuous variables. These requirements present a number of significant challenges for a constraint reasoning mechanism. In this paper, we introduce a general framework for handling dynamic constraint networks with real-valued variables, by using procedures to represent and effectively reason about general constraints. The framework is based on a sound theoretical foundation, and can be proven to be sound and complete under well-defined conditions. Furthermore, the framework provides hybrid reasoning capabilities, as alternative solution methods like mathematical programming can be incorporated into the framework, in the form of procedures.

Jonsson, Ari K.↗
NASA NTRS1988

Experiment scheduling for Spacelab missions

The Experiment Scheduling Program (ESP) is the heart of a group of programs developed at NASA-Marshall to schedule the experiment activities of Spacelab and other Shuttle missions. Other programs in the group either prepare input data for ESP or produce derivative information based on the schedule produced by ESP. The task of experiment scheduling can be simply stated as positioning the experiment activities in a mission to that they collect their desired data without interfering with other activities. The program's capabilities as seen by the user are described along with mission constraints the program handles, and how the expert system in the program handles these constraints.

Jaap, John↗
NASA NTRS1996

A Higher Harmonic Optimal Controller to Optimise Rotorcraft Aeromechanical Behaviour

Three methods to optimize rotorcraft aeromechanical behavior for those cases where the rotorcraft plant can be adequately represented by a linear model system matrix were identified and implemented in a stand-alone code. These methods determine the optimal control vector which minimizes the vibration metric subject to constraints at discrete time points, and differ from the commonly used non-optimal constraint penalty methods such as those employed by conventional controllers in that the constraints are handled as actual constraints to an optimization problem rather than as just additional terms in the performance index. The first method is to use a Non-linear Programming algorithm to solve the problem directly. The second method is to solve the full set of non-linear equations which define the necessary conditions for optimality. The third method is to solve each of the possible reduced sets of equations defining the necessary conditions for optimality when the constraints are pre-selected to be either active or inactive, and then to simply select the best solution. The effects of maneuvers and aeroelasticity on the systems matrix are modelled by using a pseudo-random pseudo-row-dependency scheme to define the systems matrix. Cases run to date indicate that the first method of solution is reliable, robust, and easiest to use, and that it was superior to the conventional controllers which were considered.

Leyland, Jane Anne↗
NASA NTRS1990

Managing temporal relations

Various temporal constraints on the execution of activities are described, and their representation in the scheduling system MAESTRO is discussed. Initial examples are presented using a sample activity described. Those examples are expanded to include a second activity, and the types of temporal constraints that can obtain between two activities are explored. Soft constraints, or preferences, in activity placement are discussed. Multiple performances of activities are considered, with respect to both hard and soft constraints. The primary methods used in MAESTRO to handle temporal constraints are described as are certain aspects of contingency handling with respect to temporal constraints. A discussion of the overall approach, with indications of future directions for this research, concludes the study.

Britt, Daniel L.↗
NASA NTRS2015

Level-Set Topology Optimization with Aeroelastic Constraints

Level-set topology optimization is used to design a wing considering skin buckling under static aeroelastic trim loading, as well as dynamic aeroelastic stability (flutter). The level-set function is defined over the entire 3D volume of a transport aircraft wing box. Therefore, the approach is not limited by any predefined structure and can explore novel configurations. The Sequential Linear Programming (SLP) level-set method is used to solve the constrained optimization problems. The proposed method is demonstrated using three problems with mass, linear buckling and flutter objective and/or constraints. A constraint aggregation method is used to handle multiple buckling constraints in the wing skins. A continuous flutter constraint formulation is used to handle difficulties arising from discontinuities in the design space caused by a switching of the critical flutter mode.

Dunning, Peter D.↗
NASA NTRS1983

Optimization methods applied to hybrid vehicle design

The use of optimization methods as an effective design tool in the design of hybrid vehicle propulsion systems is demonstrated. Optimization techniques were used to select values for three design parameters (battery weight, heat engine power rating and power split between the two on-board energy sources) such that various measures of vehicle performance (acquisition cost, life cycle cost and petroleum consumption) were optimized. The apporach produced designs which were often significant improvements over hybrid designs already reported on in the literature. The principal conclusions are as follows. First, it was found that the strategy used to split the required power between the two on-board energy sources can have a significant effect on life cycle cost and petroleum consumption. Second, the optimization program should be constructed so that performance measures and design variables can be easily changed. Third, the vehicle simulation program has a significant effect on the computer run time of the overall optimization program; run time can be significantly reduced by proper design of the types of trips the vehicle takes in a one year period. Fourth, care must be taken in designing the cost and constraint expressions which are used in the optimization so that they are relatively smooth functions of the design variables. Fifth, proper handling of constraints on battery weight and heat engine rating, variables which must be large enough to meet power demands, is particularly important for the success of an optimization study. Finally, the principal conclusion is that optimization methods provide a practical tool for carrying out the design of a hybrid vehicle propulsion system.

Donoghue, J. F.↗
NASA NTRS2009

Constraint Embedding for Multibody System Dynamics

This paper describes a constraint embedding approach for the handling of local closure constraints in multibody system dynamics. The approach uses spatial operator techniques to eliminate local-loop constraints from the system and effectively convert the system into tree-topology systems. This approach allows the direct derivation of recursive O(N) techniques for solving the system dynamics and avoiding the expensive steps that would otherwise be required for handling the closedchain dynamics. The approach is very effective for systems where the constraints are confined to small-subgraphs within the system topology. The paper provides background on the spatial operator O(N) algorithms, the extensions for handling embedded constraints, and concludes with some examples of such constraints.

Jain, Abhinandan↗
NASA NTRS1976

Four-dimensional guidance problem with control delays

This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.

Nagarajan, N.↗
NASA NTRS2013

Translating MAPGEN to ASPEN for MER

This software translates MAPGEN (Europa and APGEN) domains to ASPEN, and the resulting domain can be used to perform planning for the Mars Exploration Rover (MER). In other words, this is a conversion of two distinct planning languages (both declarative and procedural) to a third (declarative) planning language in order to solve the problem of faithful translation from mixed-domain representations into the ASPEN Modeling Language. The MAPGEN planning system is an example of a hybrid procedural/declarative system where the advantages of each are leveraged to produce an effective planner/scheduler for MER tactical planning. The adaptation of the planning system (ASPEN) was investigated, and, with some translation, much of the procedural knowledge encoding is amenable to declarative knowledge encoding. The approach was to compose translators from the core languages used for adapting MAGPEN, which consists of Europa and APGEN. Europa is a constraint- based planner/scheduler where domains are encoded using a declarative model. APGEN is also constraint-based, in that it tracks constraints on resources and states and other variables. Domains are encoded in both constraints and code snippets that execute according to a forward sweep through the plan. Europa and APGEN communicate to each other using proxy activities in APGEN that represent constraints and/or tokens in Europa. The composition of a translator from Europa to ASPEN was fairly straightforward, as ASPEN is also a declarative planning system, and the specific uses of Europa for the MER domain matched ASPEN s native encoding fairly closely. On the other hand, translating from APGEN to ASPEN was considerably more involved. On the surface, the types of activities and resources one encodes in APGEN appear to match oneto- one to the activities, state variables, and resources in ASPEN. But, when looking into the definitions of how resources are profiled and activities are expanded, one sees code snippets that access various information available during planning for the moment in time being planned to decide at the time what the appropriate profile or expansion is. APGEN is actually a forward (in time) sweeping discrete event simulator, where the model is composed of code snippets that are artfully interleaved by the engine to produce a plan/schedule. To solve this problem, representative code is simulated as a declarative series of task expansions. Predominantly, three types of procedural models were translated: loops, if statements, and code blocks. Loops and if statements were handled using controlled task expansion, and code blocks were handled using constraint networks that maintained the generation of results based on what the order of execution would be for a procedural representation. One advantage with respect to performance for MAPGEN is the use of APGEN s GUI. This GUI is written in C++ and Motif, and performs very well for large plans.

Rabideau, Gregg R.↗
NASA NTRS1975

A variable-metric algorithm employing linear and quadratic penalties

A variable-metric algorithm is described that uses both linear and quadratic penalty terms for handling nonlinear constraints. Quadratic penalty coefficients are adjusted in a process which maintains a positive-definite matrix of second partial derivatives of the function without generating the large positive eigenvalues which cause zigzagging and slow convergence. The schemes suggested use inferred second-order properties not only in terms of the variable metric of the Davidson-Fletcher-Powell algorithm (or its relatives) but by estimating of second directional derivatives by fitting cubics to various functions along search directions.

Kelley, H. J.↗
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.↗
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↗