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 217 records · Page 12

Potential Flow Theory and Operation Guide for the Panel Code PMARC

The theoretical basis for PMARC, a low-order panel code for modeling complex three-dimensional bodies, in potential flow, is outlined. PMARC can be run on a wide variety of computer platforms, including desktop machines, workstations, and supercomputers. Execution times for PMARC vary tremendously depending on the computer resources used, but typically range from several minutes for simple or moderately complex cases to several hours for very large complex cases. Several of the advanced features currently included in the code, such as internal flow modeling, boundary layer analysis, and time-dependent flow analysis, including problems involving relative motion, are discussed in some detail. The code is written in Fortran77, using adjustable-size arrays so that it can be easily redimensioned to match problem requirements and computer hardware constraints. An overview of the program input is presented. A detailed description of the input parameters is provided in the appendices. PMARC results for several test cases are presented along with analytic or experimental data, where available. The input files for these test cases are given in the appendices. PMARC currently supports plotfile output formats for several commercially available graphics packages. The supported graphics packages are Plot3D, Tecplot, and PmarcViewer.

Ashby, Dale L.↗

Highland Valley Networks and Ephemeral Lake Basins, Libya Montes, SW Isidis Basin Margin

This summarizes the analysis of geology and surface engineering criteria for an area on the southwestern border of Isidis Planitia. In this area basin plains adjoin volcanic plains of Syrtis Major Planum and dissected ancient highlands of Libya Montes. Previously three general categories of landing site have been discussed for this area: scarp-like terrain along the western margin of Isidis Planitia, marginal ridged plains, and terminus of a significant valley network basin draining Libya Montes. On the basis of geologic mapping and reconnaissance around the southwest perimeter, the plains marginal slopes adjacent to Libya Montes appear to best satisfy the thematic, geologic, and engineering goals and constraints of the Mars Surveyor program.

Crumpler, L. S.↗

Calibration of Star Formation Rates Across the Electromagnetic Spectrum

Measuring and mapping star-forming activity in galaxies is a key element for our understanding of their broad- band spectra, and their structure and evolution in our local, as well as the high-redshift Universe. The main tool we use for these measurements is the observed luminosity in various spectral lines and/or continuum bands. However, the available star-formation rate (SFR) indicators are often discrepant and subject to physical biases and calibration uncertainties. We are organizing a special session at the 2012 IAU General Assembly in Beijing, China (August 20-31, 2012) in order to bring together theoreticians and observers working in different contexts of star-formation to discuss the status of current SFR indicators, to identify open issues and to define a strategic framework for their resolution. The is an ideal time to synthesize information from the current golden era of space astrophysics and still have influence on the upcoming missions that will broaden our view of star-formation. We will be including high-energy constraints on SFR in the program and encourage participation from the high energy astrophysics community.

Cardiff, Ann H.↗

History of Space Shuttle Rendezvous

This technical history is intended to provide a technical audience with an introduction to the rendezvous and proximity operations history of the Space Shuttle Program. It details the programmatic constraints and technical challenges encountered during shuttle development in the 1970s and over thirty years of shuttle missions. An overview of rendezvous and proximity operations on many shuttle missions is provided, as well as how some shuttle rendezvous and proximity operations systems and flight techniques evolved to meet new programmatic objectives. This revised edition provides additional information on Mercury, Gemini, Apollo, Skylab, and Apollo/Soyuz. Some chapters on the Space Shuttle have been updated and expanded. Four special focus chapters have been added to provide more detailed information on shuttle rendezvous. A chapter on the STS-39 mission of April/May 1991 describes the most complex deploy/retrieve mission flown by the shuttle. Another chapter focuses on the Hubble Space Telescope servicing missions. A third chapter gives the reader a detailed look at the February 2010 STS-130 mission to the International Space Station. The fourth chapter answers the question why rendezvous was not completely automated on the Gemini, Apollo, and Space Shuttle vehicles.

Goodman, John L.↗

Propagating orientation constraints for the Hubble Space Telescope

