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.

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 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.↗

NASA NTRS2005

Airborne Management of Traffic Conflicts in Descent With Arrival Constraints

NASA is studying far-term air traffic management concepts that may increase operational efficiency through a redistribution of decisionmaking authority among airborne and ground-based elements of the air transportation system. One component of this research, En Route Free Maneuvering, allows trained pilots of equipped autonomous aircraft to assume responsibility for traffic separation. Ground-based air traffic controllers would continue to separate traffic unequipped for autonomous operations and would issue flow management constraints to all aircraft. To evaluate En Route Free Maneuvering operations, a human-in-the-loop experiment was jointly conducted by the NASA Ames and Langley Research Centers. In this experiment, test subject pilots used desktop flight simulators to resolve conflicts in cruise and descent, and to adhere to air traffic flow constraints issued by test subject controllers. Simulators at NASA Langley were equipped with a prototype Autonomous Operations Planner (AOP) flight deck toolset to assist pilots with conflict management and constraint compliance tasks. Results from the experiment are presented, focusing specifically on operations during the initial descent into the terminal area. Airborne conflict resolution performance in descent, conformance to traffic flow management constraints, and the effects of conflicting traffic on constraint conformance are all presented. Subjective data from subject pilots are also presented, showing perceived levels of workload, safety, and acceptability of autonomous arrival operations. Finally, potential AOP functionality enhancements are discussed along with suggestions to improve arrival procedures.

Doble, Nathan A.↗

NASA NTRS2010

Forces Associated with Nonlinear Nonholonomic Constraint Equations

A concise method has been formulated for identifying a set of forces needed to constrain the behavior of a mechanical system, modeled as a set of particles and rigid bodies, when it is subject to motion constraints described by nonholonomic equations that are inherently nonlinear in velocity. An expression in vector form is obtained for each force; a direction is determined, together with the point of application. This result is a consequence of expressing constraint equations in terms of dot products of vectors rather than in the usual way, which is entirely in terms of scalars and matrices. The constraint forces in vector form are used together with two new analytical approaches for deriving equations governing motion of a system subject to such constraints. If constraint forces are of interest they can be brought into evidence in explicit dynamical equations by employing the well-known nonholonomic partial velocities associated with Kane's method; if they are not of interest, equations can be formed instead with the aid of vectors introduced here as nonholonomic partial accelerations. When the analyst requires only the latter, smaller set of equations, they can be formed directly; it is not necessary to expend the labor to form the former, larger set first and subsequently perform matrix multiplications.

Roithmayr, Carlos M.↗

NASA NTRS2011

Linear Quadratic Tracking Design for a Generic Transport Aircraft with Structural Load Constraints

When designing control laws for systems with constraints added to the tracking performance, control allocation methods can be utilized. Control allocations methods are used when there are more command inputs than controlled variables. Constraints that require allocators are such task as; surface saturation limits, structural load limits, drag reduction constraints or actuator failures. Most transport aircraft have many actuated surfaces compared to the three controlled variables (such as angle of attack, roll rate & angle of side slip). To distribute the control effort among the redundant set of actuators a fixed mixer approach can be utilized or online control allocation techniques. The benefit of an online allocator is that constraints can be considered in the design whereas the fixed mixer cannot. However, an online control allocator mixer has a disadvantage of not guaranteeing a surface schedule, which can then produce ill defined loads on the aircraft. The load uncertainty and complexity has prevented some controller designs from using advanced allocation techniques. This paper considers actuator redundancy management for a class of over actuated systems with real-time structural load limits using linear quadratic tracking applied to the generic transport model. A roll maneuver example of an artificial load limit constraint is shown and compared to the same no load limitation maneuver.

Burken, John J.↗

NASA NTRS2012

Determining the Probability of Violating Upper-Level Wind Constraints for the Launch of Minuteman III Ballistic Missiles at Vandenberg Air Force Base

The 30th Operational Support Squadron Weather Flight (30 OSSWF) provides comprehensive weather services to the space program at Vandenberg Air Force Base (VAFB) in California. One of their responsibilities is to monitor upper-level winds to ensure safe launch operations of the Minuteman Ill ballistic missile. The 30 OSSWF tasked the Applied Meteorology Unit (AMU) to analyze VAFB sounding data with the goal of determining the probability of violating (PoV) their upper-level thresholds for wind speed and shear constraints specific to this launch vehicle, and to develop a tool that will calculate the PoV of each constraint on the day of launch. In order to calculate the probability of exceeding each constraint, the AMU collected and analyzed historical data from VAFB. The historical sounding data were retrieved from the National Oceanic and Atmospheric Administration Earth System Research Laboratory archive for the years 1994-2011 and then stratified into four sub-seasons: January-March, April-June, July-September, and October-December. The AMU determined the theoretical distributions that best fit the maximum wind speed and maximum wind shear datasets and applied this information when calculating the averages and standard deviations needed for the historical and real-time PoV calculations. In addition, the AMU included forecast sounding data from the Rapid Refresh model. This information provides further insight for the launch weather officers (LWOs) when determining if a wind constraint violation will occur over the next few hours on the day of launch. The AMU developed an interactive graphical user interface (GUI) in Microsoft Excel using Visual Basic for Applications. The GUI displays the critical sounding data easily and quickly for LWOs on day of launch. This tool will replace the existing one used by the 30 OSSWF, assist the LWOs in determining the probability of exceeding specific wind threshold values, and help to improve the overall upper winds forecast for the launch customer. This presentation will describe how the AMU calculated the historical and real-time PoV values for the specific upper-level wind launch constraints and outline the development of the interactive GUI display.

