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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Quantum-accelerated Global Constraint Filtering

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.

Quantum algorithms↗

DOE OSTI2025

The Dark Energy Camera All Data Everywhere cosmic shear project V: Constraints on cosmology and astrophysics from 270 million galaxies across 13,000 deg$^2$ of the sky

We present constraints on models of cosmology and astrophysics using cosmic shear data vectors from three datasets: the northern and southern Galactic cap of the Dark Energy Camera All Data Everywhere (DECADE) project, and the Dark Energy Survey (DES) Year 3. These data vectors combined consist of 270 million galaxies spread across 13,000 ${\rm deg}^2$ of the sky. We first extract constraints for $Λ$CDM cosmology and find $S_8= 0.805^{+0.019}_{-0.019}$ and $Ω_{\rm m} = 0.262^{+0.023}_{-0.036}$, which is consistent within $1.9 σ$ of constraints from the Planck satellite. Extending our analysis to dynamical dark energy models shows that lensing provides some (but still minor) improvements to existing constraints from supernovae and baryon acoustic oscillations. Finally, we study six different models for the impact of baryons on the matter power spectrum. We show the different models provide consistent constraints on baryon suppression, and associated cosmology, once the astrophysical priors are sufficiently wide. Current scale-cut approaches for mitigating baryon contamination result in a residual bias of $\approx 0.3σ$ in the $S_8, Ω_{\rm m}$ posterior. Using all scales with dedicated baryon modeling leads to negligible improvement as the new information is used solely to self-calibrate the baryon model on small scales. Additional non-lensing datasets, and/or calibrations of the baryon model, will be required to access the full statistical power of the lensing measurements. The combined dataset in this work represents the largest lensing dataset to date (most galaxies, largest area) and provides an apt testing ground for analyses of upcoming datasets from Stage IV surveys. The DECADE shear catalogs, data vectors, and likelihoods are made publicly available.

