Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constraint decomposition”

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 NTRS1992

Backward assembly planning with DFA analysis

An assembly planning system that operates based on a recursive decomposition of assembly into subassemblies is presented. The planning system analyzes assembly cost in terms of stability, directionality, and manipulability to guide the generation of preferred assembly plans. The planning in this system incorporates the special processes, such as cleaning, testing, labeling, etc., that must occur during the assembly. Additionally, the planning handles nonreversible, as well as reversible, assembly tasks through backward assembly planning. In order to decrease the planning efficiency, the system avoids the analysis of decompositions that do not correspond to feasible assembly tasks. This is achieved by grouping and merging those parts that can not be decomposable at the current stage of backward assembly planning due to the requirement of special processes and the constraint of interconnection feasibility. The invention includes methods of evaluating assembly cost in terms of the number of fixtures (or holding devices) and reorientations required for assembly, through the analysis of stability, directionality, and manipulability. All these factors are used in defining cost and heuristic functions for an AO* search for an optimal plan.

Lee, Sukhan↗
NASA NTRS1995

Backward assembly planning with DFA analysis

An assembly planning system that operates based on a recursive decomposition of assembly into subassemblies, and analyzes assembly cost in terms of stability, directionality, and manipulability to guide the generation of preferred assembly plans is presented. The planning in this system incorporates the special processes, such as cleaning, testing, labeling, etc. that must occur during the assembly, and handles nonreversible as well as reversible assembly tasks through backward assembly planning. In order to increase the planning efficiency, the system avoids the analysis of decompositions that do not correspond to feasible assembly tasks. This is achieved by grouping and merging those parts that can not be decomposable at the current stage of backward assembly planning due to the requirement of special processes and the constraint of interconnection feasibility. The invention includes methods of evaluating assembly cost in terms of the number of fixtures (or holding devices) and reorientations required for assembly, through the analysis of stability, directionality, and manipulability. All these factors are used in defining cost and heuristic functions for an AO* search for an optimal plan.

Lee, Sukhan↗
NASA NTRS1995

Application of response surface techniques to helicopter rotor blade optimization procedure

In multidisciplinary optimization problems, response surface techniques can be used to replace the complex analyses that define the objective function and/or constraints with simple functions, typically polynomials. In this work a response surface is applied to the design optimization of a helicopter rotor blade. In previous work, this problem has been formulated with a multilevel approach. Here, the response surface takes advantage of this decomposition and is used to replace the lower level, a structural optimization of the blade. Problems that were encountered and important considerations in applying the response surface are discussed. Preliminary results are also presented that illustrate the benefits of using the response surface.

Henderson, Joseph Lynn↗
NASA NTRS1985

The deep structure of lunar basins - Implications for basin formation and modification

Models for the crustal structure in the vicinity of nine impact basins, from an inversion of gravity and topographic data from the lunar nearside are presented. The models display a low-density nonmare crustal layer and a mare basalt layer, both of variable thicknesses. Assuming that topography in mare areas is isostatically compensated before the emplacement of mare basalts and that compensation of mare basalt units may be neglected, a decomposition of the gravity anomaly into contributions from Moho relief and mare fill is permitted. Minimum values for mare basalt thicknesses are obtained but because mare basalts and mantle material are similar in density, the thicknesses of the nonmare crust are estimated. An important constraint is the crustal thickness inferred from the Apollo 12 and 14 landing sites from seismic observations. The crustal thickness model indicates that the crust is thinner beneath each of the major nearside basins than in surrounding areas. New bounds on the volume of material ejected from each basin are derived. The geological implications of structural differences among basins for the processes of basin formation and modification are evaluated as functions of time on the moon.

Bratt, S. R.↗
NASA NTRS2009

A Comparison of Risk Sensitive Path Planning Methods for Aircraft Emergency Landing

Determining the best site to land a damaged aircraft presents some interesting challenges for standard path planning techniques. There are multiple possible locations to consider, the space is 3-dimensional with dynamics, the criteria for a good path is determined by overall risk rather than distance or time, and optimization really matters, since an improved path corresponds to greater expected survival rate. We have investigated a number of different path planning methods for solving this problem, including cell decomposition, visibility graphs, probabilistic road maps (PRMs), and local search techniques. In their pure form, none of these techniques have proven to be entirely satisfactory - some are too slow or unpredictable, some produce highly non-optimal paths or do not find certain types of paths, and some do not cope well with the dynamic constraints when controllability is limited. In the end, we are converging towards a hybrid technique that involves seeding a roadmap with a layered visibility graph, using PRM to extend that roadmap, and using local search to further optimize the resulting paths. We describe the techniques we have investigated, report on our experiments with these techniques, and discuss when and why various techniques were unsatisfactory.