Shafer, Jaclyn A.↗

NASA NTRS2017

Method and System for Air Traffic Rerouting for Airspace Constraint Resolution

A dynamic constraint avoidance route system automatically analyzes routes of aircraft flying, or to be flown, in or near constraint regions and attempts to find more time and fuel efficient reroutes around current and predicted constraints. The dynamic constraint avoidance route system continuously analyzes all flight routes and provides reroute advisories that are dynamically updated in real time. The dynamic constraint avoidance route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

Sheth, Kapil S.↗

NASA NTRS2018

The NANOGrav 11 Year Data Set: Pulsar-Timing Constraints on the Stochastic Gravitational-Wave Background

We search for an isotropic stochastic gravitational-wave background (GWB) in the newly released 11 year data set from the North American Nanohertz Observatory for Gravitational Waves (NANOGrav). While we find no evidence for a GWB, we place constraints on a population of inspiraling supermassive black hole (SMBH) binaries, a network of decaying cosmic strings, and a primordial GWB. For the first time, we find that the GWB constraints are sensitive to the solar system ephemeris (SSE) model used and that SSE errors can mimic a GWB signal. We developed an approach that bridges systematic SSE differences, producing the first pulsar-timing array (PTA) constraints that are robust against SSE errors. We thus place a 95% upper limit on the GW-strain amplitude of A (sub GWB) < 1.45 × 10 (exp -15) at a frequency of f=1 yr(exp -1) for a fiducial f (exp -2/3) power-law spectrum and with interpulsar correlations modeled. This is a factor of approximately 2 improvement over the NANOGrav nine-year limit calculated using the same procedure. Previous PTA upper limits on the GWB (as well as their astrophysical and cosmological interpretations) will need revision in light of SSE systematic errors. We use our constraints to characterize the combined influence on the GWB of the stellar mass density in galactic cores, the eccentricity of SMBH binaries, and SMBH-galactic-bulge scaling relationships. We constrain the cosmic-string tension using recent simulations, yielding an SSE-marginalized 95% upper limit of G (sub mu) < 5.3 × 10(exp -11) - a factor of approximately 2 better than the published NANOGrav nine-year constraints. Our SSE-marginalized 95% upper limit on the energy density of a primordial GWB (for a radiation-dominated post-inflation universe) is omega (sub GWB)(f) h (exp 2) < 3.4 × 10 (exp -10).

Supermassive Black Holes↗

NASA NTRS2022

Natural Language Understanding and Extraction of Flight Constraints Recorded in Letters of Agreement

This paper presents an automated information extraction and inference technique using natural language processing for extracting flight operational procedures and constraints embedded in heritage air traffic management documents. The extracted flight constraints can be digitized and fit into existing airspace information exchange models such as the Aeronautical Information Exchange Model (AIXM). This approach offers a digitized solution to disseminate airspace operating conditions to diverse air users and stakeholders in the National Airspace System (NAS). Furthermore, the digitized flight procedures can provide operational flexibility for emerging advanced air mobility providers and reduce traffic controller workload while maintaining current safety standards. To demonstrate this process, 1,972 Letters of Agreement (LOAs) have been selected for processing, named entity extraction, constraint identification and extraction. This dataset is derived from a subset of documents related to Air Route Traffic Control Centers (ARTCC) operations. We experimented with various traditional information extraction techniques, state-of-the-art machine learning and deep learning models to perform named entity recognition and pattern recognition on our dataset. We present the results from our experiments and demonstrate 99.0% F-1 score for named entity recognition, and a 96.6% accuracy for our entire workflow up to named entity recognition. We also discuss constraint definitions using generic patterned templates and extensions to this work in applying entity linking to digitally extracting relevant constraints.

Natural Language Processing↗

NASA NTRSDate not supplied

Natural Language Understanding and Extraction of Flight Constraints Recorded in Letters of Agreement

Natural Language Processing↗