Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1997

Dynamic Reconstruction and Multivariable Control for Force-Actuated, Thin Facesheet Adaptive Optics

The Multiple Mirror Telescope (MMT) under development at the University of Arizona takes a new approach in adaptive optics placing a large (0.65 m) force-actuated, thin facesheet deformable mirror at the secondary of an astronomical telescope, thus reducing the effects of emissivity which are important in IR astronomy. However, The large size of the mirror and low stiffness actuators used drive the natural frequencies of the mirror down into the bandwidth of the atmospheric distortion. Conventional adaptive optics takes a quasi-static approach to controlling the, deformable mirror. However, flexibility within the control bandwidth calls for a new approach to adaptive optics. Dynamic influence functions are used to characterize the influence of each actuator on the surface of the deformable mirror. A linearized model of atmospheric distortion is combined with dynamic influence functions to produce a dynamic reconstructor. This dynamic reconstructor is recognized as an optimal control problem. Solving the optimal control problem for a system with hundreds of actuators and sensors is formidable. Exploiting the circularly symmetric geometry of the mirror, and a suitable model of atmospheric distortion, the control problem is divided into a number of smaller decoupled control problems using circulant matrix theory. A hierarchic control scheme which seeks to emulate the quasi-static control approach that is generally used in adaptive optics is compared to the proposed dynamic reconstruction technique. Although dynamic reconstruction requires somewhat more computational power to implement, it achieves better performance with less power usage, and is less sensitive than the hierarchic technique.

Grocott, Simon C. O.↗
NASA NTRS2000

A Novel Approach to Solving the Problem of Needle Microcrystals (A Case Study of Ribosome Crystals)

Different morphology crystals (needle, rod-tetragonal and wedge-shaped) were grown from the same solution of ribosome; furthermore, in the same drop using 10- 15% 2-methyl-2,4pentanediol as a precipitant. The crystals appeared in 5-48 hours. Observations of the kinetics of crystals appearance lead to the conclusion that higher supersaturation of ribosome solution produces needle-shaped crystals, while the tetragonal-rod and the wedge-shaped crystals grow at lower supersaturation. The ribosome packing in the crystals was characterized by electron microscopy (EM). An analysis of EM ultrathin sections indicates that the unit cells, with a high degree of probability, are the same in the crystals of different morphology. The data obtained suggests how to shift the process of crystal formation from the needles to the crystals with comparative size in all three dimensions.

Karpova, Elizaveta A.↗
NASA NTRS2004

A Decision-Theoretic Approach to Autonomous Planetary Rover Control

The report discusses the: Decentralized Control of Markov Decision Processes. Study the complexity of decentralized control of Markov decision processes, and develop algorithms for finding optimal control policies. Scheduling Contract Algorithms. Develop an optimal method for scheduling runs of a contract anytime algorithm (one that takes the deadline as input) in situations where the deadline is unknown, multiple problem instances must be solved, and a multi-processor machine is available. Planetary Rover Control as a Markov Decision Process.Use the Markov decision process framework to formalize and solve problems in planetary rover control. Adaptive Peer Selection. Use reinforcement learning to maximize the expected down-load speed for a client in a peer-to-peer file sharing system.

Zilberstein, Shlomo↗
NASA NTRS2005

Bayesian Inference in Satellite Gravity Inversion

To solve a geophysical inverse problem means applying measurements to determine the parameters of the selected model. The inverse problem is formulated as the Bayesian inference. The Gaussian probability density functions are applied in the Bayes's equation. The CHAMP satellite gravity data are determined at the altitude of 400 kilometer altitude over the South part of the Pannonian basin. The model of interpretation is the right vertical cylinder. The parameters of the model are obtained from the minimum problem solved by the Simplex method.

Kis, K. I.↗
NASA NTRS1998

Design Process for High Speed Civil Transport Aircraft Improved by Neural Network and Regression Methods

A key challenge in designing the new High Speed Civil Transport (HSCT) aircraft is determining a good match between the airframe and engine. Multidisciplinary design optimization can be used to solve the problem by adjusting parameters of both the engine and the airframe. Earlier, an example problem was presented of an HSCT aircraft with four mixed-flow turbofan engines and a baseline mission to carry 305 passengers 5000 nautical miles at a cruise speed of Mach 2.4. The problem was solved by coupling NASA Lewis Research Center's design optimization testbed (COMETBOARDS) with NASA Langley Research Center's Flight Optimization System (FLOPS). The computing time expended in solving the problem was substantial, and the instability of the FLOPS analyzer at certain design points caused difficulties. In an attempt to alleviate both of these limitations, we explored the use of two approximation concepts in the design optimization process. The two concepts, which are based on neural network and linear regression approximation, provide the reanalysis capability and design sensitivity analysis information required for the optimization process. The HSCT aircraft optimization problem was solved by using three alternate approaches; that is, the original FLOPS analyzer and two approximate (derived) analyzers. The approximate analyzers were calibrated and used in three different ranges of the design variables; narrow (interpolated), standard, and wide (extrapolated).

Hopkins, Dale A.↗
NASA NTRS2005

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding Pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the Pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide Pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRS2014

