Results for “Problem Solving” — Page 63

NASA NTRS1990

Modifications to the rapid melt/rapid quench and transparent polymer video furnaces for the KC-135

Given here is a summary of tasks performed on two furnace systems, the Transparent Polymer (TPF) and the Rapid Melt/Rapid Quench (RMRQ) furnaces, to be used aboard NASA's KC-135. It was determined that major changes were needed for both furnaces to operate according to the scientific investigators' experiment parameters. Discussed here are what the problems were, what was required to solve the problems, and possible future enhancements. It was determined that the enhancements would be required for the furnaces to perform at their optimal levels. Services provided include hardware and software modifications, Safety DataPackage documentation, ground based testing, transportation to and from Ellington Air Field, operation of hardware during KC-135 flights, and post-flight data processing.

Smith, Guy A.↗

NASA NTRS1924

Recent researches in airship construction II : bending stresses on an airship in flight

The first part of this report shows the differences between commercial and war airships and then goes on to show how some of the problems were solved. Their thorough investigations of these problems finally enabled the Schutte-Lanz Company to construct bulkhead diagrams for determining the buoyancy of airships, by means of which the size of each cell was established. These diagrams were derived from bulkhead diagrams employed in ship designing and are used in a similar manner.

AIRSHIPS - STRESSES, BENDING↗

NASA NTRS1990

Genetic-evolution-based optimization methods for engineering design

This paper presents the applicability of a biological model, based on genetic evolution, for engineering design optimization. Algorithms embodying the ideas of reproduction, crossover, and mutation are developed and applied to solve different types of structural optimization problems. Both continuous and discrete variable optimization problems are solved. A two-bay truss for maximum fundamental frequency is considered to demonstrate the continuous variable case. The selection of locations of actuators in an actively controlled structure, for minimum energy dissipation, is considered to illustrate the discrete variable case.

Rao, S. S.↗

NASA NTRS1990

An efficient design sensitivity analysis of eigenvectors

Subspace iteration has been a major advance in solving large eigen problems when only a subset of eigen-pairs is required. The essence of this method is a transformation from displacement coordinates of an n-th order eigensystem to generalized coordinates of a smaller q-th order. The eigenvalue problem is then solved in the reduced space. The method was first developed by Clint and Jennings for real symmetric systems and was then called 'simultaneous iteration'. The success of the method prompted further research along this line and there have been many improved algorithms developed. This approach has been widely used by structural engineers for extracting the most useful natural frequencies and mode shapes of large-scale dynamic systems. This paper exploits into a new direction which is in the form of iterative process for simultaneously calculating eigenvector derivatives of many eigenvectors with respect to multi-variables. The method fully uses all the available information from preceding eigenvalue solution and, thus, effectively economizes computational efforts. It iterates through two equations derived from the first variation of the two fundamental equations used in subspace iteration method. There is no expensive large matrix decomposition required and the process converges to acceptable solution in a finite number of iterations. Therefore, the procedure increases its efficiency superiority over the others as the system size or the number of interested eigenvectors become larger and larger.

Ting, T.↗

NASA NTRS1995

On the deficit problem of mass and energy of solar coronal mass ejections connected with interplanetary shocks

Mean values of a number of parameters of the most powerful coronal mass ejections (CMEs) and interplanetary shocks generated by these ejections are estimated using an analysis of data obtained by the cosmic coronagraphs and spacecrafts, and geomagnetic storm measurements. It was payed attention that the shock mass and mechanical energy, averaging 5 x 10(exp 16) grm and 2 x 10(exp 32) erg respectively, are nearly 10 times larger than corresponding parameters of the ejections. So, the CME energy deficit problem seems to exist really. To solve this problem one can make an assumption that the process of the mass and energy growth of CMEs during their propagation out of the Sun observed in the solar corona is continued in supercorona too up to distances of 10-30 solar radii. This assumption is confirmed by the data analysis of five events observed using zodiacal light photometers of the HELIOS- I and HELIOS-2 spacecrafts. The mass growth rate is estimated to be equal to (1-7) x 10(exp 11) grm/sec. It is concluded that the CME contribution to mass and energy flows in the solar winds probably, is larger enough than the value of 3-5% adopted usually.

Ivanchuk, V. I.↗

NASA NTRS1996

An N-body Tree Algorithm for the Cray T3D