An observing program on the Hubble Space Telescope (HST) is described in terms of exposures that are obtained by one or more of the instruments onboard the HST. Many requested exposures might specify orientation requirements and accompanying ranges. Orientation refers to the amount of roll (in degrees) about the line of sight. The range give the permissible tolerance (also in degrees). These requirements may be (1) absolute (in relation to the celestial coordinate system), (2) relative to the nominal roll angle for HST during that exposure, or (3) relative (in relation to other exposures in the observing program). The TRANSformation expert system converts proposals for astronomical observations with HST into detailed observing plans. Part of the conversion involves grouping exposures into higher level structures based on exposure characteristics. Exposures constrained to be at different orientations cannot be grouped together. Because relative orientation requirements cause implicit constraints, orientation constraints have to be propagated. TRANS must also identify any inconsistencies that may exist so they can be corrected. We have designed and implemented an orientation constraint propagator as part of TRANS. The propagator is based on an informal algebra that facilitates the setting up and propagation of the orientation constraints. The constraint propagator generates constraints between directly related exposures, and propagates derived constraints between exposures that are related indirectly. It provides facilities for path-consistency checking, identification of unsatisfiable constraints, and querying of orientation relationships. The system has been successfully operational as part of TRANS for over seven months. The solution has particular significance to space applications in which satellite/telescope pointing and attitude are constrained and relationships exist between multiple configurations.

Bose, Ashim↗

An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

Fleming, P.↗

Structural/control system optimization with variable actuator masses

A method is presented to integrate the design space for structural/control system optimization problems in the case of linear state feedback control. Nonstructural lumped masses and control system design variables as well as structural sizing variables are all treated equally as independent design variables in the optimization process. Structural and control design variable linking schemes are used in order to avoid a prohibitively large increase in the total number of independent design variables. When actuator masses are treated as nonstructural lumped mass design variables, special consideration is given to the relation between the transient peak responses and the required actuator masses which is formulated as a behavior constraint form. The original nonlinear mathematical programming problem based on a finite element formulation and linear state feedback is replaced by a sequence of explicit approximate problems exploiting various approximation concepts such as design variable linkings, temporary constraint deletion and first order Taylor series expansion of nonlinear behavior constraints in terms of intermediate design variables. Examples which involve a variety of dynamic behavior constraints (including constraints on closed-loop eigenvalues, peak transient displacements, peak actuator forces, and relations between the peak responses and the actuator masses) are effectively solved by using the method presented.

Jin, Ik M.↗

Aero/structural tailoring of engine blades (AERO/STAEBL)

This report describes the Aero/Structural Tailoring of Engine Blades (AERO/STAEBL) program, which is a computer code used to perform engine fan and compressor blade aero/structural numerical optimizations. These optimizations seek a blade design of minimum operating cost that satisfies realistic blade design constraints. This report documents the overall program (i.e., input, optimization procedures, approximate analyses) and also provides a detailed description of the validation test cases.

Brown, K. W.↗

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Arneson, Heather↗

Rendezvous targeting for space missions

A brief outline of a targeting program for use in the space shuttle mission is presented. This general purpose program can accept a large variety of constraints and can be applied to each maneuver sequence contained in the rendezvous sequence. It consists of a main program which automatically and sequentially calls a general maneuver subroutine to compute each maneuver segment contained in the maneuver sequence.

Tempelman, W. H.↗

Aircraft Turbofan Engine Health Estimation Using Constrained Kalman Filtering

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results obtained from application to a turbofan engine model. This model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗

A Scalable Analysis Toolkit

The Scalable Analysis Toolkit (SAT) project aimed to demonstrate that it is feasible and useful to statically detect software bugs in very large systems. The technical focus of the project was on a relatively new class of constraint-based techniques for analysis software, where the desired facts about programs (e.g., the presence of a particular bug) are phrased as constraint problems to be solved. At the beginning of this project, the most successful forms of formal software analysis were limited forms of automatic theorem proving (as exemplified by the analyses used in language type systems and optimizing compilers), semi-automatic theorem proving for full verification, and model checking. With a few notable exceptions these approaches had not been demonstrated to scale to software systems of even 50,000 lines of code. Realistic approaches to large-scale software analysis cannot hope to make every conceivable formal method scale. Thus, the SAT approach is to mix different methods in one application by using coarse and fast but still adequate methods at the largest scales, and reserving the use of more precise but also more expensive methods at smaller scales for critical aspects (that is, aspects critical to the analysis problem under consideration) of a software system. The principled method proposed for combining a heterogeneous collection of formal systems with different scalability characteristics is mixed constraints. This idea had been used previously in small-scale applications with encouraging results: using mostly coarse methods and narrowly targeted precise methods, useful information (meaning the discovery of bugs in real programs) was obtained with excellent scalability.

