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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Linear stochastic optimal control and estimation problem

Problem involves design of controls for linear time-invariant system disturbed by white noise. Solution is Kalman filter coupled through set of optimal regulator gains to produce desired control signal. Key to solution is solving matrix Riccati differential equation. LSOCE effectively solves problem for wide range of practical applications. Program is written in FORTRAN IV for batch execution and has been implemented on IBM 360.

Geyser, L. C.↗
NASA NTRS1980

Clarification process: Resolution of decision-problem conditions

A model of a general process which occurs in both decisionmaking and problem-solving tasks is presented. It is called the clarification model and is highly dependent on information flow. The model addresses the possible constraints of individual indifferences and experience in achieving success in resolving decision-problem conditions. As indicated, the application of the clarification process model is only necessary for certain classes of the basic decision-problem condition. With less complex decision problem conditions, certain phases of the model may be omitted. The model may be applied across a wide range of decision problem conditions. The model consists of two major components: (1) the five-phase prescriptive sequence (based on previous approaches to both concepts) and (2) the information manipulation function (which draws upon current ideas in the areas of information processing, computer programming, memory, and thinking). The two components are linked together to provide a structure that assists in understanding the process of resolving problems and making decisions.

Dieterly, D. L.↗
NASA NTRS2003

Use of the SCIRun PSE for Coupled Fluid-Structure Analysis

The objective of this paper is to investigate the use of Problem Solving Environments (PSE) for tightly coupled fluid-structure control analysis of aerospace vehicles. The topics include: 1) Background; 2) The SCIRun PSE; 3) Projects Done with SCIRun; 4) Research Procedures; 5) Installtion; 6) Installation Problems on NAS; 7) Module Development; 8) Module Testing Framework; 9) Time Testing of SCIRun; and 10) Time Test Results. This paper is in viewgraph form.

Cheung, Christopher↗
NASA NTRS1991

Research into the development of a knowledge acquisition taxonomy

The focus of the research was on the development of a problem solving taxonomy that can support and direct the knowledge engineering process during the development of an intelligent tutoring system. The results of the research are necessarily general. Being only a small initial attempt at a fundamental problem in artificial intelligence and cognitive psychology, the process has had to be bootstrapped and the results can only provide pointers to further, more formal research designs.

Fink, Pamela K.↗
DOE OSTI2024

Meshfree Methods

Meshfree methods have undergone substantial development and have received much attention in the last two decades. This new family of numerical methods is designed to inherit the main advantages of the finite element method such as compact supports of shape functions and good approximation properties while, at the same time, overcome the main disadvantages of the finite element method caused by the mesh dependence. The meshfree methods share a common feature that no mesh is needed and shape functions are constructed from sets of points, thus eliminating the need for time consuming mesh generation. The most significant advantage of meshfree methods is the flexibility in customizing approximation functions for desired regularity and for capturing essential physics and features of the particular problems of interest. Adaptivity formulation and multiple-scale solution strategies also can be implemented with relative ease. It has become clear that the meshfree methods provide considerable advantages over the conventional finite element methods in solving problems involving moving discontinuities, evolving material interfaces, multiple-scale phenomena, large material distortion and structural deformation, and fracture and damage processes. This Chapter gives an overview of many classes of meshfree methods, with more detailed discussions on Smoothed Particle Hydrodynamics (SPH), the Reproducing Kernel Particle Method (RKPM), Peridynamics (PD), the Material Point Method (MPM), as well as their applications in various challenging engineering problems.2

Chen, Jiun-Shyan↗
NASA NTRS1990

Solving unstructured grid problems on massively parallel computers

A highly parallel graph mapping technique that enables one to efficiently solve unstructured grid problems on massively parallel computers is presented. Many implicit and explicit methods for solving discretized partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The cost of this communication can negate the high performance promised by massively parallel computing. To eliminate this bottleneck, the graph of the irregular problem is mapped into the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. It is shown that using the heuristic mapping algorithm significantly reduces the communication time compared to a naive assignment of processes to processors.

Hammond, Steven W.↗
NASA NTRS1974

Experientally guided robots

