Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 19 records
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 NTRS2003

Dynamic Constraint Satisfaction with Reasonable Global Constraints

Previously studied theoretical frameworks for dynamic constraint satisfaction problems (DCSPs) employ a small set of primitive operators to modify a problem instance. They do not address the desire to model problems using sophisticated global constraints, and do not address efficiency questions related to incremental constraint enforcement. In this paper, we extend a DCSP framework to incorporate global constraints with flexible scope. A simple approach to incremental propagation after scope modification can be inefficient under some circumstances. We characterize the cases when this inefficiency can occur, and discuss two ways to alleviate this problem: adding rejection variables to the scope of flexible constraints, and adding new features to constraints that permit increased control over incremental propagation.

Frank, Jeremy↗
NASA NTRS2004

Structure Constraints in a Constraint-Based Planner

In this paper we report our work on a new constraint domain, where variables can take structured values. Earth-science data processing (ESDP) is a planning domain that requires the ability to represent and reason about complex constraints over structured data, such as satellite images. This paper reports on a constraint-based planner for ESDP and similar domains. We discuss our approach for translating a planning problem into a constraint satisfaction problem (CSP) and for representing and reasoning about structured objects and constraints over structures.

Pang, Wan-Lin↗
NASA NTRS1972

Momentum constraints as integrability conditions for the Hamiltonian constraint in general relativity.

It is shown that if the Hamiltonian constraint of general relativity is imposed as a restriction on the Hamilton principal functional in the classical theory, or on the state functional in the quantum theory, then the momentum constraints are automatically satisfied. This result holds both for closed and open spaces and it means that the full content of the theory is summarized by a single functional equation of the Tomonaga-Schwinger type.

Moncrief, V.↗
NASA NTRS2022

Employing Relaxed Smoothness Constraints on Imaginary Part of Refractive Index in AERONET Aerosol Retrieval Algorithm

In the Aerosol Robotic Network (AERONET) retrieval algorithm, smoothness constraints on the imaginary part of the refractive index provide control of retrieved spectral dependence of aerosol absorption by preventing the inversion code from fitting the noise in optical measurements and thus avoiding unrealistic oscillations of retrievals with wavelength. The history of implementation of the smoothness constraints in the AERONET retrieval algorithm is discussed. It is shown that the latest version of the smoothness constraints on the imaginary part of refractive index, termed standard and employed by Version 3 of the retrieval algorithm, should be modified to account for strong variability of light absorption by brown-carbon-containing aerosols in UV through mid-visible parts of the solar spectrum. In Version 3 strong spectral constraints were imposed at high values of the Ångström exponent (440–870 nm) since black carbon was assumed to be the primary absorber, while the constraints became increasingly relaxed as aerosol exponent deceased to allow for wavelength dependence of absorption for dust aerosols. The new version of the smoothness constraints on the imaginary part of the refractive index assigns different weights to different pairs of wavelengths, which are the same for all values of the Ångström exponent. For example, in the case of four-wavelength input, the weights assigned to short-wavelength pairs (440–675, 675–870 nm) are small so that smoothness constraints do not suppress natural spectral variability of the imaginary part of the refractive index. At longer wavelengths (870–1020 nm), however, the weight is 10 times higher to provide additional constraints on the imaginary part of refractive index retrievals of aerosols with a high Ångström exponent due to low sensitivity to aerosol absorption for longer channels at relatively low aerosol optical depths. The effect of applying the new version of smoothness constraints, termed relaxed, on retrievals of single-scattering albedo is analyzed for case studies of different aerosol types: black- and brown-carbon-containing fine mode aerosols, mineral dust coarse mode aerosols, and urban industrial fine mode aerosol. It is shown that for brown-carbon-containing aerosols employing the relaxed smoothness constraints resulted in significant reduction in retrieved single-scattering albedo and spectral residual errors (compared to standard) at the short wavelengths. For example, biomass burning smoke cases showed a reduction in single-scattering albedo and spectral residual error at 380 nm of ∼ 0.033 and ∼ 17 %, respectively, for the Rexburg site and ∼ 0.04 and ∼ 12.7 % for the Rimrock site, both AERONET sites in Idaho, USA. For a site with very high levels of black-carbon-containing aerosols (Mongu, Zambia), the effect of modification in the smoothness constraints was minor. For mineral dust aerosols at small Ångström exponent values (Mezaira site, UAE), the spectral constraint on the imaginary part of the refractive index was already relaxed in Version 3; therefore the new relaxed constraint results in minimal change. In the case of weakly absorbing urban industrial aerosols at the GSFC site, there are significant changes in retrieved single-scattering albedo using relaxed assumption, especially reductions at longer wavelengths: ∼ 0.016 and ∼ 0.02 at 875 and 1020 nm, respectively, for 440 nm aerosol optical depth (AOD) ∼ 0.3. The modification of smoothness constraints on the imaginary part of the refractive index has a minor effect on retrievals of other aerosol parameters such as the real part of the refractive index and parameters of the aerosol size distribution. The implementation of the relaxed smoothness constraints on the imaginary part of the refractive index in the next version of the AERONET inversion algorithm will produce significant impacts at some sites in short wavelength channels (380 and 440 nm) for some biomass burning smoke cases with significant brown carbon content and possibly in mid-visible channels (500 and 675 nm) to near-infrared channels (870 to 1020 nm) for some urban industrial aerosol types. However, most differences in single-scattering albedo retrievals between those applying the new relaxed constraint and the standard constraint will be within the uncertainty of the single-scattering albedo retrievals, depending on the level of aerosol optical depth, Ångström exponent, brown carbon content and wavelength.

