Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Kinematics and constraints associated with swashplate blade pitch control

An important class of techniques to reduce helicopter vibration is based on using a Higher Harmonic controller to optimally define the Higher Harmonic blade pitch. These techniques typically require solution of a general optimization problem requiring the determination of a control vector which minimizes a performance index where functions of the control vector are subject to inequality constraints. Six possible constraint functions associated with swashplate blade pitch control were identified and defined. These functions constrain: (1) blade pitch Fourier Coefficients expressed in the Rotating System, (2) blade pitch Fourier Coefficients expressed in the Nonrotating System, (3) stroke of the individual actuators expressed in the Nonrotating System, (4) blade pitch expressed as a function of blade azimuth and actuator stroke, (5) time rate-of-change of the aforementioned parameters, and (6) required actuator power. The aforementioned constraints and the associated kinematics of swashplate blade pitch control by means of the strokes of the individual actuators are documented.

Leyland, Jane A.↗
NASA NTRS1993

Constraint-based scheduling

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Zweben, Monte↗
NASA NTRS1994

Experimental constraints on models for origins of chondrules: Peak temperatures

Chondrule peak temperature constraints for mathematical models pertaining to chondrule origin are discussed in this article. The peak temperatures experienced by chondrules provide a parameter that may allow discrimination between alternative heating mechanisms. Successful mechanisms must provide just enough energy to reach such temperatures and not overshoot them. In principle, determination of peak temperatures from chondrule textures and experiments that duplicate them should be very easy. However, this approach is complicated by the fact that there are several different experimental paths that reproduce chondrule properties. The key texture depends not only on the peak temperature but also on the heating time and, in the case of totally molten droplets, on interactions with other particles. Addressed here are different types of peak temperature constraints; (1) near-liquidus melting; (2) flash melting; (3) dust seeding; (4) volatile element constraints; and (5) barred olivine chondrules.

Hewins, R. H.↗
NASA NTRS1994

A constraint-logic based implementation of the coarse-grained approach to data acquisition scheduling of the International Ultraviolet Explorer orbiting observatory

The International Ultraviolet Explorer (IUE) satellite observatory has been in operation continuously since 1978. It typically carries out several thousand observations per year for over a hundred different science projects. These observations, which can occur in one of four different data-taking modes, fall under several satellite-related constraints and many other constraints which derive from the science goals of the projects being undertaken. One strategy which has made the scheduling problem tractable has been that of 'coarse-graining' the time into discrete blocks of equal size (8 hours), each of which is devoted to a single science program, and each of which is sufficiently long for several observations to be carried out. We call it 'coarse-graining' because the schedule is done at a 'coarse' level which ignores fine structure; i.e., no attempt is made to plan the sequence of observations occurring within each time block. We have incorporated the IUE's coarse-grained approach in new software which examines the science needs of the observations and produces a limited set of alternative schedules which meet all of the instrument and science-related constraints. With this algorithm, the IUE can still be scheduled by a single person using a standard workstation, as it has been. We believe that this software could could be adapted to a more complex mission while retaining the IUE's high flexibility and efficiency and scientific return of future satellite missions.

Mccollum, Bruce↗
NASA NTRS1996

Balancing Science Objectives and Operational Constraints: A Mission Planner's Challenge

The Air Force minute sensor technology integration (MSTI-3) satellite's primary mission is to characterize Earth's atmospheric background clutter. MSTI-3 will use three cameras for data collection, a mid-wave infrared imager, a short wave infrared imager, and a visible imaging spectrometer. Mission science objectives call for the collection of over 2 million images within the one year mission life. In addition, operational constraints limit camera usage to four operations of twenty minutes per day, with no more than 10,000 data and calibrating images collected per day. To balance the operational constraints and science objectives, the mission planning team has designed a planning process to e event schedules and sensor operation timelines. Each set of constraints, including spacecraft performance capabilities, the camera filters, the geographical regions, and the spacecraft-Sun-Earth geometries of interest, and remote tracking station deconflictions has been accounted for in this methodology. To aid in this process, the mission planning team is building a series of tools from commercial off-the-shelf software. These include the mission manifest which builds a daily schedule of events, and the MSTI Scene Simulator which helps build geometrically correct scans. These tools provide an efficient, responsive, and highly flexible architecture that maximizes data collection while minimizing mission planning time.