Precise Heat Control: What Every Scientist Needs to Know About Pyrolytic Techniques to Solve Real Problems

The performance of a material is greatly influenced by its thermal and chemical properties. Analytical pyrolysis, when coupled to a GC‐MS system, is a powerful technique that can unlock the thermal and chemical properties of almost any substance and provide vital information. At NASA, we depend on precise thermal analysis instrumentation for understanding aerospace travel. Our analytical techniques allow us to test materials in the laboratory prior to an actual field test; whether the field test is miles up in the sky or miles underground, the properties of any involved material must be fully studied and understood in the laboratory.

Devivar, Rodrigo↗
NASA NTRS1982

Experiences with explicit finite-difference schemes for complex fluid dynamics problems on STAR-100 and CYBER-203 computers

Several two- and three-dimensional external and internal flow problems solved on the STAR-100 and CYBER-203 vector processing computers are described. The flow field was described by the full Navier-Stokes equations which were then solved by explicit finite-difference algorithms. Problem results and computer system requirements are presented. Program organization and data base structure for three-dimensional computer codes which will eliminate or improve on page faulting, are discussed. Storage requirements for three-dimensional codes are reduced by calculating transformation metric data in each step. As a result, in-core grid points were increased in number by 50% to 150,000, with a 10% execution time increase. An assessment of current and future machine requirements shows that even on the CYBER-205 computer only a few problems can be solved realistically. Estimates reveal that the present situation is more storage limited than compute rate limited, but advancements in both storage and speed are essential to realistically calculate three-dimensional flow.

Kumar, A.↗
NASA NTRS1987

The minimal residual QR-factorization algorithm for reliably solving subset regression problems

A new algorithm to solve test subset regression problems is described, called the minimal residual QR factorization algorithm (MRQR). This scheme performs a QR factorization with a new column pivoting strategy. Basically, this strategy is based on the change in the residual of the least squares problem. Furthermore, it is demonstrated that this basic scheme might be extended in a numerically efficient way to combine the advantages of existing numerical procedures, such as the singular value decomposition, with those of more classical statistical procedures, such as stepwise regression. This extension is presented as an advisory expert system that guides the user in solving the subset regression problem. The advantages of the new procedure are highlighted by a numerical example.

Verhaegen, M. H.↗
NASA NTRS1993

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.↗
NASA NTRS1976

A finite difference method of solving anisotropic scattering problems

A new method of solving radiative transfer problems is described including a comparison of its speed with that of the doubling method, and a discussion of its accuracy and suitability for computations involving variable optical properties. The method uses a discretization in angle to produce a coupled set of first-order differential equations which are integrated between discrete depth points to produce a set of recursion relations for symmetric and anti-symmetric angular sums of the radiation field at alternate depth points. The formulation given here includes depth-dependent anisotropic scattering, absorption, and internal sources, and allows arbitrary combinations of specular and non-Lambertian diffuse reflection at either or both boundaries. Numerical tests of the method show that it can return accurate emergent intensities even for large optical depths. The method is also shown to conserve flux to machine accuracy in conservative atmospheres

Barkstrom, B. R.↗
NASA NTRS1988

Life-span knowledge engineering for space operations

Ordinarily, knowledge engineering is thought of as the process of translating the knowledge and problem solving strategies of a human expert into rules and procedures incorporated into a machine based expert system which can, given adequate input, solve the same sorts of problems as the expert. One appeal of these knowledge based systems is their ability to take care of problems without having a human expert present. For work in space, being independent of humans is especially important both for situations where devices will be in remote or dangerous locales and for situations such as space stations where human resources are limited and schedules are tight. In qualification of the above ideas, it is argued herein that the notion of knowledge engineering and the expectations for its application should be extended beyond the period of construction of unit expert systems to the entire knowledge system management associated with one or another real systems, whether it is a piece of hardware or an entire human-machine operation such as a lunar factory.

Hays, Dan↗
NASA NTRS2002

Science Fairs and Observational Science: A Case History from Earth Orbit

Having judged dozens of science fairs over the years, I am repeatedly disturbed by the ground rules under which students must prepare their entries. They are almost invariably required to follow the "scientific method," involving formulating a hypothesis, a test of the hypothesis, and then a project in which this test is carried out. As a research scientist for over 40 years, I consider this approach to science fairs fundamentally unsound. It is not only too restrictive, but actually avoids the most important (and difficult) part of scientific research: recognizing a scientific problem in the first place. A well-known example is one of the problems that, by his own account, stimulated Einstein's theory of special relativity: the obvious fact that when an electric current is induced in a conductor by a magnetic field , it makes no difference whether the field or the conductor is actually (so to speak) moving. There is in other words no such thing as absolute motion. Physics was transformed by Einstein's recognition of a problem. Most competent scientists can solve problems after they have been recognized and a hypothesis properly formulated, but the ability to find problems in the first Place is much rarer. Getting down to specifics, the "scientific method" under which almost all students must operate is actually the experimental method, involving controlled variables, one of which, ideally, is changed at a time. However, there is another type of science that can be called observational science. As it happens, almost all the space research I have carried out since 1959 has been this type, not experimental science.

Lowman, Paul D., Jr.↗
NASA NTRS2004

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