Aliaksandr Siniuk↗
NASA NTRS1994

The Relationship Between Constraint and Ductile Fracture Initiation as Defined by Micromechanical Analyses

The use of small laboratory specimens to predict the integrity of large, complex structures relies on the validity of single parameter fracture mechanics. Unfortunately, the constraint loss associated with large scale yielding, whether in a laboratory specimen because of its small size or in a structure because it contains shallow flaws loaded in tension, can cause the breakdown of classical fracture mechanics and the loss of transferability of critical, global fracture parameters. Although the issue of constraint loss can be eliminated by testing actual structural configurations, such an approach can be prohibitively costly. Hence, a methodology that can correct global fracture parameters for constraint effects is desirable. This research uses micromechanical analyses to define the relationship between global, ductile fracture initiation parameters and constraint in two specimen geometries (SECT and SECB with varying a/w ratios) and one structural geometry (circumferentially cracked pipe). Two local fracture criteria corresponding to ductile fracture micromechanisms are evaluated: a constraint-modified, critical strain criterion for void coalescence proposed by Hancock and Cowling and a critical void ratio criterion for void growth based on the Rice and Tracey model. Crack initiation is assumed to occur when the critical value in each case is reached over some critical length. The primary material of interest is A516-70, a high-hardening pressure vessel steel sensitive to constraint; however, a low-hardening structural steel that is less sensitive to constraint is also being studied. Critical values of local fracture parameters are obtained by numerical analysis and experimental testing of circumferentially notched tensile specimens of varying constraint (e.g., notch radius). These parameters are then used in conjunction with large strain, large deformation, two- and three-dimensional finite element analyses of the geometries listed above to predict crack initiation loads and to calculate the associated (critical) global fracture parameters. The loads are verified experimentally, and microscopy is used to measure pre-crack length, crack tip opening displacement (CTOD), and the amount of stable crack growth. Results for A516-70 steel indicate that the constraint-modified, critical strain criterion with a critical length approximately equal to the grain size (0.0025 inch) provides accurate predictions of crack initiation. The critical void growth criterion is shown to considerably underpredict crack initiation loads with the same critical length. The relationship between the critical value of the J-integral for ductile crack initiation and crack depth for SECT and SECB specimens has been determined using the constraint-modified, critical strain criterion, demonstrating that this micromechanical model can be used to correct in-plane constraint effects due to crack depth and bending vs. tension loading. Finally, the relationship developed for the SECT specimens is used to predict the behavior of circumferentially cracked pipe specimens.

Panontin, Tina L.↗
NASA NTRS2010

Integrated Analysis of Airport Capacity and Environmental Constraints

