Search NASA⌕ Search

SEARCH · Search NASA

Results for “Constraint programming”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Planetary exploration through year 2000, a core program: Mission operations

In 1980 the NASA Advisory Council created the Solar System Exploratory Committee (SSEC) to formulate a long-range program of planetary missions that was consistent with likely fiscal constraints on total program cost. The SSEC had as its primary goal the establishment of a scientifically valid, affordable program that would preserve the nation's leading role in solar system exploration, capitalize on two decades of investment, and be consistent with the coordinated set of scientific stategies developed earlier by the Committe on Planetary and Lunar Exploration (COMPLEX). The result of the SSEC effort was the design of a Core Program of planetary missions to be launched by the year 2000, together with a realistic and responsible funding plan. The Core Program Missions, subcommittee activities, science issues, transition period assumptions, and recommendations are discussed.

Source record↗
NASA NTRS1998

Strategies and Recommended Targets for Mars Surveyor Program Landing Sites

The two major constraints for selecting the Mars Surveyor Program (MSP) 2001 landing site at the time of this meeting are latitude (30'N to 15S) and elevation (< 2.5 km). The latitude belt will be narrowed down to a 15' sector after this workshop. This mission will demonstrate the capability to perform a precision landing, with the goal of achieving an accuracy of approximately 10 km, 3-sigma. There will be at least two different landing sites ('01 and '03) selected in the MSP. However, there should be an option of having the '05 sample return mission land in a different site and the '05 mission should be equipped with a rover for two reasons. The reasoning behind this follows: '05 lander/rover package should have the option of going to an independent site from either '01 or '03 because predecessor missions (orbital) may locate the "Ultimate Site"; '05 needs a rover to either: (A) explore and sample this "ultimate site" for sample return; (B) retrieve samples from '01 or '03 rovers, as a contingency, in case these rovers malfunction and cannot negotiate the trek back to the sample return vehicle.

Rice, James W., Jr.↗
NASA NTRSDate not supplied

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, explicit, path-adaptive descent guidance algorithms must provide the stability and customizability required for a safe and efficient descent to the lunar surface, while also meeting program and vehicle constraints. Several descent algorithms have been flown and tested for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms to a two-stage descent vehicle. Due to payload mass and fairing constraints of the existing fleet of launch vehicles, multi-stage descent architectures are a unique option for achieving the greatest possible mass to lunar surface. This paper seeks to compare the performance of guidance configurations of a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a baseline to compare the guidance algorithms tested. Time-to-go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Preliminary results are presented that show relative performance metrics for a range of different guidance algorithm configurations.

Jason M Everett↗
NASA NTRS2020

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, the necessity for path-adaptive guidance algorithms has become clear in order to provide the stability and customizability required for a safe and efficient descent to the lunar surface, while meeting specified program and vehicle constraints. Several descent algorithms have been tested and flown for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms for a two-stage descent vehicle. Due to the limited payload mass constraints of the existing fleet of launch vehicles, multi-stage descent architectures have become a viable course of action. This paper seeks to compare the performance of guidance configurations for a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a comparison baseline for the guidance algorithms tested. Time-to -go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Further work is to be completed on trajectory design trades as well as the effects of modifying guidance targets in simulation based on trajectories that are optimized for different performance indices.

Jason M Everett↗
NASA NTRS1996

A System for Automatically Generating Scheduling Heuristics

The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

Morris, Robert↗
NASA NTRS2005

Quadratic Programming for Allocating Control Effort

A computer program calculates an optimal allocation of control effort in a system that includes redundant control actuators. The program implements an iterative (but otherwise single-stage) algorithm of the quadratic-programming type. In general, in the quadratic-programming problem, one seeks the values of a set of variables that minimize a quadratic cost function, subject to a set of linear equality and inequality constraints. In this program, the cost function combines control effort (typically quantified in terms of energy or fuel consumed) and control residuals (differences between commanded and sensed values of variables to be controlled). In comparison with prior control-allocation software, this program offers approximately equal accuracy but much greater computational efficiency. In addition, this program offers flexibility, robustness to actuation failures, and a capability for selective enforcement of control requirements. The computational efficiency of this program makes it suitable for such complex, real-time applications as controlling redundant aircraft actuators or redundant spacecraft thrusters. The program is written in the C language for execution in a UNIX operating system.

Singh, Gurkirpal↗
NASA NTRS1987

Motion coordination and programmable teleoperation between two industrial robots

Tasks for two coordinated industrial robots always bring the robots in contact with a same object. The motion coordination among the robots and the object must be maintained all the time. To plan the coordinated tasks, only one robot's motion is planned according to the required motion of the object. The motion of the second robot is to follow the first one as specified by a set of holonomic equality constraints at every time instant. If any modification of the object's motion is needed in real-time, only the first robot's motion has to be modified accordingly in real-time. The modification for the second robot is done implicitly through the constraint conditions. Thus the operation is simplified. If the object is physically removed, the second robot still continually follows the first one through the constraint conditions. If the first robot is maneuvered through either the teach pendant or the keyboard, the second one moves accordingly to form the teleoperation which is linked through the software programming. Obviously, the second robot does not need to duplicate the first robot's motion. The programming of the constraints specifies their relative motions.

Luh, J. Y. S.↗
NASA NTRS1990

A knowledge-based approach to configuration layout, justification, and documentation

The design, development, and implementation is described of a prototype expert system which could aid designers and system engineers in the placement of racks aboard modules on Space Station Freedom. This type of problem is relevant to any program with multiple constraints and requirements demanding solutions which minimize usage of limited resources. This process is generally performed by a single, highly experienced engineer who integrates all the diverse mission requirements and limitations, and develops an overall technical solution which meets program and system requirements with minimal cost, weight, volume, power, etc. This system architect performs an intellectual integration process in which the underlying design rationale is often not fully documented. This is a situation which lends itself to an expert system solution for enhanced consistency, thoroughness, documentation, and change assessment capabilities.

Craig, F. G.↗
NASA NTRS1991

A Knowledge-Based Approach to Configuration Layout, Justification, and Documentation

The design, development, and implementation of a prototype expert system which could aid designers and system engineers in the placement of racks aboard modules on the Space Station Freedom are described. This type of problem is relevant to any program with multiple constraints and requirements demanding solutions which minimize usage of limited resources. This process is generally performed by a single, highly experienced engineer who integrates all the diverse mission requirements and limitations, and develops an overall technical solution which meets program and system requirements with minimal cost, weight, volume, power, etc. This system architect performs an intellectual integration process in which the underlying design rationale is often not fully documented. This is a situation which lends itself to an expert system solution for enhanced consistency, thoroughness, documentation, and change assessment capabilities.

Craig, F. G.↗
NASA NTRS1987

Dynamic delamination buckling in composite laminates under impact loading: Computational simulation

A unique dynamic delamination buckling and delamination propagation analysis capability has been developed and incorporated into a finite element computer program. This capability consists of the following: (1) a modification of the direct time integration solution sequence which provides a new analysis algorithm that can be used to predict delamination buckling in a laminate subjected to dynamic loading, and (2) a new method of modeling the composite laminate using plate bending elements and multipoint constraints. This computer program is used to predict both impact induced buckling in composite laminates with initial delaminations and the strain energy release rate due to extension of the delamination. It is shown that delaminations near the outer surface of a laminate are susceptible to local buckling and buckling-induced delamination propagation when the laminate is subjected to transverse impact loading. The capability now exists to predict the time at which the onset of dynamic delamination buckling occurs, the dynamic buckling mode shape, and the dynamic delamination strain energy release rate.

Grady, Joseph E.↗
NASA NTRS1989

Dynamic delamination buckling in composite laminates under impact loading - Computational simulation

A unique dynamic delamination buckling and delamination propagation analysis capability has been developed and incorporated into a finite element computer program. This capability consists of the following: (1) a modification of the direct time integration solution sequence which provides a new analysis algorithm that can be used to predict delamination buckling in a laminate subjected to dynamic loading, and (2) a new method of modeling the composite laminate using plate bending elements and multipoint constraints. This computer program is used to predict both impact induced buckling in composite laminates with initial delaminations and the strain energy release rate due to extension of the delamination. It is shown that delaminations near the outer surface of a laminate are susceptible to local buckling and buckling-induced delamination propagation when the laminate is subjected to transverse impact loading. The capability now exists to predict the time at which the onset of dynamic delamination buckling occurs, the dynamic buckling mode shape, and the dynamic delamination strain energy release rate.

Grady, Joseph E.↗
NASA NTRS1977

Shuttle's 160 hour ground turnaround - A design driver

Turnaround analysis added a new dimension to the Space Program with the advent of the Space Shuttle. The requirement to turn the flight hardware around in 160 working hours from landing to launch was a significant design driver and a useful tool in forcing the integration of flight and ground systems design to permit an efficient ground operation. Although there was concern that time constraints might increase program costs, the result of the analysis was to minimize facility requirements and simplify operations with resultant cost savings.

Widick, F.↗
NASA NTRS1994

Damage-Mitigating Control of Space Propulsion Systems for High Performance and Extended Life

A major goal in the control of complex mechanical system such as spacecraft rocket engine's advanced aircraft, and power plants is to achieve high performance with increased reliability, component durability, and maintainability. The current practice of decision and control systems synthesis focuses on improving performance and diagnostic capabilities under constraints that often do not adequately represent the materials degradation. In view of the high performance requirements of the system and availability of improved materials, the lack of appropriate knowledge about the properties of these materials will lead to either less than achievable performance due to overly conservative design, or over-straining of the structure leading to unexpected failures and drastic reduction of the service life. The key idea in this report is that a significant improvement in service life could be achieved by a small reduction in the system dynamic performance. The major task is to characterize the damage generation process, and then utilize this information in a mathematical form to synthesize a control law that would meet the system requirements and simultaneously satisfy the constraints that are imposed by the material and structural properties of the critical components. The concept of damage mitigation is introduced for control of mechanical systems to achieve high performance with a prolonged life span. A model of fatigue damage dynamics is formulated in the continuous-time setting, instead of a cycle-based representation, for direct application to control systems synthesis. An optimal control policy is then formulated via nonlinear programming under specified constraints of the damage rate and accumulated damage. The results of simulation experiments for the transient upthrust of a bipropellant rocket engine are presented to demonstrate efficacy of the damage-mitigating control concept.

Ray, Asok↗
NASA NTRS2008

Life Support Systems for Lunar Landers

Engineers designing life support systems for NASA s next Lunar Landers face unique challenges. As with any vehicle that enables human spaceflight, the needs of the crew drive most of the lander requirements. The lander is also a key element of the architecture NASA will implement in the Constellation program. Many requirements, constraints, or optimization goals will be driven by interfaces with other projects, like the Crew Exploration Vehicle, the Lunar Surface Systems, and the Extravehicular Activity project. Other challenges in the life support system will be driven by the unique location of the vehicle in the environments encountered throughout the mission. This paper examines several topics that may be major design drivers for the lunar lander life support system. There are several functional requirements for the lander that may be different from previous vehicles or programs and recent experience. Some of the requirements or design drivers will change depending on the overall Lander configuration. While the configuration for a lander design is not fixed, designers can examine how these issues would impact their design and be prepared for the quick design iterations required to optimize a spacecraft.

Anderson, Molly↗
NASA NTRS2018

Quantification of Dynamic Model Validation Metrics Using Uncertainty Propagation from Requirements

The Space Launch System, NASA's new large launch vehicle for long range space exploration, is presently in the final design and construction phases, with the first launch scheduled for 2019. A dynamic model of the system has been created and is critical for calculation of interface loads and natural frequencies and mode shapes for guidance, navigation, and control (GNC). Because of the program and schedule constraints, a single modal test of the SLS will be performed while bolted down to the Mobile Launch Pad just before the first launch. A Monte Carlo and optimization scheme will be performed to create thousands of possible models based on given dispersions in model properties and to determine which model best fits the natural frequencies and mode shapes from modal test. However, the question still remains as to whether this model is acceptable for the loads and GNC requirements. An uncertainty propagation and quantification (UP and UQ) technique to develop a quantitative set of validation metrics that is based on the flight requirements has therefore been developed and is discussed in this paper. There has been considerable research on UQ and UP and validation in the literature, but very little on propagating the uncertainties from requirements, so most validation metrics are "rules-of-thumb;" this research seeks to come up with more reason-based metrics. One of the main assumptions used to achieve this task is that the uncertainty in the modeling of the fixed boundary condition is accurate, so therefore that same uncertainty can be used in propagating the fixed-test configuration to the free-free actual configuration. The second main technique applied here is the usage of the limit-state formulation to quantify the final probabilistic parameters and to compare them with the requirements. These techniques are explored with a simple lumped spring-mass system and a simplified SLS model. When completed, it is anticipated that this requirements-based validation metric will provide a quantified confidence and probability of success for the final SLS dynamics model, which will be critical for a successful launch program, and can be applied in the many other industries where an accurate dynamic model is required.

Brown, Andrew M.↗
NASA NTRS2019

On Expected Value Strong Controllability

The Probabilistic Simple Temporal Network (PSTN) generalizes Simple Temporal Networks with Uncertainty (STNUs) by introducing probability distributions over the timing of uncontrollable timepoints. PSTNs are controllable if there is a strategy to execute the controllable timepoints while bounding the risk of violating any constraint to a small value. If this risk bound can't be satisfied, PSTNs are not considered controllable. We introduce the Expected Value Probabilistic SimpleTemporal Network (EPSTN), which extends PSTNs by including a benefit to the satisfaction of temporal constraints. We study the problem of Expected Value Strong Controllability (EvSC) of EPSTNs, which seeks a schedule maximizing the expected value of satisfied constraints. We solve the EvSC problem by extending a previously developed linear program, combined with search over constraints to violate at execution time. We describe conditions under which the solution to this linear program is the maximum expected value schedule. We then show how to search for constraints to discard, using the linear program at the core of the search. While the general problem is shown to be exponential, we conclude by providing several methods to bound the complexity of search.

Planning↗