This paper argues that an experientally guided robot is necessary to successfully explore far-away planets. Such a robot is characterized as having sense organs which receive sensory information from its environment and motor systems which allow it to interact with that environment. The sensori-motor information which it receives is organized into an experiential knowledge structure and this knowledge in turn is used to guide the robot's future actions. A summary is presented of a problem solving system which is being used as a test bed for developing such a robot. The robot currently engages in the behaviors of visual tracking, focusing down, and looking around in a simulated Martian landscape. Finally, some unsolved problems are outlined whose solutions are necessary before an experientally guided robot can be produced. These problems center around organizing the motivational and memory structure of the robot and understanding its high-level control mechanisms.

Merriam, E. W.↗
DOE OSTI2026

Regularization by denoising diffusion models for solving inverse PDE problems with application to full waveform inversion

Partial differential equation (PDE)-governed inverse problems are fundamental across various scientific and engineering applications; yet they face significant challenges due to nonlinearity, ill-posedness, and sensitivity to noise. Here, we introduce a computational framework, regularization by denoising using diffusion models for partial differential equations (RED-DiffEq), by integrating physics-driven inversion and data-driven learning. RED-DiffEq leverages pretrained diffusion models as a regularization mechanism for PDE-governed inverse problems. We apply RED-DiffEq to solve the full waveform inversion problem in geophysics, a challenging seismic imaging technique that seeks to reconstruct high-resolution subsurface velocity models from seismic measurement data. Our method shows enhanced accuracy and robustness compared to benchmark methods. Additionally, it exhibits strong generalization and domain decomposition capacity, enabling the inversion of more complex velocity models with larger domains than those used in training the diffusion model. Our framework can also be directly applied to diverse PDE-governed inverse problems.