LMI conducted an integrated analysis of airport capacity and environmental constraints. identifying and ranking the key factors limiting achievement of NextGen capacity goals. The primary metric used was projected throughput, which was estimated for the years 2015 and 2025 based on the unconstrained demand forecast from the Federal Aviation Administration, and planned improvements including those proposed in the NextGen plan. A set of 310 critical airports was identified.. collectively accounting for more than 99 percent of domestic air traffic volume; a one-off analytical approach was used to isolate the constraint being assessed. The study considered three capacity constraints (runway.. taxiway, and gate) and three environmental constraints (fuel, NO(x) emissions, and noise). For the ten busiest airports, runway and noise are the primary and secondary constraints in both 2015 and 2025. For the OEP 35 airports and overall for the remaining airports, the most binding constraint is noise. Six of the 10 busiest airports, will face runway constraints in 2025, and 95 will face gate constraints. Nearly every airport will be subject to constraints due to emissions and NOx. Runway and taxi constraints are more concentrated in the large airports: environmental constraints are present at almost every airport regardless of size.

Hasan, Shahab↗
NASA NTRS1990

Direct handling of equality constraints in multilevel optimization

In recent years there have been several hierarchic multilevel optimization algorithms proposed and implemented in design studies. Equality constraints are often imposed between levels in these multilevel optimizations to maintain system and subsystem variable continuity. Equality constraints of this nature will be referred to as coupling equality constraints. In many implementation studies these coupling equality constraints have been handled indirectly. This indirect handling has been accomplished using the coupling equality constraints' explicit functional relations to eliminate design variables (generally at the subsystem level), with the resulting optimization taking place in a reduced design space. In one multilevel optimization study where the coupling equality constraints were handled directly, the researchers encountered numerical difficulties which prevented their multilevel optimization from reaching the same minimum found in conventional single level solutions. The researchers did not explain the exact nature of the numerical difficulties other than to associate them with the direct handling of the coupling equality constraints. The coupling equality constraints are handled directly, by employing the Generalized Reduced Gradient (GRG) method as the optimizer within a multilevel linear decomposition scheme based on the Sobieski hierarchic algorithm. Two engineering design examples are solved using this approach. The results show that the direct handling of coupling equality constraints in a multilevel optimization does not introduce any problems when the GRG method is employed as the internal optimizer. The optimums achieved are comparable to those achieved in single level solutions and in multilevel studies where the equality constraints have been handled indirectly.

Renaud, John E.↗
NASA NTRS1993

A global approach to kinematic path planning to robots with holonomic and nonholonomic constraints

Robots in applications may be subject to holonomic or nonholonomic constraints. Examples of holonomic constraints include a manipulator constrained through the contact with the environment, e.g., inserting a part, turning a crank, etc., and multiple manipulators constrained through a common payload. Examples of nonholonomic constraints include no-slip constraints on mobile robot wheels, local normal rotation constraints for soft finger and rolling contacts in grasping, and conservation of angular momentum of in-orbit space robots. The above examples all involve equality constraints; in applications, there are usually additional inequality constraints such as robot joint limits, self collision and environment collision avoidance constraints, steering angle constraints in mobile robots, etc. The problem of finding a kinematically feasible path that satisfies a given set of holonomic and nonholonomic constraints, of both equality and inequality types is addressed. The path planning problem is first posed as a finite time nonlinear control problem. This problem is subsequently transformed to a static root finding problem in an augmented space which can then be iteratively solved. The algorithm has shown promising results in planning feasible paths for redundant arms satisfying Cartesian path following and goal endpoint specifications, and mobile vehicles with multiple trailers. In contrast to local approaches, this algorithm is less prone to problems such as singularities and local minima.

Divelbiss, Adam↗
NASA NTRS1992

Reformulating Constraints for Compilability and Efficiency

KBSDE is a knowledge compiler that uses a classification-based approach to map solution constraints in a task specification onto particular search algorithm components that will be responsible for satisfying those constraints (e.g., local constraints are incorporated in generators; global constraints are incorporated in either testers or hillclimbing patchers). Associated with each type of search algorithm component is a subcompiler that specializes in mapping constraints into components of that type. Each of these subcompilers in turn uses a classification-based approach, matching a constraint passed to it against one of several schemas, and applying a compilation technique associated with that schema. While much progress has occurred in our research since we first laid out our classification-based approach [Ton91], we focus in this paper on our reformulation research. Two important reformulation issues that arise out of the choice of a schema-based approach are: (1) compilability-- Can a constraint that does not directly match any of a particular subcompiler's schemas be reformulated into one that does? and (2) Efficiency-- If the efficiency of the compiled search algorithm depends on the compiler's performance, and the compiler's performance depends on the form in which the constraint was expressed, can we find forms for constraints which compile better, or reformulate constraints whose forms can be recognized as ones that compile poorly? In this paper, we describe a set of techniques we are developing for partially addressing these issues.

