SEARCH · Search NASA

Results for “problem”

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 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Designing the Design Process for Early Problem Discovery for a Complex Aeronautics Systems Challenge

The earliest stage in the innovation lifecycle, problem formulation, is crucial for setting direction in an innovation effort. When faced with an interesting problem, engineers commonly assume the approximate solution area and focus on ideating innovative solutions. However, in this project, NASA and their contracted partner, Accenture, collaboratively conducted problem discovery to ensure that solutioning efforts were focused on the right problems, for the right users, and addressing the most critical needs—in this case, exploring weather tolerant operations (WTO) to further urban air mobility (UAM) – known as UAM WTO. The project team leveraged generative, qualitative methods to understand the ecosystem, players, and where challenges in the industry are inhibiting development. The complexity of the problem area required that the team constantly observe and iterate on problem discovery, effectively “designing the design process.” This report discusses the approach, methodologies, and selected results, including insights on the application of early-stage design methodologies to a complex, system-level problem.

Problem formulation↗

NASA NTRSDate not supplied

MAGE: Alleviating Uncertainty in Real-Time Decision-Making as a Function of Problem Complexity

In this paper, we discuss a critical aspect of uncertainty in the operation of complex systems, such as the future air traffic: the ability of agents in the system to arrive at satisfactory decisions and the attendant actions as a function of problem complexity. Intuitively, when the problem complexity is manageable, given an appropriate decision problem formulation and solution tools, an agent (computational or human) has no trouble arriving at a solution that yields good outcomes for the agent and the system. Growing problem complexity results in progressively larger computational problems that may yield suboptimal solutions or even be intractable within required time limits or at all. We propose a measurable representation of complexity in terms of problem tractability and quality of solutions. We also propose a computational scheme, MAGE (Monitor, Anticipate, Guide, Evolve), for detecting approaching transitions from efficient decision-making states to inefficient to unsafe ones, so that operations based on decision-making can be reconfigured to forestall unfavorable transitions, returning to efficient modes when complexity diminishes. Maintaining tractable complexity reduces the uncertainty in the outcomes of decision-making. We describe the general scheme, an outline of MAGE applied to managing airspace complexity, and initial examples of investigating the tractability of problem-solving schemes.

complexity management↗

NASA NTRS1973

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗

NASA NTRS1976

The Crack-contact and the Free End Problem for a Strip Under Residual Stress

The plane problem for an infinite strip with two edge cracks under a given state of residual stress is considered. The residual stress is compressive near and at the surfaces and tensile in the interior of the strip. If the crack is deep enough to penetrate into the tensile zone, then the problem is one of crack-contact problem in which the depth of the contact area is an unknown which depends on the crack depth and the residual stress profile. The problem has applications to the static fatigue of glass plates and is solved for three typical residual stress profiles. In the limiting case of the crack crossing the entire plate thickness, the problem becomes a stress-free end problem for a semi-infinite strip under a given residual stress state away from the end. This is a typical stress diffusion problem in which decay behavior of the residual stress near and the nature of the normal displacement at the end of the semi-infinite strip are of special interest. For two typical residual stress states the solution is obtained, and some numerical results are given.

Bakioglu, M.↗

NASA NTRS1978

Human problem solving performance in a fault diagnosis task

It is proposed that humans in automated systems will be asked to assume the role of troubleshooter or problem solver and that the problems which they will be asked to solve in such systems will not be amenable to rote solution. The design of visual displays for problem solving in such situations is considered, and the results of two experimental investigations of human problem solving performance in the diagnosis of faults in graphically displayed network problems are discussed. The effects of problem size, forced-pacing, computer aiding, and training are considered. Results indicate that human performance deviates from optimality as problem size increases. Forced-pacing appears to cause the human to adopt fairly brute force strategies, as compared to those adopted in self-paced situations. Computer aiding substantially lessens the number of mistaken diagnoses by performing the bookkeeping portions of the task.

Rouse, W. B.↗

NASA NTRS1983

Formulation and solution of rotary-wing aeroelastic stability and response problems

