Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm development”

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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A generalized reusable guidance algorithm for optimal aerobraking

A practical real-time guidance algorithm was developed for guiding aerobraking vehicles in such a way that the maximum heating rate, the maximum structural loads, and the post-aeropass delta-V requirements (for post-aeropass orbit insertion) are all minimized. The algorithm is general and reusable in the sense that a minimum of assumptions are made, thus minimizing the number of gains and mission-dependent parameters that must be laboriously determined prior to a particular mission. A particularly interesting feature is that inplane guidance performance is tuned by simply adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is turned by simply adjusting a plane controller time constant. Other objectives in the algorithm development are simplicity, efficiency, and ease of use. The algorithm is developed for, but not necessarily restricted to, a single pass mission and a trimmed vehicle with a bank angle modulation as the method of trajectory control. Guidance performance is demonstrated via results obtained using this algorithm integrated into an aerobraking test-bed program. Comparisons are made with numerical results from a version of the aerobraking guidance algorithm that was to be flown onboard NASA's aeroassist flight experiment (AFE) vehicle. Promising results are obtained with a minimum of development effort.

Dukeman, G. A.↗
NASA NTRS1994

A Coulomb collision algorithm for weighted particle simulations

A binary Coulomb collision algorithm is developed for weighted particle simulations employing Monte Carlo techniques. Charged particles within a given spatial grid cell are pair-wise scattered, explicitly conserving momentum and implicitly conserving energy. A similar algorithm developed by Takizuka and Abe (1977) conserves momentum and energy provided the particles are unweighted (each particle representing equal fractions of the total particle density). If applied as is to simulations incorporating weighted particles, the plasma temperatures equilibrate to an incorrect temperature, as compared to theory. Using the appropriate pairing statistics, a Coulomb collision algorithm is developed for weighted particles. The algorithm conserves energy and momentum and produces the appropriate relaxation time scales as compared to theoretical predictions. Such an algorithm is necessary for future work studying self-consistent multi-species kinetic transport.

Miller, Ronald H.↗
NASA NTRS1993

Improvement and further development of SSM/I overland parameter algorithms using the WetNet workstation

Since the launch of the DMSP Special Sensor Microwave/Imager (SSM/I), several algorithms have been developed to retrieve overland parameters. These include the present operational algorithms resulting from the Navy calibration/validation effort such as land surface type (Neale et al. 1990), land surface temperature (McFarland et al. 1990), surface moisture (McFarland and Neale, 1991) and snow parameters (McFarland and Neale, 1991). In addition, other work has been done including the classification of snow cover and precipitation using the SSM/I (Grody, 1991). Due to the empirical nature of most of the above mentioned algorithms, further research is warranted and improvements can probably be obtained through a combination of radiative transfer modelling to study the physical processes governing the microwave emissions at the SSM/I frequencies, and the incorporation of additional ground truth data and special cases into the regression data sets. We have proposed specifically to improve the retrieval of surface moisture and snow parameters using the WetNet SSM/I data sets along with ground truth information namely climatic variables from the NOAA cooperative network of weather stations as well as imagery from other satellite sensors such as the AVHRR and Thematic Mapper. In the case of surface moisture retrievals the characterization of vegetation density is of primary concern. The higher spatial resolution satellite imagery collected at concurrent periods will be used to characterize vegetation types and amounts which, along with radiative transfer modelling should lead to more physically based retrievals. Snow parameter retrieval algorithm improvement will initially concentrate on the classification of snowpacks (dry snow, wet snow, refrozen snow) and later on specific products such as snow water equivalent. Significant accomplishments in the past year are presented.

Neale, Christopher M. U.↗
NASA NTRS1986

Further development of an improved altimeter wind speed algorithm