Tong, Chris↗
NASA NTRS2006

Hard and Soft Constraints in Reliability-Based Design Optimization

This paper proposes a framework for the analysis and design optimization of models subject to parametric uncertainty where design requirements in the form of inequality constraints are present. Emphasis is given to uncertainty models prescribed by norm bounded perturbations from a nominal parameter value and by sets of componentwise bounded uncertain variables. These models, which often arise in engineering problems, allow for a sharp mathematical manipulation. Constraints can be implemented in the hard sense, i.e., constraints must be satisfied for all parameter realizations in the uncertainty model, and in the soft sense, i.e., constraints can be violated by some realizations of the uncertain parameter. In regard to hard constraints, this methodology allows (i) to determine if a hard constraint can be satisfied for a given uncertainty model and constraint structure, (ii) to generate conclusive, formally verifiable reliability assessments that allow for unprejudiced comparisons of competing design alternatives and (iii) to identify the critical combination of uncertain parameters leading to constraint violations. In regard to soft constraints, the methodology allows the designer (i) to use probabilistic uncertainty models, (ii) to calculate upper bounds to the probability of constraint violation, and (iii) to efficiently estimate failure probabilities via a hybrid method. This method integrates the upper bounds, for which closed form expressions are derived, along with conditional sampling. In addition, an l(sub infinity) formulation for the efficient manipulation of hyper-rectangular sets is also proposed.

Crespo, L.uis G.↗
NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗
NASA NTRS2003

A Variational Analysis of Divergence Profiles Based upon Column-Integrated Mass, Moisture and Energetic Constraints with Satellite-Derived Boundary Fluxes

A diagnostic study is made of the mean global divergent circulation based upon a constrained least action principle that minimizes column-integrated divergent kinetic energy subject to constraints on mass, moisture, available potential energy (ape) and total kinetic energy. The concept of gross moist stability was incorporated in the prescription of Lagrange weight function associated with the ape constraint in order to simulate the net effects of cumulus convective heating in the tropics. The variational analyses were validated satisfactorily with the original NCEP/NCAR-reanalysis divergence fields for the Septembers of 1987 and 1988. Further analyses show that in the tropical ascending regions, the analyzed divergences are dominated by the mass and ape constraints; the moisture constraint is implicitly satisfied while the kinetic energy constraint is highly dependent on the ape constraint. In the subtropical descending regions, the analyzed divergences are dominated by the mass, moisture and kinetic energy constraints; the ape constraint is implicitly satisfied. When the constraint integrals were blended with the satellite-derived boundary flux data from GPCP precipitation and ERBE/SRB radiation estimates, the newly analyzed divergences are significantly stronger than the reanalysis divergences in the areas where the estimates of precipitation rates are higher. With few exceptions, the increases in upper-layer divergences are coupled with nearly equal increases in lower-layer convergences.

Lu, Huei-Lin↗
NASA NTRS2011

Chance-Constrained Guidance With Non-Convex Constraints