Aiken, Alexander↗

Preliminary design of composite wings for buckling, strength and displacement constraints

An unstiffened panel buckling constraint for balanced, symmetric laminated composites is included on the global design level in a mathematical programming structural optimization procedure for designing wing structures. Constraints are introduced by penalty functions, and Newton's method based on approximate second derivatives of the penalty terms is used as the search algorithm to obtain minimum-mass designs. Constraint approximations used during the optimization process contribute to the computational efficiency of the procedure. A criterion is developed that identifies the appropriate conservative form of the constraint approximations that are used with the optimization procedure. Minimum-mass design results are obtained for a multispar high-aspect-ratio wing subjected to material strength, minimum-gage, displacement, panel buckling and twist constraints. The material systems considered for the examples are all graphite-epoxy, graphite-epoxy with boron-epoxy spar caps, and all aluminum. The composite material designs are shown to have an advantage over the aluminum designs since they can often satisfy additional constraints with only small mass increases.

Starnes, J. H., Jr.↗

A Discussion of Issues in Integrity Constraint Monitoring

In the development of large-scale software systems, analysts, designers, and programmers identify properties of data objects in the system. The ability to check those assertions during runtime is desirable as a means of verifying the integrity of the program. Typically, programmers ensure the satisfaction of such properties through the use of some form of manually embedded assertion check. The disadvantage to this approach is that these assertions become entangled within the program code. The goal of the research is to develop an integrity constraint monitoring mechanism whereby a repository of software system properties (called integrity constraints) are automatically inserted into the program by the mechanism to check for incorrect program behaviors. Such a mechanism would overcome many of the deficiencies of manually embedded assertion checks. This paper gives an overview of the preliminary work performed toward this goal. The manual instrumentation of constraint checking on a series of test programs is discussed, This review then is used as the basis for a discussion of issues to be considered in developing an automated integrity constraint monitor.

Fernandez, Francisco G.↗

Investigation and characterization of constraint effects on flaw growth during fatigue loading of composite materials

An investigative program is presented in an attempt to add to the current understanding of constraint effects on the response of composite materials under cyclic loading. The objectives were: (1) to use existing data and to develop additional data in order to establish an understanding and quantitative description of flaw growth in unidirectional lamina under cyclic loading at different load direction to fiber direction angles; (2) to establish a similar understanding and description of flaw growth in lamina which are embedded in laminates between other unflawed lamina; (3) to determine the nature of the influence of constraint on flaw growth by quantitatively comparing the results of the tests; and (4) to develop a model and philosophy of constraints effects based on our investigative results.

Stinchcomb, W. W.↗

Kalman Filtering with Inequality Constraints for Turbofan Engine Health Estimation

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops two analytic methods of incorporating state variable inequality constraints in the Kalman filter. The first method is a general technique of using hard constraints to enforce inequalities on the state variable estimates. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The second method uses soft constraints to estimate state variables that are known to vary slowly with time. (Soft constraints are constraints that are required to be approximately satisfied rather than exactly satisfied.) The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results. The use of the algorithm is demonstrated on a linearized simulation of a turbofan engine to estimate health parameters. The turbofan engine model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗

Application of modern tools and techniques to maximize engineering productivity in the development of orbital operations plans for the space station progrm

The Space Station Program will incorporate analysis of operations constraints and considerations in the early design phases to avoid the need for later modifications to the Space Station for operations. The application of modern tools and administrative techniques to minimize the cost of performing effective orbital operations planning and design analysis in the preliminary design phase of the Space Station Program is discussed. Tools and techniques discussed include: approach for rigorous analysis of operations functions, use of the resources of a large computer network, and providing for efficient research and access to information.

Manford, J. S.↗