Meuleau, Nicolas↗
NASA NTRSDate not supplied

From Partial to Global Assume-Guarantee Contracts: Compositional Realizability Analysis in FRET

Realizability checking refers to the formal procedure that aims to determine whether an implementation exists, always complying to a set of requirements, regardless of the stimuli provided by the system’s environment. Such a check is essential to ensure that the specification does not allow behavior that can force the system to violate safety constraints. In this paper, we present an approach that decomposes realizability checking into smaller, more tractable problems. More specifically, our approach automatically partitions specifications into sets of non-interfering requirements. We prove that checking whether a specification is realizable reduces to checking that each partition is realizable.We have integrated realizability checking and implemented our decomposition approach within the open-source Formal Requirements ElicitationTool (FRET). A FRET user may check the realizability of a specification monolithically or compositionally. We evaluate our approach by comparing monolithic and compositional checking and showcase the strengths of our decomposition approach on a variety of industrial-level case studies

Anastasia Mavridou↗
NASA NTRS1979

Solution of a few nonlinear problems in aerodynamics by the finite elements and functional least squares methods

The numerical simulation of the transonic flows of idealized fluids and of incompressible viscous fluids, by the nonlinear least squares methods is presented. The nonlinear equations, the boundary conditions, and the various constraints controlling the two types of flow are described. The standard iterative methods for solving a quasi elliptical nonlinear equation with partial derivatives are reviewed with emphasis placed on two examples: the fixed point method applied to the Gelder functional in the case of compressible subsonic flows and the Newton method used in the technique of decomposition of the lifting potential. The new abstract least squares method is discussed. It consists of substituting the nonlinear equation by a problem of minimization in a H to the minus 1 type Sobolev functional space.

Periaux, J.↗
NASA NTRS1998

A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft

The New Millennium Remote Agent (NMRA) will be the first AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic recoveries and robust concurrent execution, all in the presence of tight real-time deadlines, changing goals, scarce resource constraints, and a wide variety of possible failures. To achieve this level of execution robustness, we have integrated a procedural executive based on generic procedures with a deductive model-based executive. A procedural executive provides sophisticated control constructs such as loops, parallel activity, locks, and synchronization which are used for robust schedule execution, hierarchical task decomposition, and routine configuration management. A deductive executive provides algorithms for sophisticated state inference and optimal failure recover), planning. The integrated executive enables designers to code knowledge via a combination of procedures and declarative models, yielding a rich modeling capability suitable to the challenges of real spacecraft control. The interface between the two executives ensures both that recovery sequences are smoothly merged into high-level schedule execution and that a high degree of reactivity is retained to effectively handle additional failures during recovery.

Pell, Barney↗
NASA NTRS2004

Lunar and Planetary Science XXXV: Impacts: Modeling and Observations

This document covers the following topics: Cratering on Titan: Projectiles, Craters and Impact Melt; The Cratering Database: Making Code Jockeys Honest; Popigai Impact Structure Modeling: Morphology and Worldwide Ejecta; Anhydrite EOS and Phase Diagram in Relation to Shock Decomposition; Computational Investigations of the Chesapeake Bay Impact Structure; Hydrocode Simulations of the Chesapeake Bay Impact; Lockne Crater as a Result of Oblique Impact; The Influence of a Deep Shelf Sea on the Excavation and Modification of a Marine-Target Crater, the Lockne Crater, Central Sweden; Pre-Drilling Investigation of the Lake Bosumtwi Impact Crater: Constraints from Geophysics and Numerical Modelling; Central Uplift Formation at the Middlesboro Impact Structure, Kentucky, USA; A SRTM Investigation of Serra da Cangalho Impact Structure, Brazil; Brazilian Impact Craters: A Review; Flynn Creek Impact Structure: New Insights from Breccias, Melt Features, Shatter Cones, and Remote Sensing; The Howell Structure, Lincoln County, Tennessee: A Review of Past and Current Research; After the Chicxulub Impact: Control on Depositional and Diagenetic History of the Cenozoic Carbonate Formations of the Northwestern Yucatan Peninsula, Mexico; Ni Contents by Non-Destructive In-Situ XRF Method of Takamatsu-Kagawa Crater District in Japan; and Akiyoshi Limestone Blocks Transported by the P/T Boundary Event to Japan Islands.