Weldy, Michelle↗
NASA NTRS1995

TRACON Aircraft Arrival Planning and Optimization Through Spatial Constraint Satisfaction

A new aircraft arrival planning and optimization algorithm has been incorporated into the Final Approach Spacing Tool (FAST) in the Center-TRACON Automation System (CTAS) developed at NASA-Ames Research Center. FAST simulations have been conducted over three years involving full-proficiency, level five air traffic controllers from around the United States. From these simulations an algorithm, called Spatial Constraint Satisfaction, has been designed, coded, undergone testing, and soon will begin field evaluation at the Dallas-Fort Worth and Denver International airport facilities. The purpose of this new design is an attempt to show that the generation of efficient and conflict free aircraft arrival plans at the runway does not guarantee an operationally acceptable arrival plan upstream from the runway -information encompassing the entire arrival airspace must be used in order to create an acceptable aircraft arrival plan. This new design includes functions available previously but additionally includes necessary representations of controller preferences and workload, operationally required amounts of extra separation, and integrates aircraft conflict resolution. As a result, the Spatial Constraint Satisfaction algorithm produces an optimized aircraft arrival plan that is more acceptable in terms of arrival procedures and air traffic controller workload. This paper discusses the current Air Traffic Control arrival planning procedures, previous work in this field, the design of the Spatial Constraint Satisfaction algorithm, and the results of recent evaluations of the algorithm.

Bergh, Christopher P.↗
NASA NTRS2001

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗
NASA NTRS2001

Solving and Learning Soft Temporal Constraints: Experimental Scenario and Examples

Soft temporal constraint problems allow to describe in a natural way scenarios where events happen over time and preferences are associated to event distances and durations. However, sometimes such local preferences are difficult to set, and it may be easier instead to associate preferences to some complete solutions of the problem. To model everything in a uniform way via local preferences only, and also to take advantage of the existing constraint solvers which exploit only local preference use machine learning techniques which learn the local preferences from the global ones. In this paper we describe the existing framework for both solving and learning preferences in temporal constraint problems, the implemented modules, the experimental scenario, and preliminary results on some examples.

Rossi, F.↗
NASA NTRS2001

Propagating Resource Constraints Using Mutual Exclusion Reasoning

One of the most recent techniques for propagating resource constraints in Constraint Based scheduling is Energy Constraint. This technique focuses in precedence based scheduling, where precedence relations are taken into account rather than the absolute position of activities. Although, this particular technique proved to be efficient on discrete unary resources, it provides only loose bounds for jobs using discrete multi-capacity resources. In this paper we show how mutual exclusion reasoning can be used to propagate time bounds for activities using discrete resources. We show that our technique based on critical path analysis and mutex reasoning is just as effective on unary resources, and also shows that it is more effective on multi-capacity resources, through both examples and empirical study.

Frank, Jeremy↗
NASA NTRS2002

The Delta x B = 0 Constraint Versus Minimization of Numerical Errors in MHD Simulations