The state of the art in the formulation and solution of rotary-wing aeroelastic stability and response problems is reviewed in detail. The approximations used in the structural, inertia and aerodynamic operators are discussed. The important role of geometric nonlinearities, due to moderate deflections, and aerodynamic stall in the aeroelastic stability and response problem are identified. It is also shown that geometric nonlinearities are of primary importance in aeroelastic stability calculations, and have a more limited, though important, role in response calculations. Next, formulation of coupled rotor/fuselage problems is described, for both air and ground resonance type problems. Both topics, the isolated blade problem and the coupled rotor/fuselage problem, are treated for both hover and forward flight. Solution of aeroelastic stability and response problems proceeds in two stages. First, the spatial dependence is eliminated by using Galerkin's method, or by using the finite element method. Next the nonlinear, or linear, ordinary differential equation with periodic coefficients have to be solved for stability or response. Efficient numerical methods for accomplishing these objectives are presented in a comprehensive manner. The paper contains a number of illustrative numerical results which are intended to clarify various aspects of the modeling process and serve as representative results for both aeroelastic stability and response calculations for a variety of blade and rotor configurations.

Friedmann, P. P.↗

NASA NTRS1984

Numerical solutions of acoustic wave propagation problems using Euler computations

This paper reports solution procedures for problems arising from the study of engine inlet wave propagation. The first problem is the study of sound waves radiated from cylindrical inlets. The second one is a quasi-one-dimensional problem to study the effect of nonlinearities and the third one is the study of nonlinearities in two dimensions. In all three problems Euler computations are done with a fourth-order explicit scheme. For the first problem results are shown in agreement with experimental data and for the second problem comparisons are made with an existing asymptotic theory. The third problem is part of an ongoing work and preliminary results are presented for this case.

Hariharan, S. I.↗

NASA NTRS1984

Numerical solutions of acoustic wave propagation problems using Euler computations

Hariharan, S. I.↗

NASA NTRS1985

Periodic orbits of the general three-body problem for the sun-Jupiter-Saturn system

Two families of symmetric periodic orbits of the planar, general, three-body problem are presented. The masses of the three bodies include ratios equal to the sun-Jupiter-Saturn system and the periods of the orbits of Jupiter and Saturn are in a 2:5 resonance. The (linear) stability of the orbits are studied in relation to eccentricity and mass variations. The generation of the two families of periodic orbits follows a systematic approach and employs (numerical) continuation from periodic orbits of the first and second kind in the circular restricted problem to the elliptic restricted problem and from the circular and elliptic problems to the general problem through bifurcation phenomena relating the three dynamical systems. The approach also provides insight into the evolutionary process of periodic orbits continued from the restricted problems to the general problem.

Kwok, J. H.↗

NASA NTRS1988

Learning dominance relations in combinatorial search problems

Dominance relations commonly are used to prune unnecessary nodes in search graphs, but they are problem-dependent and cannot be derived by a general procedure. The authors identify machine learning of dominance relations and the applicable learning mechanisms. A study of learning dominance relations using learning by experimentation is described. This system has been able to learn dominance relations for the 0/1-knapsack problem, an inventory problem, the reliability-by-replication problem, the two-machine flow shop problem, a number of single-machine scheduling problems, and a two-machine scheduling problem. It is considered that the same methodology can be extended to learn dominance relations in general.

Yu, Chee-Fen↗

NASA NTRS1988

On the constrained Chebyshev approximation problem on ellipses

Constrained Chebyshev approximation problems of the type with minimum (p is an element of Pi(sub n):p(c)=1) and maximum (z is an element of E) with /p(z)/ are considered. Here Pi(sub n) denotes the set of all complex polynomials of degree at most n, E is any ellipse in the complex plane, and c is an element of C/E. Such approximation problems arise in the context of optimizing semi-iterative methods for the solution of large, sparse systems of linear equations Ax=b with complex non-Hermitian coefficient matrices A. The problem of obtaining optimal polynomial preconditioners for conjugate gradient type methods for Ax=b also leads to problems of this type. A new family of polynomials -- q(sub n)(z;c), n is an element of N, and c is an element of C/E -- are introduced as the polynomials which are optimal for a modified version of the Chebyshev approximation problem with Pi(sub n) replaced by a certain subfamily. Some simple properties of q(sub n) are also listed. A necessary and sufficient condition for q(sub n) to be the extremal polynomial for the approximation problem is then derived. Finally, it is shown that q(sub n) is indeed optimal for the problem for all fixed n whenever the distance between c and E is sufficiently large. Results of some numerical tests are presented.

Freund, Roland↗

NASA NTRS1988