Missions to small bodies, such as comets or asteroids, require autonomous guidance for descent to these small bodies. Such guidance is made challenging by uncertainty in the position and velocity of the spacecraft, as well as the uncertainty in the gravitational field around the small body. In addition, the requirement to avoid collision with the asteroid represents a non-convex constraint that means finding the optimal guidance trajectory, in general, is intractable. In this innovation, a new approach is proposed for chance-constrained optimal guidance with non-convex constraints. Chance-constrained guidance takes into account uncertainty so that the probability of collision is below a specified threshold. In this approach, a new bounding method has been developed to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. Branch and bound enables non-convex problems to be solved efficiently to global optimality. Considering the problem of finite-horizon robust optimal control of dynamic systems under Gaussian-distributed stochastic uncertainty, with state and control constraints, a discrete-time, continuous-state linear dynamics model is assumed. Gaussian-distributed stochastic uncertainty is a more natural model for exogenous disturbances such as wind gusts and turbulence than the previously studied set-bounded models. However, with stochastic uncertainty, it is often impossible to guarantee that state constraints are satisfied, because there is typically a non-zero probability of having a disturbance that is large enough to push the state out of the feasible region. An effective framework to address robustness with stochastic uncertainty is optimization with chance constraints. These require that the probability of violating the state constraints (i.e., the probability of failure) is below a user-specified bound known as the risk bound. An example problem is to drive a car to a destination as fast as possible while limiting the probability of an accident to 10(exp -7). This framework allows users to trade conservatism against performance by choosing the risk bound. The more risk the user accepts, the better performance they can expect.

FROM↗
NASA NTRS2013

Powered Descent Guidance with General Thrust-Pointing Constraints

The Powered Descent Guidance (PDG) algorithm and software for generating Mars pinpoint or precision landing guidance profiles has been enhanced to incorporate thrust-pointing constraints. Pointing constraints would typically be needed for onboard sensor and navigation systems that have specific field-of-view requirements to generate valid ground proximity and terrain-relative state measurements. The original PDG algorithm was designed to enforce both control and state constraints, including maximum and minimum thrust bounds, avoidance of the ground or descent within a glide slope cone, and maximum speed limits. The thrust-bound and thrust-pointing constraints within PDG are non-convex, which in general requires nonlinear optimization methods to generate solutions. The short duration of Mars powered descent requires guaranteed PDG convergence to a solution within a finite time; however, nonlinear optimization methods have no guarantees of convergence to the global optimal or convergence within finite computation time. A lossless convexification developed for the original PDG algorithm relaxed the non-convex thrust bound constraints. This relaxation was theoretically proven to provide valid and optimal solutions for the original, non-convex problem within a convex framework. As with the thrust bound constraint, a relaxation of the thrust-pointing constraint also provides a lossless convexification that ensures the enhanced relaxed PDG algorithm remains convex and retains validity for the original nonconvex problem. The enhanced PDG algorithm provides guidance profiles for pinpoint and precision landing that minimize fuel usage, minimize landing error to the target, and ensure satisfaction of all position and control constraints, including thrust bounds and now thrust-pointing constraints.

Carson, John M., III↗
NASA NTRS1987

Trimodal interpretation of constraints for planning

Constraints are used in the CAMPS knowledge based planning system to represent those propositions that must be true for a plan to be acceptable. CAMPS introduces the make-mode for interpreting a constraint. Given an unsatisfied constraint, make evaluation mode suggests planning actions which, if taken, would result in a modified plan in which the constraint in question may be satisfied. These suggested planning actions, termed delta-tuples, are the raw material of intelligent plan repair. They are used both in debugging an almost-right plan and in replanning due to changing situations. Given a defective plan in which some set of constraints are violated, a problem solving strategy selects one or more constraints as a focus of attention. These selected constraints are evaluated in the make-mode to produce delta-tuples. The problem solving strategy then reviews the delta-tuples according to its application and problem-specific criteria to find the most acceptable change in terms of success likelihood and plan disruption. Finally, the problem solving strategy makes the suggested alteration to the plan and then rechecks constraints to find any unexpected consequences.

Krieger, David↗
NASA NTRS1990

Constraint-based evaluation of sequential procedures

Constraining the operation of an agent requires knowledge of the restrictions to physical and temporal capabilities of that agent, as well as an inherent understanding of the desires being processed by that agent. Usually a set of constraints are available that must be adhered to in order to foster safe operations. In the worst case, violation of a constraint may be cause to terminate operation. If the agent is carrying out a plan, then a method for predicting the agent's desires, and therefore possible constraint violations, is required. The conceptualization of constraint-based reasoning used herein assumes that a system knows how to select a constraint for application as well as how to apply that constraint once it is selected. The application of constraint-based reasoning for evaluating certain kinds of plans known as sequential procedures is discussed. By decomposing these plans, it is possible to apply context dependent constraints in production system fashion without incorporating knowledge of the original planning process.

Barry, Matthew R.↗