The MHD equations are a system of non-strictly hyperbolic conservation laws. The non-convexity of the inviscid flux vector resulted in corresponding Jacobian matrices with undesirable properties. It has previously been shown by Powell et al. (1995) that an 'almost' equivalent MHD system in non-conservative form can be derived. This non-conservative system has a better conditioned eigensystem. Aside from Powell et al., the MHD equations can be derived from basic principles in either conservative or non-conservative form. The Delta x B = 0 constraint of the MHD equations is only an initial condition constraint, it is very different from the incompressible Navier-Stokes equations in which the divergence condition is needed to close the system (i.e., to have the same number of equations and the same number of unknown). In the MHD formulations, if Delta x B = 0 initially, all one needs is to construct appropriate numerical schemes that preserve this constraint at later time evolutions. In other words, one does not need the Delta x B condition to close the MHD system. We formulate our new scheme together with the Cargo & Gallice (1997) form of the MHD approximate Riemann solver in curvilinear grids for both versions of the MHD equations. A novel feature of our new method is that the well-conditioned eigen-decomposition of the non-conservative MHD equations is used to solve the conservative equations. This new feature of the method provides well-conditioned eigenvectors for the conservative formulation, so that correct wave speeds for discontinuities are assured. The justification for using the non-conservative eigen-decomposition to solve the conservative equations is that our scheme has a better control of the numerical error associated with the divergence of the magnetic condition. Consequently, computing both forms of the equations with the same eigen-decomposition is almost equivalent. It will be shown that this approach, using the non-conservative eigensystem when solving the conservative equations, also works well in the context of standard shock-capturing schemes.

Yee, H. C.↗
NASA NTRS2003

A Discrete Constraint for Entropy Conservation and Sound Waves in Cloud-Resolving Modeling

Ideal cloud-resolving models contain little-accumulative errors. When their domain is so large that synoptic large-scale circulations are accommodated, they can be used for the simulation of the interaction between convective clouds and the large-scale circulations. This paper sets up a framework for the models, using moist entropy as a prognostic variable and employing conservative numerical schemes. The models possess no accumulative errors of thermodynamic variables when they comply with a discrete constraint on entropy conservation and sound waves. Alternatively speaking, the discrete constraint is related to the correct representation of the large-scale convergence and advection of moist entropy. Since air density is involved in entropy conservation and sound waves, the challenge is how to compute sound waves efficiently under the constraint. To address the challenge, a compensation method is introduced on the basis of a reference isothermal atmosphere whose governing equations are solved analytically. Stability analysis and numerical experiments show that the method allows the models to integrate efficiently with a large time step.

Zeng, Xi-Ping↗
NASA NTRS1998

Efficient dynamic constraints for animating articulated figures

This paper presents an efficient dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A non-trivial extension of Featherstone's O(n) recursive forward dynamics algorithm is derived which allows enforcing one or more constraints on the animated figures. We demonstrate how the constraint force evaluation algorithm we have developed makes it possible to simulate collisions between articulated figures, to compute the results of impulsive forces, to enforce joint limits, to model closed kinematic loops, and to robustly control motion at interactive rates. Particular care has been taken to make the algorithm not only fast, but also easy to implement and use. To better illustrate how the constraint force evaluation algorithm works, we provide pseudocode for its major components. Additionally, we analyze its computational complexity and finally we present examples demonstrating how our system has been used to generate interactive, physically correct complex motion with small user effort.

NASA Discipline Space Human Factors↗
NASA NTRS2006

Strict Constraint Feasibility in Analysis and Design of Uncertain Systems

This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.

Crespo, Luis G.↗
NASA NTRS2007

Three Dimensional Constraint Effects on the Estimated (Delta)CTOD during the Numerical Simulation of Different Fatigue Threshold Testing Techniques