A previous altimeter wind speed retrieval algorithm was developed on the basis of wind speeds in the limited range from about 4 to 14 m/s. In this paper, a new approach which gives a wind speed model function applicable over the range 0 to 21 m/s is used. The method is based on comparing 50 km along-track averages of the altimeter normalized radar cross section measurements with neighboring off-nadir scatterometer wind speed measurements. The scatterometer winds are constructed from 100 km binned measurements of radar cross section and are located approximately 200 km from the satellite subtrack. The new model function agrees very well with earlier versions up to wind speeds of 14 m/s, but differs significantly at higher wind speeds. The relevance of these results to the Geosat altimeter launched in March 1985 is discussed.

Chelton, Dudley B.↗
NASA NTRS1993

The development of a scalable parallel 3-D CFD algorithm for turbomachinery

Two algorithms capable of computing a transonic 3-D inviscid flow field about rotating machines are considered for parallel implementation. During the study of these algorithms, a significant new method of measuring the performance of parallel algorithms is developed. The theory that supports this new method creates an empirical definition of scalable parallel algorithms that is used to produce quantifiable evidence that a scalable parallel application was developed. The implementation of the parallel application and an automated domain decomposition tool are also discussed.

Luke, Edward Allen↗
NASA NTRS2006

Habitat Design Optimization and Analysis

Long-duration surface missions to the Moon and Mars will require habitats for the astronauts. The materials chosen for the habitat walls play a direct role in the protection against the harsh environments found on the surface. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. Advanced optimization techniques are necessary for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces; therefore, a habitat design optimization tool utilizing genetic algorithms has been developed. Genetic algorithms use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce. This habitat design optimization tool is a multi-objective formulation of structural analysis, heat loss, radiation protection, and meteoroid protection. This paper presents the research and development of this tool.

SanSoucie, Michael P.↗
DOE OSTI2026

Development of a pattern recognition algorithm for reconstructing multi-particle events in the Mu2e detector

Mu2e is an upcoming experiment at Fermilab and its main goal is to search for the Charged Lepton Flavor Violation (CLFV) in the coherent transition of a muon into an electron on an Al target. In Mu2e, multi-particle events can occur simultaneously within the same time region and it is crucial to accurately identify each particle track, including signals, to improve the robustness of track finding methods and enhance reconstruction efficiency. ¯p annihilation is one of the background events and produces multiple particles that can mimic signal events. Additionally, photons from radiative pion captures can produce a γ → $e+e−$ pair, which can be used to calibrate the Mu2e momentum scale and the resolution. The Mu2e track reconstruction sequence begins by grouping hits produced in the tracker based on time and z coordinate information, called TimeCluster, and selected hits are processed to reconstruct helices and determine their momentum. The current pattern recognition algorithms identify a single helix per TimeCluster for single track events. A new pattern recognition algorithm is being developed to reconstruct multi-particle events and its features for finding multiple tracks and the current evaluation results are reported.

Kitagawa, H. [Pisa U.]↗
NASA NTRS1984

Effects of aircraft and flight parameters on energy-efficient profile descents in time-based metered traffic

Concepts to save fuel while preserving airport capacity by combining time based metering with profile descent procedures were developed. A computer algorithm is developed to provide the flight crew with the information needed to fly from an entry fix to a metering fix and arrive there at a predetermined time, altitude, and airspeed. The flight from the metering fix to an aim point near the airport was calculated. The flight path is divided into several descent and deceleration segments. Descents are performed at constant Mach numbers or calibrated airspeed, whereas decelerations occur at constant altitude. The time and distance associated with each segment are calculated from point mass equations of motion for a clean configuration with idle thrust. Wind and nonstandard atmospheric properties have a large effect on the flight path. It is found that uncertainty in the descent Mach number has a large effect on the predicted flight time. Of the possible combinations of Mach number and calibrated airspeed for a descent, only small changes were observed in the fuel consumed.

Dejarnette, F. R.↗
NASA NTRS1985

Algorithms for Software Development

Management aid makes changes obvious. One key element in scheme for software development control is check summing. If check sum for given line in source file is different from previous version, it is evident change has been made. Subsequent editing of file creates new lines, deletes old ones, modifies characters, moves lines, or copies (reuse) existing lines. Combination of three elements of line code permits all transactions to be detected.