Anbajagane, D. [Chicago U., Astron. Astrophys. Ctr↗

NASA NTRS1974

Optimal control problems with mixed control-phase variable equality and inequality constraints

In this paper, necessary conditions are obtained for optimal control problems containing equality constraints defined in terms of functions of the control and phase variables. The control system is assumed to be characterized by an ordinary differential equation, and more conventional constraints, including phase inequality constraints, are also assumed to be present. Because the first-mentioned equality constraint must be satisfied for all t (the independent variable of the differential equation) belonging to an arbitrary (prescribed) measurable set, this problem gives rise to infinite-dimensional equality constraints. To obtain the necessary conditions, which are in the form of a maximum principle, an implicit-function-type theorem in Banach spaces is derived.

Makowski, K.↗

NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to autorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗

NASA NTRS1988

Minimum weight design of rectangular and tapered helicopter rotor blades with frequency constraints

The minimum weight design of a helicopter rotor blade subject to constraints on coupled flap-lag natural frequencies has been studied. A constraint has also been imposed on the minimum value of the autorotational inertia of the blade in order to ensure that it has sufficient inertia to aurorotate in the case of engine failure. The program CAMRAD is used for the blade modal analysis and CONMIN is used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for both rectangular and tapered blades. Design variables include taper ratio, segment weights, and box beam dimensions. It is shown that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for both rectangular and tapered blades.

Chattopadhyay, Aditi↗

NASA NTRS1989

Minimum weight design of helicopter rotor blades with frequency constraints

The minimum weight design of helicopter rotor blades subject to constraints on fundamental coupled flap-lag natural frequencies has been studied in this paper. A constraint has also been imposed on the minimum value of the blade autorotational inertia to ensure that the blade has sufficient inertia to autorotate in case of an engine failure. The program CAMRAD has been used for the blade modal analysis and the program CONMIN has been used for the optimization. In addition, a linear approximation analysis involving Taylor series expansion has been used to reduce the analysis effort. The procedure contains a sensitivity analysis which consists of analytical derivatives of the objective function and the autorotational inertia constraint and central finite difference derivatives of the frequency constraints. Optimum designs have been obtained for blades in vacuum with both rectangular and tapered box beam structures. Design variables include taper ratio, nonstructural segment weights and box beam dimensions. The paper shows that even when starting with an acceptable baseline design, a significant amount of weight reduction is possible while satisfying all the constraints for blades with rectangular and tapered box beams.

Chattopadhyay, Aditi↗

NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗

NASA NTRS1991

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

Smith, Stephen F.↗

NASA NTRS1993

Three-dimensional elastic-plastic finite-element analyses of constraint variations in cracked bodies

Three-dimensional elastic-plastic (small-strain) finite-element analyses were used to study the stresses, deformations, and constraint variations around a straight-through crack in finite-thickness plates for an elastic-perfectly plastic material under monotonic and cyclic loading. Middle-crack tension specimens were analyzed for thicknesses ranging from 1.25 to 20 mm with various crack lengths. Three local constraint parameters, related to the normal, tangential, and hydrostatic stresses, showed similar variations along the crack front for a given thickness and applied stress level. Numerical analyses indicated that cyclic stress history and crack growth reduced the local constraint parameters in the interior of a plate, especially at high applied stress levels. A global constraint factor alpha(sub g) was defined to simulate three-dimensional effects in two-dimensional crack analyses. The global constraint factor was calculated as an average through-the-thickness value over the crack-front plastic region. Values of alpha(sub g) were found to be nearly independent of crack length and were related to the stress-intensity factor for a given thickness.

Newman, J. C., Jr.↗

NASA NTRS1992

Motion planning of mobile multi-limb robotic systems subject to force and friction constraints

A method is presented to generate motions for a class of multilimb robotic systems enabling them to apply large static forces over large ranges of motion without saturating actuator effort limits, system-environment friction constraints, kinematic joint limits, or geometric workspace obstacles. The approach, termed the force-workspace (FW) approach, maps these constraints into the system C-space to form constraint obstacles using a recursive subdivision process. To generate motions along which actuator efforts can be specified without violating system constraints, paths are planned that avoid these constraint obstacles. The method permits the shape of the paths to be controlled using any configuration-dependent performance criterion. The FW approach was applied to a proposed three-limb planar climbing robot whose task is to climb upwards between two vertical walls by pushing outwards to generate frictional support. Motions were planned automatically within the system FW, enabling it to lift itself upwards using two limbs at a time, and a gait was planned to enable it to switch limbs and climb continuously.

Madhani, Akhil↗

NASA NTRS1994

Chondrule origins: Constraints from chondrule properties and cosmochemistry

The origin of chondrules is a problem for the ages. Yet even though a detailed formation mechanism remains elusive, the constraints on possible mechanisms become more stringent with each systematic examination of chondrules that involves a higher level of resolution. Constraints presented here are mainly based on studies of chondrules in unequilibrated ordinary chondrites because these have been studied much more than other primitive chondrites. These constraints are listed in six categories: the first four are constraints of chondrule origin and the last two reflect the constraints chondrule properties place on the ambient nebula.

Wasson, J. T.↗

NASA NTRS1996

Constraints in Genetic Programming

Genetic programming refers to a class of genetic algorithms utilizing generic representation in the form of program trees. For a particular application, one needs to provide the set of functions, whose compositions determine the space of program structures being evolved, and the set of terminals, which determine the space of specific instances of those programs. The algorithm searches the space for the best program for a given problem, applying evolutionary mechanisms borrowed from nature. Genetic algorithms have shown great capabilities in approximately solving optimization problems which could not be approximated or solved with other methods. Genetic programming extends their capabilities to deal with a broader variety of problems. However, it also extends the size of the search space, which often becomes too large to be effectively searched even by evolutionary methods. Therefore, our objective is to utilize problem constraints, if such can be identified, to restrict this space. In this publication, we propose a generic constraint specification language, powerful enough for a broad class of problem constraints. This language has two elements -- one reduces only the number of program instances, the other reduces both the space of program structures as well as their instances. With this language, we define the minimal set of complete constraints, and a set of operators guaranteeing offspring validity from valid parents. We also show that these operators are not less efficient than the standard genetic programming operators if one preprocesses the constraints - the necessary mechanisms are identified.

Janikow, Cezary Z.↗

NASA NTRS1991

Generalizing Atoms in Constraint Logic

This paper studies the generalization of atomic formulas, or atoms, that are augmented with constraints on or among their terms. The atoms may also be viewed as definite clauses whose antecedents express the constraints. Atoms are generalized relative to a body of background information about the constraints. This paper first examines generalization of atoms with only monadic constraints. The paper develops an algorithm for the generalization task and discusses algorithm complexity. It then extends the algorithm to apply to atoms with constraints of arbitrary arity. The paper also presents semantic properties of the generalizations computed by the algorithms, making the algorithms applicable to such problems as abduction, induction, and knowledge base verification. The paper emphasizes the application to induction and presents a pac-learning result for constrained atoms.

Page, C. David, Jr.↗

NASA NTRS1997

Integrity Constraint Monitoring in Software Development: Proposed Architectures

In the development of complex software systems, designers are required to obtain from many sources and manage vast amounts of knowledge of the system being built and communicate this information to personnel with a variety of backgrounds. Knowledge concerning the properties of the system, including the structure of, relationships between and limitations of the data objects in the system, becomes increasingly more vital as the complexity of the system and the number of knowledge sources increases. Ensuring that violations of these properties do not occur becomes steadily more challenging. One approach toward managing the enforcement or system properties, called context monitoring, uses a centralized repository of integrity constraints and a constraint satisfiability mechanism for dynamic verification of property enforcement during program execution. The focus of this paper is to describe possible software architectures that define a mechanism for dynamically checking the satisfiability of a set of constraints on a program. The next section describes the context monitoring approach in general. Section 3 gives an overview of the work currently being done toward the addition of an integrity constraint satisfiability mechanism to a high-level program language, SequenceL, and demonstrates how this model is being examined to develop a general software architecture. Section 4 describes possible architectures for a general constraint satisfiability mechanism, as well as an alternative approach that, uses embedded database queries in lieu of an external monitor. The paper concludes with a brief summary outlining the, current state of the research and future work.

Fernandez, Francisco G.↗

NASA NTRS2002

New Boundary Constraints for Elliptic Systems used in Grid Generation Problems

This paper discusses new boundary constraints for elliptic partial differential equations as used in grid generation problems in generalized curvilinear coordinate systems. These constraints, based on the principle of local conservation of thermal energy in the vicinity of the boundaries, are derived using the Green's Theorem. They uniquely determine the so called decay parameters in the source terms of these elliptic systems. These constraints' are designed for boundary clustered grids where large gradients in physical quantities need to be resolved adequately. It is observed that the present formulation also works satisfactorily for mild clustering. Therefore, a closure for the decay parameter specification for elliptic grid generation problems has been provided resulting in a fully automated elliptic grid generation technique. Thus, there is no need for a parametric study of these decay parameters since the new constraints fix them uniquely. It is also shown that for Neumann type boundary conditions, these boundary constraints uniquely determine the solution to the internal elliptic problem thus eliminating the non-uniqueness of the solution of an internal Neumann boundary value grid generation problem.

Kaul, Upender K.↗

NASA NTRS2003

A Hybrid Constraint Representation and Reasoning Framework

This paper introduces JNET, a novel constraint representation and reasoning framework that supports procedural constraints and constraint attachments, providing a flexible way of integrating the constraint reasoner with a run- time software environment. Attachments in JNET are constraints over arbitrary Java objects, which are defined using Java code, at runtime, with no changes to the JNET source code.

Golden, Keith↗

NASA NTRS2003

Constraints on the Energy Density Content of the Universe Using Only Clusters of Galaxies

We demonstrate that it is possible to constrain the energy content of the Universe with high accuracy using observations of clusters of galaxies only. The degeneracies in the cosmological parameters are lifted by combining constraints from different observables of galaxy clusters. We show that constraints on cosmological parameters from galaxy cluster number counts as a function of redshift and accurate angular diameter distance measurements to clusters are complementary to each other and their combination can constrain the energy density content of the Universe well. The number counts can be obtained from X-ray and/or SZ (Sunyaev-Zeldovich effect) surveys, the angular diameter distances can be determined from deep observations of the intra-cluster gas using their thermal bremsstrahlung X-ray emission and the SZ effect (X-SZ method). In this letter we combine constraints from simulated cluster number counts expected from a 12 deg2 SZ cluster survey and constraints from simulated angular diameter distance measurements based on using the X-SZ method assuming an expected accuracy of 7% in the angular diameter distance determination of 70 clusters with redshifts less than 1.5. We find that R, can be determined within about 25%, A within 20%, and w within 16%. Any cluster survey can be used to select clusters for high accuracy distance measurements, but we assumed accurate angular diameter distance measurements for only 70 clusters since long observations are necessary to achieve high accuracy in distance measurements. Thus the question naturally arises: How to select clusters of galaxies for accurate diameter distance determinations? In this letter, as an example, we demonstrate that it is possible to optimize this selection changing the number of clusters observed, and the upper cut off of their redshift range. We show that constraints on cosmological parameters from combining cluster number counts and angular diameter distance measurements, as opposed to general expectations, will not improve substantially selecting clusters with redshifts higher than one. This important conclusion allow us to restrict our cluster sample to clusters closer than one, in a range where the observational time for accurate distance measurements are more manageable. Subject headings: cosmological parameters - cosmology: theory - galaxies: clusters: general - X-rays: galaxies: clusters

Molnar, Sandor M.↗

NASA NTRS2004

Minimum-Time and Vibration Avoidance Attitude Maneuver for Spacecraft with Torque and Momentum Limit Constraints in Redundant Reaction Wheel Configuration

In this paper, we present an optimal open-loop slew trajectory algorithm developed at GSFC for the so-called "Yardstick design" of the James Webb Space Telescope (JWST). JWST is an orbiting infrared observatory featuring a lightweight, segmented primary mirror approximately 6 meters in diameter and a sunshield approximately the size of a tennis court. This large, flexible structure will have significant number of lightly damped, dominant flexible modes. With very stringent requirements on pointing accuracy and image quality, it is important that slewing be done within the required time constraint and with minimal induced vibration in order to maximize observing efficiency. With reaction wheels as control actuators, initial wheel speeds as well as individual wheel torque and momentum limits become dominant constraints in slew performance. These constraints must be taken into account when performing slews to ensure that unexpected reaction wheel saturation does not occur, since such saturation leads to control failure in accurately tracking commanded motion and produces high frequency torque components capable of exciting structural modes. A minimum-time constraint is also included and coupled with reaction wheel limit constraints in the optimization to minimize both the effect of the control torque on the flexible body motion and the maneuver time. The optimization is on slew command parameters, such as maximum slew velocity and acceleration, for a given redundant reaction wheel configuration and is based on the dynamic interaction between the spacecraft and reaction wheel motion. Analytical development of the slew algorithm to generate desired slew position, rate, and acceleration profiles to command a feedback/feed forward control system is described. High-fidelity simulation and experimental results are presented to show that the developed slew law achieves the objectives.

Ha, Kong Q.↗