We describe in this paper an algorithm for solving the gravitational N-body problem using tree data structures on the Cray T3D parallel supercomputer. This implementation is an adaptation of previous work where this problem was solved using an SIMD, fine-grained parallel computer. We show here that this approach lends itself, with small modifications, to more coarse-grained parallelism as well. We also show that the performance of the algorithm on the Cray T3D parallel architecture scales adequately with the number of processors (up to 256). Specific levels to be reached using the Cray T3D parallel architecture. A peak performance level of 9.6 Gflop/s is reached on 256 processors for the time critical gravity computation.

Olson, Kevin M.↗

NASA NTRS1999

Design Study for a Global Magnetospheric Dynamics Mission

A successful design was developed, one with many advantages over the original mission. The time spent in orbit was more evenly spread over the region being investigated. The radiation close was significantly lower and the mission did not rely on gravity assist at the moon and thus did not have to make measurements that far out in the tail. A spacecraft design was developed that keeps interference from the engines to a minimum. The design however was quite specific for four spacecraft. It could not be easily scaled to five spacecraft for example. One problem was discovered that is a concern for all similar missions. Inter- spacecraft communication can determine the spacing of the vehicles easily and to the accuracy required. However, the orientation of the polyhedron with the spacecraft at its vertices is not well known for small separations. Ground station range measurements give the line of sight location well but not the angle around that vector. This is a problem any such mission needs to solve. Neither the navigation teams at Goddard nor at Lewis were willing to attempt to solve this problem. At the completion of the study a report was made to the AGU meeting in San Francisco and a paper published in the volume "Science Closure and Enabling Technologies for Constellation Class Missions". This paper is attached.

Russell, C. T.↗

NASA NTRS2017

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

NASA NTRSDate not supplied

MULTI-OBJECTIVE REINFORCEMENT LEARNING FOR LOW-THRUST TRANSFER DESIGN BETWEEN LIBRATION POINT ORBITS

Multi-Reward Proximal Policy Optimization (MRPPO) is a multi-objective reinforcement learning algorithm used to construct low-thrust transfers between periodic orbits in multi-body systems. Previous implementations of MRPPO have relied on a predefined reference transfer to successfully train each policy. In this paper, an algorithmic modification labeled the ‘moving reference’, is introduced to autonomously construct these reference trajectories during training. With this modification, MRPPO is used to recover various low-thrust transfers between two periodic orbits in the Earth-Moon circular restricted three-body problem to solve a multi-objective optimization problem. These results are then compared with the solutions recovered via a traditional optimization formulation.

algorithm↗

NASA NTRSDate not supplied

MULTI-OBJECTIVE REINFORCEMENT LEARNING FOR LOW-THRUST TRANSFER DESIGN BETWEEN LIBRATION POINT ORBITS

Multi-Reward Proximal Policy Optimization (MRPPO) is a multi-objective reinforcement learning algorithm used to construct low-thrust transfers between periodic orbits in multi-body systems. Previous implementations of MRPPO have relied on a predefined reference transfer to successfully train each policy. In this paper, an algorithmic modification labeled the ‘moving reference’, is introduced to autonomously construct these reference trajectories during training. With this modification, MRPPO is used to recover various low-thrust transfers between two periodic orbits in the Earth-Moon circular restricted three-body problem to solve a multi-objective optimization problem. These results are then compared with the solutions recovered via a gradient descent optimization scheme to validate the performance of MRPPO with the moving reference modification.

Christopher J. Sullivan↗

NASA NTRSDate not supplied

MULTI-OBJECTIVE REINFORCEMENT LEARNING FOR LOW-THRUST TRANSFER DESIGN BETWEEN LIBRATION POINT ORBITS

Multi-Reward Proximal Policy Optimization (MRPPO) is a multi-objective reinforcement learning algorithm used to construct low-thrust transfers between periodic orbits in multi-body systems. Previous implementations of MRPPO have relied on a predefined reference transfer to successfully train each policy. In this paper, an algorithmic modification labeled the ‘moving reference’, is introduced to autonomously construct these reference trajectories during training. With this modification, MRPPO is used to recover various low-thrust transfers between two periodic orbits in the Earth-Moon circular restricted three-body problem to solve a multi-objective optimization problem. These results are then compared with the solutions recovered via a gradient descent optimization scheme to validate the performance of MRPPO with the moving reference modification

Christopher John Sullivan↗

NASA NTRS2021

Multi-objective Reinforcement Learning for Low-thrust Transfer Design Between Libration Point Orbits