Source record↗
NASA NTRS2000

Towards Solving the Mixing Problem in the Decomposition of Geophysical Time Series by Independent Component Analysis

The use of the Principal Component Analysis technique for the analysis of geophysical time series has been questioned in particular for its tendency to extract components that mix several physical phenomena even when the signal is just their linear sum. We demonstrate with a data simulation experiment that the Independent Component Analysis, a recently developed technique, is able to solve this problem. This new technique requires the statistical independence of components, a stronger constraint, that uses higher-order statistics, instead of the classical decorrelation a weaker constraint, that uses only second-order statistics. Furthermore, ICA does not require additional a priori information such as the localization constraint used in Rotational Techniques.

Aires, Filipe↗
NASA NTRS2002

The Delta(dot) B = O Constraint vs. Minimization of Numerical Errors in MHD Simulations

The MHD equations are a system of non-strictly hyperbolic conservation laws. The non-convexity of the inviscid flux vector resulted in corresponding Jacobian matrices with undesirable properties. On the other hand, the MHD equations can be derived from basic principles in either conservative or non-conservative form. The non-conservative system has a better conditioned eigensystem. The Delta(dot)B = 0 constraint of the A4HD equations is only an initial condition constraint. One does not need the Delta(dot)B condition to close the MHD system. We formulate our new low dissipative high order scheme together with the Cargo & Gallice (1997) form of the MHD approximate Riemann solver in curvilinear grids for both versions of the MHD equations. A novel feature of our new method is that the well-conditioned eigen-decomposition of the non-conservative MHD equations is used to solve the conservative equations. This new feature of the method provides well-conditioned eigenvectors for the conservative formulation, so that correct wave speeds for discontinuities are assured. The justification for using the non-conservative eigen-decomposition to solve the conservative equations is that our scheme has a better control of the numerical error associated with the Delta(dot)B condition. Consequently, computing both forms of the equations with the same eigen-decomposition is almost equivalent. It will be shown that this approach, using the non-conservative eigensystem when solving the conservative equations, also works well in the context of standard shock-capturing schemes.

Yee, H. C.↗
NASA NTRS2021

Constraints on Triple Oxygen Isotope Kinetics

Isotopic disequilibrium is not as well constrained as equilibrium, hindering interpretation of isotopic variations. Kinetic isotope effects, a subset of disequilibrium, are common in nature and have been assumed to be distinct from equilibrium and mass independent isotope effects based on underdeveloped criteria. Using basic physical principles, we provide needed mechanistic constraints on mass-dependent kinetic isotope effects for the triple oxygen isotope system. We find some kinetic isotope effects yield large isotopic variations, exceeding equilibrium, which could be mistaken for mass independent relationships. Meanwhile, other kinetic isotope effects are found to have triple oxygen isotope relationships that could be mistaken for equilibrium isotope effects. Comparison against prior case studies of thermal decomposition of calcite (CaCO3) and brucite (Mg(OH)2) further tests our results. Although oxygen is the focus here, our approach applies to any system with more than two isotopes.

Isotope Geochemistry↗
NASA NTRS1975

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS1977

A two-level trajectory decomposition algorithm featuring optimal intermediate target selection

A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.

Petersen, F. M.↗
NASA NTRS2005

Decomposition-Based Decision Making for Aerospace Vehicle Design

Most practical engineering systems design problems have multiple and conflicting objectives. Furthermore, the satisfactory attainment level for each objective ( requirement ) is likely uncertain early in the design process. Systems with long design cycle times will exhibit more of this uncertainty throughout the design process. This is further complicated if the system is expected to perform for a relatively long period of time, as now it will need to grow as new requirements are identified and new technologies are introduced. These points identify a need for a systems design technique that enables decision making amongst multiple objectives in the presence of uncertainty. Traditional design techniques deal with a single objective or a small number of objectives that are often aggregates of the overarching goals sought through the generation of a new system. Other requirements, although uncertain, are viewed as static constraints to this single or multiple objective optimization problem. With either of these formulations, enabling tradeoffs between the requirements, objectives, or combinations thereof is a slow, serial process that becomes increasingly complex as more criteria are added. This research proposal outlines a technique that attempts to address these and other idiosyncrasies associated with modern aerospace systems design. The proposed formulation first recasts systems design into a multiple criteria decision making problem. The now multiple objectives are decomposed to discover the critical characteristics of the objective space. Tradeoffs between the objectives are considered amongst these critical characteristics by comparison to a probabilistic ideal tradeoff solution. The proposed formulation represents a radical departure from traditional methods. A pitfall of this technique is in the validation of the solution: in a multi-objective sense, how can a decision maker justify a choice between non-dominated alternatives? A series of examples help the reader to observe how this technique can be applied to aerospace systems design and compare the results of this so-called Decomposition-Based Decision Making to more traditional design approaches.