A multi-satellite orbit determination problem in a parallel processing environment

The Engineering Orbit Analysis Unit at GE Valley Forge used an Intel Hypercube Parallel Processor to investigate the performance and gain experience of parallel processors with a multi-satellite orbit determination problem. A general study was selected in which major blocks of computation for the multi-satellite orbit computations were used as units to be assigned to the various processors on the Hypercube. Problems encountered or successes achieved in addressing the orbit determination problem would be more likely to be transferable to other parallel processors. The prime objective was to study the algorithm to allow processing of observations later in time than those employed in the state update. Expertise in ephemeris determination was exploited in addressing these problems and the facility used to bring a realism to the study which would highlight the problems which may not otherwise be anticipated. Secondary objectives were to gain experience of a non-trivial problem in a parallel processor environment, to explore the necessary interplay of serial and parallel sections of the algorithm in terms of timing studies, to explore the granularity (coarse vs. fine grain) to discover the granularity limit above which there would be a risk of starvation where the majority of nodes would be idle or under the limit where the overhead associated with splitting the problem may require more work and communication time than is useful.

Deakyne, M. S.↗

NASA NTRS1987

Incremental planning to control a blackboard-based problem solver

To control problem solving activity, a planner must resolve uncertainty about which specific long-term goals (solutions) to pursue and about which sequences of actions will best achieve those goals. A planner is described that abstracts the problem solving state to recognize possible competing and compatible solutions and to roughly predict the importance and expense of developing these solutions. With this information, the planner plans sequences of problem solving activities that most efficiently resolve its uncertainty about which of the possible solutions to work toward. The planner only details actions for the near future because the results of these actions will influence how (and whether) a plan should be pursued. As problem solving proceeds, the planner adds new details to the plan incrementally, and monitors and repairs the plan to insure it achieves its goals whenever possible. Through experiments, researchers illustrate how these new mechanisms significantly improve problem solving decisions and reduce overall computation. They briefly discuss current research directions, including how these mechanisms can improve a problem solver's real-time response and can enhance cooperation in a distributed problem solving network.

Durfee, E. H.↗

NASA NTRS1990

Singular perturbation analysis of AOTV-related trajectory optimization problems