Multi-Reward Proximal Policy Optimization (MRPPO) is a multi-objective rein- forcement learning algorithm used to construct low-thrust transfers between pe- riodic orbits in multi-body systems. Previous implementations of MRPPO have relied on a predefined reference transfer to successfully train each policy. In this paper, an algorithmic modification labeled the ‘moving reference’, is introduced to autonomously construct these reference trajectories during training. With this modification, MRPPO is used to recover various low-thrust transfers between two periodic orbits in the Earth-Moon circular restricted three-body problem to solve a multi-objective optimization problem. These results are then compared with the solutions recovered via a gradient descent optimization scheme to validate the performance of MRPPO with the moving reference modification.

Anderson, Rodney L.↗

NASA NTRS2021

Multi-objective Reinforcement Learning for Low-thrust Transfer Design Between Libration Point Orbits

Multi-Reward Proximal Policy Optimization (MRPPO) is a multi-objective rein- forcement learning algorithm used to construct low-thrust transfers between pe- riodic orbits in multi-body systems. Previous implementations of MRPPO have relied on a predefined reference transfer to successfully train each policy. In this paper, an algorithmic modification labeled the ‘moving reference’, is introduced to autonomously construct these reference trajectories during training. With this modification, MRPPO is used to recover various low-thrust transfers between two periodic orbits in the Earth-Moon circular restricted three-body problem to solve a multi-objective optimization problem. These results are then compared with the solutions recovered via a gradient descent optimization scheme to validate the performance of MRPPO with the moving reference modification.

Anderson, Rodney L↗

NASA NTRS1977

Variational Algorithms for Nonlinear Smoothing Applications

A variational approach is presented for solving a nonlinear, fixed-interval smoothing problem with application to offline processing of noisy data for trajectory reconstruction and parameter estimation. The nonlinear problem is solved as a sequence of linear two-point boundary value problems. Second-order convergence properties are demonstrated. Algorithms for both continuous and discrete versions of the problem are given, and example solutions are provided.

Bach, Ralph E. Jr.↗

DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

NASA NTRS1990

Finite element two-dimensional panel flutter at high supersonic speeds and elevated temperature

A consistent finite element formulation for flutter of two-dimensional panels including effects of temperature variation along panel length is presented. The von Karman nonlinear strain-displacement relation is used to account for the large-deflections, and the quasi-steady first-order piston theory is employed for aerodynamic loading in the finite-element formulation. The panel flutter under combined thermal/aerodynamic loading can be separated into solving two problems in sequence. They are: (1) postbuckling deflection, stresses and buckling stability boundary, and (2) critical dynamic pressure and linear flutter boundary. The solution procedures in solving these problems are presented in detail. Finite element results of two-dimensional panels with uniform temperature change are compared with classic analytical solutions. Influence of nonuniform temperature distributions on critical buckling temperature, flutter deflection and stresses, and flutter boundary is also given.

Xue, David Y.↗

NASA NTRS1997

Dynamic Flow Management Problems in Air Transportation

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Patterson, Sarah Stock↗

NASA NTRS2000

Applications of the Space-Time Conservation Element and Solution Element (CE/SE) Method to Computational Aeroacoustic Benchmark Problems

The Internal Propagation problems, Fan Noise problem, and Turbomachinery Noise problems are solved using the space-time conservation element and solution element (CE/SE) method. The problems in internal propagation problems address the propagation of sound waves through a nozzle. Both the nonlinear and linear quasi 1D Euler equations are solved. Numerical solutions are presented and compared with the analytical solution. The fan noise problem concerns the effect of the sweep angle on the acoustic field generated by the interaction of a convected gust with a cascade of 3D flat plates. A parallel version of the 3D CE/SE Euler solver is developed and employed to obtain numerical solutions for a family of swept flat plates. Numerical solutions for sweep angles of 0, 5, 10, and 15 deg are presented. The turbomachinery problems describe the interaction of a 2D vortical gust with a cascade of flat-plate airfoils with/without a downstream moving grid. The 2D nonlinear Euler Equations are solved and the converged numerical solutions are presented and compared with the corresponding analytical solution. All the comparisons demonstrate that the CE/SE method is capable of solving aeroacoustic problems with/without shock waves in a simple and efficient manner. Furthermore, the simple non-reflecting boundary condition used in the CE/SE method which is not based on the characteristic theory works very well in 1D, 2D and 3D problems.

Wang, Xiao-Yen↗