Shan, Siming [Yale University, New Haven, CT (Unit↗
NASA NTRS1985

Experiments in structural dynamics and control using a grid

Future spacecraft are being conceived that are highly flexible and of extreme size. The two features of flexibility and size pose new problems in control system design. Since large scale structures are not testable in ground based facilities, the decision on component placement must be made prior to full-scale tests on the spacecraft. Control law research is directed at solving problems of inadequate modelling knowledge prior to operation required to achieve peak performance. Another crucial problem addressed is accommodating failures in systems with smart components that are physically distributed on highly flexible structures. Parameter adaptive control is a method of promise that provides on-orbit tuning of the control system to improve performance by upgrading the mathematical model of the spacecraft during operation. Two specific questions are answered in this work. They are: What limits does on-line parameter identification with realistic sensors and actuators place on the ultimate achievable performance of a system in the highly flexible environment? Also, how well must the mathematical model used in on-board analytic redundancy be known and what are the reasonable expectations for advanced redundancy management schemes in the highly flexible and distributed component environment?

Montgomery, R. C.↗
DOE OSTI2024

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2001

Temporal Constraint Reasoning With Preferences

A number of reasoning problems involving the manipulation of temporal information can naturally be viewed as implicitly inducing an ordering of potential local decisions involving time (specifically, associated with durations or orderings of events) on the basis of preferences. For example. a pair of events might be constrained to occur in a certain order, and, in addition. it might be preferable that the delay between them be as large, or as small, as possible. This paper explores problems in which a set of temporal constraints is specified, where each constraint is associated with preference criteria for making local decisions about the events involved in the constraint, and a reasoner must infer a complete solution to the problem such that, to the extent possible, these local preferences are met in the best way. A constraint framework for reasoning about time is generalized to allow for preferences over event distances and durations, and we study the complexity of solving problems in the resulting formalism. It is shown that while in general such problems are NP-hard, some restrictions on the shape of the preference functions, and on the structure of the preference set, can be enforced to achieve tractability. In these cases, a simple generalization of a single-source shortest path algorithm can be used to compute a globally preferred solution in polynomial time.

Khatib, Lina↗
NASA NTRS1993

Engineering the future with America's high school students

The number of students enrolled in engineering is declining while the need for engineers is increasing. One contributing factor is that most high school students have little or no knowledge about what engineering is, or what engineers do. To teach young students about engineering, engineers need good tools. This paper presents a course of study developed and used by the authors in a junior college course for high school students. Students learned about engineering through independent student projects, in-class problem solving, and use of career information resources. Selected activities from the course can be adapted to teach students about engineering in other settings. Among the most successful techniques were the student research paper assignments, working out a solution to an engineering problem as a class exercise, and the use of technical materials to illustrate engineering concepts and demonstrate 'tools of the trade'.

Farrance, M. A.↗
NASA NTRS1983

Software simulator for multiple computer simulation system

A description is given of the structure and use of a computer program that simulates the operation of a parallel processor simulation system. The program is part of an investigation to determine algorithms that are suitable for simulating continous systems on a parallel processor configuration. The simulator is designed to accurately simulate the problem-solving phase of a simulation study. Care has been taken to ensure the integrity and correctness of data exchanges and to correctly sequence periods of computation and periods of data exchange. It is pointed out that the functions performed during a problem-setup phase or a reset phase are not simulated. In particular, there is no attempt to simulate the downloading process that loads object code into the local, transfer, and mapping memories of processing elements or the memories of the run control processor and the system control processor. The main program of the simulator carries out some problem-setup functions of the system control processor in that it requests the user to enter values for simulation system parameters and problem parameters. The method by which these values are transferred to the other processors, however, is not simulated.

Ogrady, E. P.↗
NASA NTRS1987

Air traffic controller aids for planning of arrival traffic - An AI approach

Air traffic management is considered as an AI problem, and planning concepts are developed for incorporation into an automation aid for enroute arrival controllers being developed by NASA. An Assumption-Based Truth Maintenance System is modified to include the nonmonotonicities inherent in the Air Traffic Control (ATC) domain, and it is noted under what circumstances the advantages of the ATMS in standard problem-solving domains carry over to planning. The noninteracting actions of the conceptualization are contrasted with the interacting actions of other domains. It is shown that the noninteracting nature of the ATC domain makes it possible to provide an efficient planner that avoids the frame problem.

Chrisley, Ron↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 3

Synthetic Input Data and Team Results for the GO Competition Challenge 3 for Events 1 - 4 and the Sandbox, along with problem and format descriptions and code to validate data and solutions, are available here. Data for industry scenarios will not be made public. The Grid Optimization (GO) Competition Challenge 3 focused on the security-constrained optimal power flow (SCOPF) problem. It is part of a continuing effort begun with Challenges 1 and 2, to successfully discover, develop, and test innovative and disruptive software solutions for critical energy challenges and to overcome existing barriers. The broader goal of the of the GO Competition is to accelerate the development of transformational and disruptive methods for solving problems related to the electric power grid and to provide a transparent, fair, and comprehensive evaluation of new solution methods. Challenge 3 used multiperiod dynamic markets, including advisory models for extreme weather events, day-ahead markets, and the real-time markets with an extended look-ahead. In Event 4, whose submission window was August 31-September 4, 2023, 14 teams solved for the objective values of 669 scenarios (39 scenarios required solutions both with and without line switching being allowed). The 591 synthetic scenarios from 9 network models (3.6 GB) are available here. Ten teams were funded to participate and 7 won prizes totaling $2,400,000. The largest prize ($550,000) went to Mississippi State University. An additional $600,000 was awarded in Event 3 (6/15-16/2023). No prizes were awarded in Events 1 (1/25-27/2023) or 2 (4/13-14/2023). For more information on the competition and challenge see the "GO Competition Challenge 3 Information" resource below.

ACOPF↗
NASA NTRS1974

Static, stability, and dynamic analysis of shells of revolution by numerical integration - A comparison

Recent innovations in digital computer technology have enabled engineers to analyze shell structures of complex configurations without unduly restrictive approximations. An attempt is made to compare the various programs now generally available from the point of view of the advantages of the relative technique utilized, as well as the programmed state of the art. Many of the comparisons are based on the sample problems solved by the STARS-2 system of programs. These examples indicate both the structural detail which can be analyzed by, and the analytical capabilities available in, the numerical shell-of-revolution programs. All advantages and differences are demonstrated by use of solutions for realistic shell problems in the areas of statics, stability, vibrations, and dynamic response of shells subjected to time-dependent loadings.

Svalbonas, V.↗