The problem of real time guidance and optimal control of Aeroassisted Orbit Transfer Vehicles (AOTV's) was addressed using singular perturbation theory as an underlying method of analysis. Trajectories were optimized with the objective of minimum energy expenditure in the atmospheric phase of the maneuver. Two major problem areas were addressed: optimal reentry, and synergetic plane change with aeroglide. For the reentry problem, several reduced order models were analyzed with the objective of optimal changes in heading with minimum energy loss. It was demonstrated that a further model order reduction to a single state model is possible through the application of singular perturbation theory. The optimal solution for the reduced problem defines an optimal altitude profile dependent on the current energy level of the vehicle. A separate boundary layer analysis is used to account for altitude and flight path angle dynamics, and to obtain lift and bank angle control solutions. By considering alternative approximations to solve the boundary layer problem, three guidance laws were derived, each having an analytic feedback form. The guidance laws were evaluated using a Maneuvering Reentry Research Vehicle model and all three laws were found to be near optimal. For the problem of synergetic plane change with aeroglide, a difficult terminal boundary layer control problem arises which to date is found to be analytically intractable. Thus a predictive/corrective solution was developed to satisfy the terminal constraints on altitude and flight path angle. A composite guidance solution was obtained by combining the optimal reentry solution with the predictive/corrective guidance method. Numerical comparisons with the corresponding optimal trajectory solutions show that the resulting performance is very close to optimal. An attempt was made to obtain numerically optimized trajectories for the case where heating rate is constrained. A first order state variable inequality constraint was imposed on the full order AOTV point mass equations of motion, using a simple aerodynamic heating rate model.

Calise, Anthony J.↗

NASA NTRS1996

A Cascade Optimization Strategy for Solution of Difficult Multidisciplinary Design Problems

A research project to comparatively evaluate 10 nonlinear optimization algorithms was recently completed. A conclusion was that no single optimizer could successfully solve all 40 problems in the test bed, even though most optimizers successfully solved at least one-third of the problems. We realized that improved search directions and step lengths, available in the 10 optimizers compared, were not likely to alleviate the convergence difficulties. For the solution of those difficult problems we have devised an alternative approach called cascade optimization strategy. The cascade strategy uses several optimizers, one followed by another in a specified sequence, to solve a problem. A pseudorandom scheme perturbs design variables between the optimizers. The cascade strategy has been tested successfully in the design of supersonic and subsonic aircraft configurations and air-breathing engines for high-speed civil transport applications. These problems could not be successfully solved by an individual optimizer. The cascade optimization strategy, however, generated feasible optimum solutions for both aircraft and engine problems. This paper presents the cascade strategy and solutions to a number of these problems.

Patnaik, Surya N.↗

NASA NTRS1996

An Autograding (Student) Problem Management System for the Compeuwtir Ilittur8

In order to develop analysis skills necessary in engineering disciplines, students need practice solving problems using specified analytical techniques. Unless homework is collected and graded, students tend not to spend much time or effort in performing it. Teachers do not, realistically, have the time to grade large numbers of homework problems on a regular basis. This paper presents and makes available a miracle cure. The Autograding Problem Management System (APMS) provides a discipline-independent mechanism for teachers to create (quickly and easily) sets of homework problems. The APMS system provides CRT and/or printed summaries of the graded student responses. This presentation will demonstrate both the speed and the drag-and-drop simplicity of using the APMS to create self-grading homework problem sets comprised of traditional types of problems and of problems which would not be possible without the use of computers.

Kohne, Glenn S.↗

NASA NTRS1997

Application of PML Absorbing Boundary Conditions to the Benchmark Problems of Computational Aeroacoustics

Accurate numerical non-reflecting boundary conditions are important in all the proposed benchmark problems of the Second Workshop. Recently, a new absorbing boundary condition has been developed using Perfectly Matched Layer (PML) equations for the Euler equations. In this approach, a region with a width of a few grid points is introduced adjacent to the non-reflecting boundaries. In the added region, Perfectly Matched Layer equations are constructed and applied so that the out-going waves are absorbed inside the layer with little reflection to the interior domain. It will be demonstrated in the present paper that the proposed absorbing boundary condition is quite general and versatile, applicable to radiation boundaries as well as inflow and outflow boundaries. It is also easy to implement. The emphasis of the paper will be on the application of the PML absorbing boundary condition to problems in Categories 1, 2, and 3. In Category 1, solutions of problems 1 and 2 are presented. Both problems are solved using a multi-domain polar grid system. Perfectly Matched Layer equations for a circular boundary are constructed and their effectiveness assessed. In Category 2, solutions of problem 2 are presented. Here, in addition to the radiation boundary conditions at the far field in the axisymmetric coordinate system, the inflow boundary condition at the duct inlet is also dealt with using the proposed Perfectly Match Layer equations. At the inlet, a PML domain is introduced in which the incident duct mode is simulated while the waves reflected from the open end of the duct are absorbed at the same time. In Category 3, solutions of all three problems are presented. Again, the PML absorbing boundary condition is used at the inflow boundary so that the incoming vorticity wave is simulated while the outgoing acoustic waves are absorbed with very little numerical reflection. All the problems are solved using central difference schemes for spatial discretizations and the optimized Low-Dissipation and Low-Dispersion Runge-Kutta scheme for the time integration. Issues of numerical accuracy and efficiency are also addressed.

Hu, Fang Q.↗

NASA NTRS2003

Dynamically Reconfigurable Approach to Multidisciplinary Problems

The complexity and autonomy of the constituent disciplines and the diversity of the disciplinary data formats make the task of integrating simulations into a multidisciplinary design optimization problem extremely time-consuming and difficult. We propose a dynamically reconfigurable approach to MDO problem formulation wherein an appropriate implementation of the disciplinary information results in basic computational components that can be combined into different MDO problem formulations and solution algorithms, including hybrid strategies, with relative ease. The ability to re-use the computational components is due to the special structure of the MDO problem. We believe that this structure can and should be used to formulate and solve optimization problems in the multidisciplinary context. The present work identifies the basic computational components in several MDO problem formulations and examines the dynamically reconfigurable approach in the context of a popular class of optimization methods. We show that if the disciplinary sensitivity information is implemented in a modular fashion, the transfer of sensitivity information among the formulations under study is straightforward. This enables not only experimentation with a variety of problem formations in a research environment, but also the flexible use of formulations in a production design environment.

Alexandrov, Natalie M.↗