Search NASA⌕ Search

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.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
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 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.↗
NASA NTRS2003

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including 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. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗
NASA NTRS2004

Unifying Temporal and Structural Credit Assignment Problems

Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the structural credit assignment problem of determining the contributions of a particular agent to a common task. Instead, time-extended single-agent systems have the temporal credit assignment problem of determining the contribution of a particular action to the quality of the full sequence of actions. Traditionally these two problems are considered different and are handled in separate ways. In this article we show how these two forms of the credit assignment problem are equivalent. In this unified frame-work, a single-agent Markov decision process can be broken down into a single-time-step multi-agent process. Furthermore we show that Monte-Carlo estimation or Q-learning (depending on whether the values of resulting actions in the episode are known at the time of learning) are equivalent to different agent utility functions in a multi-agent system. This equivalence shows how an often neglected issue in multi-agent systems is equivalent to a well-known deficiency in multi-time-step learning and lays the basis for solving time-extended multi-agent problems, where both credit assignment problems are present.

Agogino, Adrian K.↗
NASA NTRS2017

The Root Cause of the Overheating Problem

Previously we identified the receding flow, where two fluid streams recede from each other, as an open numerical problem, because all well-known numerical fluxes give an anomalous temperature rise, thus called the overheating problem. This phenomenon, although presented in several textbooks, and many previous publications, has scarcely been satisfactorily addressed and the root cause of the overheating problem not well understood. We found that this temperature rise was solely connected to entropy rise and proposed to use the method of characteristics to eradicate the problem. However, the root cause of the entropy production was still unclear. In the present study, we identify the cause of this problem: the entropy rise is rooted in the pressure flux in a finite volume formulation and is implanted at the first time step. It is found theoretically inevitable for all existing numerical flux schemes used in the finite volume setting, as confirmed by numerical tests. This difficulty cannot be eliminated by manipulating time step, grid size, spatial accuracy, etc, although the rate of overheating depends on the flux scheme used. Finally, we incorporate the entropy transport equation, in place of the energy equation, to ensure preservation of entropy, thus correcting this temperature anomaly. Its applicability is demonstrated for some relevant 1D and 2D problems. Thus, the present study validates that the entropy generated ab initio is the genesis of the overheating problem.

Liou, Meng-Sing↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
NASA NTRSDate not supplied

Content and Representation of Information Needed to Support Time-Constrained Problem Solving

NASA’s current mission-operations paradigm originated with Project Mercury and endured with minimum evolution through the Apollo Program, Space Shuttle Program, and ISS missions. At its foundation is a near-complete real-time dependence on a ground team to manage the combined state of the mission, vehicle, and crew. Utilizing many engineers and operators with broad and deep expertise; large, distributed datasets including extensive telemetry; and expansive analytical and computing power, this ground team has served as the safety net for crewed spaceflight missions over the past 60 years. This approach must change to address challenges associated with missions beyond low Earth orbit (BLEO), including infrequent resupply, reduced ability to evacuate, and delayed communications that prohibit real-time operational support. We anticipate that a necessary part of this change will be increased independence for the crew, as roles and responsibilities traditionally performed by ground teams move on board the vehicle. While many risks are associated with Earth-independent operations, one particular concern is ensuring that the crew will have adequate onboard support to perform urgent problem solving when communication with the ground is delayed or intermittent. A key resource that enables the ground team to respond to anomalies quickly and effectively is the extraordinary expertise and experience it possesses. It is comprised of 80+ experts on at any given time, with a combined 600+ years of system-specific experience across 22 unique console disciplines. A small crew will face the unprecedented challenge of independently responding to anomalies that have historically been handled by a team 20 times their size. Another important resource upon which the ground heavily relies to support procedure execution and anomaly response is data. The amount of telemetry data that each flight controller monitors is extensive. In addition, as the ground team works to further assess impacts, trouble shoot, identify workarounds, and oversee procedure execution, it accesses and synthesizes engineering and procedure information, as well as system build, test, and configuration documentation. It is not feasible nor useful to put all these data onboard as crews become more Earth independent. Each member of a small Mars mission small crew will have multiple roles beyond monitoring telemetry and data gathering, and multiple roles within anomaly resolution processes, thereby limiting their capacity for copious amounts of information. Moreover, while access is necessary, it alone is insufficient. Information will need to be compiled, refined, and represented appropriately to support the crew’s reduced attention and expertise. This work seeks to understand the content and representation of information needed to support time-constrained problem solving and decision making by the crew without real-time ground support. To build this understanding, we first surveyed the literature, focusing on how expert problem solvers construct and manipulate their mental models. Next, we interviewed expert problem solvers in spaceflight and analogous domains and surveyed industry solutions for data presentation. Finally, we analyzed current spaceflight operations by investigating flight controller anomaly resolution processes during ISS training simulations and real operational events. These methods led to creating a problem-solving framework that details common themes and features of attending to, assessing, analyzing, and acting on problems in complex, time-constrained domains. Using this framework and the results of our analysis, we identified conceptual data representations needed for crew-led problem-solving. Preliminary onboard user interface concepts to meet identified needs will be presented.

anomaly response↗
DOE OSTI2025

Adaptive Interface-PINNs (AdaI-PINNs) for transient diffusion: Applications to forward and inverse problems in heterogeneous media

We model transient diffusion in heterogeneous materials using a novel physics-informed neural networks framework (PINNs) termed Adaptive interface physics-informed neural networks or AdaI-PINNs (Roy et al. arXiv preprint arXiv:2406.04626, 2024). AdaI-PINNs utilize different activation functions with trainable slopes tailored to each material region within the computational domain, allowing for a fully automated and adaptive PINNs approach to model interface problems with strongly and weakly discontinuous solutions. To enhance its performance in highly heterogeneous transient diffusion systems, we prescribe a suite of robust practices, including appropriate non-dimensionalization of equations, a biased sampling method, Glorot initialization, and the hard enforcement of boundary and initial conditions. Here we evaluate the efficacy of the proposed method on several benchmark forward and inverse problems. Comparative studies on one-dimensional and two-dimensional benchmark problems reveal that the modified AdaI-PINNs outperform its unmodified counterpart, achieving root-mean-square errors that are at least two orders of magnitude better in forward problems. For inverse problems, the maximum errors in the approximated diffusion coefficients by modified AdaI-PINNs are four orders of magnitude better than those of the unmodified version. Additionally, modified AdaI-PINNs demonstrate improved stability in problems with large material mismatches.

42 ENGINEERING↗