Tausworthe, R. C.↗
NASA NTRS1986

High resolution imaging

Diffraction-limited telescopic observations were obtained of solar system objects and a program of research into Uranus, Neptune, Pluto and the asteroids based upon the data obtained was persued. Two camera systems appropriate for this work were developed. Most importantly, the PAPA photon address camera was developed and proven. Algorithms were developed for both phase and amplitude recovery and were validated on theoretical and laboratory data and to a limited extent on telescopic data. A laboratory simulator was constructed that was used for development but is also available for controlled investigation of image reconstruction. During 1985 two successful expeditions were made to Hawaii and Cerro Tololo and a large body of data on Pluto, Uranus, Neptune and two asteroids are on tape.

Goody, R.↗
NASA NTRS1989

Development of parallel algorithms for electrical power management in space applications

The application of parallel techniques for electrical power system analysis is discussed. The Newton-Raphson method of load flow analysis was used along with the decomposition-coordination technique to perform load flow analysis. The decomposition-coordination technique enables tasks to be performed in parallel by partitioning the electrical power system into independent local problems. Each independent local problem represents a portion of the total electrical power system on which a loan flow analysis can be performed. The load flow analysis is performed on these partitioned elements by using the Newton-Raphson load flow method. These independent local problems will produce results for voltage and power which can then be passed to the coordinator portion of the solution procedure. The coordinator problem uses the results of the local problems to determine if any correction is needed on the local problems. The coordinator problem is also solved by an iterative method much like the local problem. The iterative method for the coordination problem will also be the Newton-Raphson method. Therefore, each iteration at the coordination level will result in new values for the local problems. The local problems will have to be solved again along with the coordinator problem until some convergence conditions are met.

Berry, Frederick C.↗
NASA NTRS1988

On the development of efficient algorithms for three dimensional fluid flow

The difficulties of constructing efficient algorithms for three-dimensional flow are discussed. Reasonable candidates are analyzed and tested, and most are found to have obvious shortcomings. Yet, there is promise that an efficient class of algorithms exist between the severely time-step sized-limited explicit or approximately factored algorithms and the computationally intensive direct inversion of large sparse matrices by Gaussian elimination.

Maccormack, R. W.↗
NASA NTRS1991

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗
NASA NTRS1990

Improving stability and strength characteristics of framed structures with nonlinear behavior

In this paper an optimal design procedure is introduced to improve the overall performance of nonlinear framed structures. The design methodology presented here is a multiple-objective optimization procedure whose objective functions involve the buckling eigenvalues and eigenvectors of the structure. A constant volume with bounds on the design variables is used in conjunction with an optimality criterion approach. The method provides a general tool for solving complex design problems and generally leads to structures with better limit strength and stability. Many algorithms have been developed to improve the limit strength of structures. In most applications geometrically linear analysis is employed with the consequence that overall strength of the design is overestimated. Directly optimizing the limit load of the structure would require a full nonlinear analysis at each iteration which would be prohibitively expensive. The objective of this paper is to develop an algorithm that can improve the limit-load of geometrically nonlinear framed structures while avoiding the nonlinear analysis. One of the novelties of the new design methodology is its ability to efficiently model and design structures under multiple loading conditions. These loading conditions can be different factored loads or any kind of loads that can be applied to the structure simultaneously or independently. Attention is focused on optimal design of space framed structures. Three-dimensional design problems are more complicated to carry out, but they yield insight into real behavior of the structure and can help avoiding some of the problems that might appear in planar design procedure such as the need for out-of-plane buckling constraint. Although researchers in the field of structural engineering generally agree that optimum design of three-dimension building frames especially in the seismic regions would be beneficial, methods have been slow to emerge. Most of the research in this area has dealt with the optimization of truss and plane frame structures.

Pezeshk, Shahram↗