Variation in constraint through the thickness of a specimen effects the cyclic crack-tip-opening displacement (DELTA CTOD). DELTA CTOD is a valuable measure of crack growth behavior, indicating closure development, constraint variations and load history effects. Fatigue loading with a continual load reduction was used to simulate the load history associated with fatigue crack growth threshold measurements. The constraint effect on the estimated DELTA CTOD is studied by carrying out three-dimensional elastic-plastic finite element simulations. The analysis involves numerical simulation of different standard fatigue threshold test schemes to determine how each test scheme affects DELTA CTOD. The American Society for Testing and Materials (ASTM) prescribes standard load reduction procedures for threshold testing using either the constant stress ratio (R) or constant maximum stress intensity (K(sub max)) methods. Different specimen types defined in the standard, namely the compact tension, C(T), and middle cracked tension, M(T), specimens were used in this simulation. The threshold simulations were conducted with different initial K(sub max) values to study its effect on estimated DELTA CTOD. During each simulation, the DELTA CTOD was estimated at every load increment during the load reduction procedure. Previous numerical simulation results indicate that the constant R load reduction method generates a plastic wake resulting in remote crack closure during unloading. Upon reloading, this remote contact location was observed to remain in contact well after the crack tip was fully open. The final region to open is located at the point at which the load reduction was initiated and at the free surface of the specimen. However, simulations carried out using the constant Kmax load reduction procedure did not indicate remote crack closure. Previous analysis results using various starting K(sub max) values and different load reduction rates have indicated DELTA CTOD is independent of specimen size. A study of the effect of specimen thickness and geometry on the measured DELTA CTOD for various load reduction procedures and its implication in the estimation of fatigue crack growth threshold values is discussed.

Seshadri, Banavara R.↗
NASA NTRS2008

Hard Constraints in Optimization Under Uncertainty

This paper proposes a methodology for the analysis and design of systems subject to parametric uncertainty where design requirements are specified via hard inequality constraints. Hard constraints are those that must be satisfied for all parameter realizations within a given uncertainty model. Uncertainty models given by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles, are the focus of this paper. These models, which are also quite practical, allow for a rigorous mathematical treatment within the proposed framework. Hard constraint feasibility is determined by sizing the largest uncertainty set for which the design requirements are satisfied. Analytically verifiable assessments of robustness are attained by comparing this set with the actual uncertainty model. Strategies that enable the comparison of the robustness characteristics of competing design alternatives, the description and approximation of the robust design space, and the systematic search for designs with improved robustness are also proposed. Since the problem formulation is generic and the tools derived only require standard optimization algorithms for their implementation, this methodology is applicable to a broad range of engineering problems.

Crespo, Luis G.↗
NASA NTRS2008

Constraints on Black Hole Spin in a Sample of Broad Iron Line AGN

We present a uniform X-ray spectral analysis of nine type-1 active galactic nuclei (AGN) that have been previously found to harbor relativistically broadened iron emission lines. We show that the need for relativistic effects in the spectrum is robust even when one includes continuum "reflection" from the accretion disk. We then proceed to model these relativistic effects in order to constrain the spin of the supermassive black holes in these AGN. Our principal assumption, supported by recent simulations of geometrically-thin accretion disks, is that no iron line emission (or any associated Xray reflection features) can originate from the disk within the innermost stable circular orbit. Under this assumption, which tends to lead to constraints in the form of lower limits on the spin parameter, we obtain non-trivial spin constraints on five AGN. The spin parameters of these sources range from moderate (a approximates 0.6) to high (a > 0.96). Our results allow, for the first time, an observational constraint on the spin distribution function of local supermassive black holes. Parameterizing this as a power-law in dimensionless spin parameter (f(a) varies as absolute value of (a) exp zeta), we present the probability distribution for zeta implied by our results. Our results suggest 90% and 95% confidence limits of zeta > -0.09 and zeta > -0.3 respectively.

Brenneman, Laura W.↗
NASA NTRS2009

ISS Science: Status of Implementation Constraints

With the completion of the International Space Station imminent, there are many opportunities for scientific experiments. There are also constraints that must be understood. This viewgraph presentation reviews some of the opportunities will be available and constraints that must be imposed. The scientist designing the experiments for the ISS, must understand and consider these factors and plan the design to minimize the impact of these constraints.

Sams, Clarence↗
NASA NTRS2009

A Consideration of Constraints on Aircraft Departure Operations

This paper presents a system-level perspective on the operational issues and constraints that limit departure capacity at large metropolitan airports in today's air transportation system. It examines the influence of constraints evident in en route airspace, in metroplex operations, and at individual airports from today's perspective and with a view toward future gate-to-cruise operations. Cross cutting organizational and technological challenges are discussed in relation to their importance in addressing the constraints.

Darr, Stephen T.↗