Borer, Nicholas K.↗
NASA NTRS2002

The Delta x B = 0 Constraint Versus Minimization of Numerical Errors in MHD Simulations

The MHD equations are a system of non-strictly hyperbolic conservation laws. The non-convexity of the inviscid flux vector resulted in corresponding Jacobian matrices with undesirable properties. It has previously been shown by Powell et al. (1995) that an 'almost' equivalent MHD system in non-conservative form can be derived. This non-conservative system has a better conditioned eigensystem. Aside from Powell et al., the MHD equations can be derived from basic principles in either conservative or non-conservative form. The Delta x B = 0 constraint of the MHD equations is only an initial condition constraint, it is very different from the incompressible Navier-Stokes equations in which the divergence condition is needed to close the system (i.e., to have the same number of equations and the same number of unknown). In the MHD formulations, if Delta x B = 0 initially, all one needs is to construct appropriate numerical schemes that preserve this constraint at later time evolutions. In other words, one does not need the Delta x B condition to close the MHD system. We formulate our new scheme together with the Cargo & Gallice (1997) form of the MHD approximate Riemann solver in curvilinear grids for both versions of the MHD equations. A novel feature of our new method is that the well-conditioned eigen-decomposition of the non-conservative MHD equations is used to solve the conservative equations. This new feature of the method provides well-conditioned eigenvectors for the conservative formulation, so that correct wave speeds for discontinuities are assured. The justification for using the non-conservative eigen-decomposition to solve the conservative equations is that our scheme has a better control of the numerical error associated with the divergence of the magnetic condition. Consequently, computing both forms of the equations with the same eigen-decomposition is almost equivalent. It will be shown that this approach, using the non-conservative eigensystem when solving the conservative equations, also works well in the context of standard shock-capturing schemes.

Yee, H. C.↗
NASA NTRS1991

Coding gains and error rates from the Big Viterbi Decoder

A prototype hardware Big Viterbi Decoder (BVD) was completed for an experiment with the Galileo Spacecraft. Searches for new convolutional codes, studies of Viterbi decoder hardware designs and architectures, mathematical formulations, and decompositions of the deBruijn graph into identical and hierarchical subgraphs, and very large scale integration (VLSI) chip design are just a few examples of tasks completed for this project. The BVD bit error rates (BER), measured from hardware and software simulations, are plotted as a function of bit signal to noise ratio E sub b/N sub 0 on the additive white Gaussian noise channel. Using the constraint length 15, rate 1/4, experimental convolutional code for the Galileo mission, the BVD gains 1.5 dB over the NASA standard (7,1/2) Maximum Likelihood Convolution Decoder (MCD) at a BER of 0.005. At this BER, the same gain results when the (255,233) NASA standard Reed-Solomon decoder is used, which yields a word error rate of 2.1 x 10(exp -8) and a BER of 1.4 x 10(exp -9). The (15, 1/6) code to be used by the Cometary Rendezvous Asteroid Flyby (CRAF)/Cassini Missions yields 1.7 dB of coding gain. These gains are measured with respect to symbols input to the BVD and increase with decreasing BER. Also, 8-bit input symbol quantization makes the BVD resistant to demodulated signal-level variations which may cause higher bandwidth than the NASA (7,1/2) code, these gains are offset by about 0.1 dB of expected additional receiver losses. Coding gains of several decibels are possible by compressing all spacecraft data.

Onyszchuk, I. M.↗
NASA NTRS1993

Neurocomputing strategies in decomposition based structural design

The present paper explores the applicability of neurocomputing strategies in decomposition based structural optimization problems. It is shown that the modeling capability of a backpropagation neural network can be used to detect weak couplings in a system, and to effectively decompose it into smaller, more tractable, subsystems. When such partitioning of a design space is possible, parallel optimization can be performed in each subsystem, with a penalty term added to its objective function to account for constraint violations in all other subsystems. Dependencies among subsystems are represented in terms of global design variables, and a neural network is used to map the relations between these variables and all subsystem constraints. A vector quantization technique, referred to as a z-Network, can effectively be used for this purpose. The approach is illustrated with applications to minimum weight sizing of truss structures with multiple design constraints.

Szewczyk, Z.↗