Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithms”

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 937 records · Page 52

An investigation of using an RQP based method to calculate parameter sensitivity derivatives

Estimation of the sensitivity of problem functions with respect to problem variables forms the basis for many of our modern day algorithms for engineering optimization. The most common application of problem sensitivities has been in the calculation of objective function and constraint partial derivatives for determining search directions and optimality conditions. A second form of sensitivity analysis, parameter sensitivity, has also become an important topic in recent years. By parameter sensitivity, researchers refer to the estimation of changes in the modeling functions and current design point due to small changes in the fixed parameters of the formulation. Methods for calculating these derivatives have been proposed by several authors (Armacost and Fiacco 1974, Sobieski et al 1981, Schmit and Chang 1984, and Vanderplaats and Yoshida 1985). Two drawbacks to estimating parameter sensitivities by current methods have been: (1) the need for second order information about the Lagrangian at the current point, and (2) the estimates assume no change in the active set of constraints. The first of these two problems is addressed here and a new algorithm is proposed that does not require explicit calculation of second order information.

Beltracchi, Todd J.↗

MME-based attitude dynamics identification and estimation for SAMPEX

A method is described for obtaining optimal attitude estimation algorithms for spacecraft lacking attitude rate measurement devices (rate gyros), and then demonstrated using actual flight data from the Solar, Anomalous, and Magnetospheric Particle Explorer (SAMPEX) spacecraft. SAMPEX does not have on-board rate sensing, and relies on sun sensors and a three-axis magnetometer for attitude determination. Problems arise since typical attitude estimation is accomplished by filtering measurements of both attitude and attitude rates. Rates are nearly always sampled much more densely than are attitudes. Thus, the absence/loss of rate data normally reduces both the total amount of data available and the sampling density (in time) by a substantial fraction. As a result, the sensitivity of the estimates to model uncertainty and to measurement noise increases. In order to maintain accuracy in the attitude estimates, there is increased need for accurate models of the rotational dynamics. The proposed approach is based on the minimum model error (MME) optimal estimation strategy, which has been successfully applied to estimation of poorly modeled dynamic systems which are relatively sparsely and/or noisily measured. The MME estimates may be used to construct accurate models of the system dynamics (i.e. perform system model identification). Thus, an MME-based approach directly addresses the problems created by absence of attitude rate measurements.

Depena, Juan↗

A Survey of Mathematical Structures for Lunar Networks

To sustain the current and increasing accessibility of space, a scalable communications infrastructure (i.e. the Solar System Internet, SSI) is necessary. The goal of this paper is to begin the discovery of the fundamental underlying mathematical structure of space networks to help the research community harness these structures for algorithm development and optimization. To ensure the applicability of the research, the approaches are considered through the lens of simulated scenarios inspired by the Artemis Back-to-the-Moon mission set for 2024. We note that any approach to an SSI must fit under the umbrella of Delay Tolerant Networking (DTN), due to celestial mobility, high link latencies, high variance in link latencies, disconnections, lack of end-to-end paths, and so on. These difficulties are exacerbated by the fact that the underlying structure of a space network is a time-evolving network and may experience multiple discontinuities in its topology. In this paper we propose several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory. These techniques include methods from Topological Data Analysis, Dynamic Graph Analysis, Applied Algebraic Geometry, Probability Theory, and Game Theory. Some of these methods include tools adapted to the study of dynamic metric spaces, such as zigzag persistent homology and their higher parameter analogs. We find that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting. While each approach is theoretical, they are also algorithmic in nature and offer immediate practical applications. The paper concludes with comparisons of the various methods along with suggestions for future work.

Delay tolerant networking↗

Performance seeking control program overview

The Performance Seeking Control (PSC) program evolved from a series of integrated propulsion-flight control research programs flown at NASA Dryden Flight Research Center (DFRC) on an F-15. The first of these was the Digital Electronic Engine Control (DEEC) program and provided digital engine controls suitable for integration. The DEEC and digital electronic flight control system of the NASA F-15 were ideally suited for integrated controls research. The Advanced Engine Control System (ADECS) program proved that integrated engine and aircraft control could improve overall system performance. The objective of the PSC program was to advance the technology for a fully integrated propulsion flight control system. Whereas ADECS provided single variable control for an average engine, PSC controlled multiple propulsion system variables while adapting to the measured engine performance. PSC was developed as a model-based, adaptive control algorithm and included four optimization modes: minimum fuel flow at constant thrust, minimum turbine temperature at constant thrust, maximum thrust, and minimum thrust. Subsonic and supersonic flight testing were conducted at NASA Dryden covering the four PSC optimization modes and over the full throttle range. Flight testing of the PSC algorithm, conducted in a series of five flight test phases, has been concluded at NASA Dryden covering all four of the PSC optimization modes. Over a three year period and five flight test phases 72 research flights were conducted. The primary objective of flight testing was to exercise each PSC optimization mode and quantify the resulting performance improvements.

Orme, John S.↗

Maximum life spur gear design

Optimization procedures allow one to design a spur gear reduction for maximum life and other end use criteria. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial guess values. The optimization algorithm is described, and the models for gear life and performance are presented. The algorithm is compact and has been programmed for execution on a desk top computer. Two examples are presented to illustrate the method and its application.

Savage, M.↗

Maximum life spur gear design

Optimization procedures allow one to design a spur gear reduction for maximum life and other end use criteria. A modified feasible directions search algorithm permits a wide variety of inequality constraints and exact design requirements to be met with low sensitivity to initial guess values. The optimization algorithm is described, and the models for gear life and performance are presented. The algorithm is compact and has been programmed for execution on a desk top computer. Two examples are presented to illustrate the method and its application.

Savage, M.↗

Assessment of Cognitive Communications Interest Areas for NASA Needs and Benefits

This effort provides a survey and assessment of various cognitive communications interest areas, including node-to-node link optimization, intelligent routing/networking, and learning algorithms, and is conducted primarily from the perspective of NASA space communications needs and benefits. Areas of consideration include optimization methods, learning algorithms, and candidate implementations/technologies. Assessments of current research efforts are provided with mention of areas for further investment. Other considerations, such as antenna technologies and cognitive radio platforms, are briefly provided as well.

Knoblock, Eric J.↗

Algebraic, geometric, and stochastic aspects of genetic operators

Genetic algorithms for function optimization employ genetic operators patterned after those observed in search strategies employed in natural adaptation. Two of these operators, crossover and inversion, are interpreted in terms of their algebraic and geometric properties. Stochastic models of the operators are developed which are employed in Monte Carlo simulations of their behavior.

Foo, N. Y.↗

Analytical methods for performance evaluation of nonlinear filters.

In the investigation, the filtering problem is considered in the continuous time domain. The postulated simple suboptimal nonlinear filter structure closely parallels the structure of the Kalman-Bucy optimal linear filter algorithm. Two filter performance evaluation methods are developed based on the Kolmogorov equations for the transition density of Markov processes. The expansions in the approximations for the nonlinear system and observation functions are in effect carried out up to second-order terms in both methods. The description of the filter's performance is sought in terms of second-order statistics in both methods.

Bejczy, A. K.↗

Fuel-conservative guidance system for powered-lift aircraft

A concept for automatic terminal area guidance, comprising two modes of operation, was developed and evaluated in flight tests. In the predictive mode, fuel efficient approach trajectories are synthesized in fast time. In the tracking mode, the synthesized trajectories are reconstructed and tracked automatically. An energy rate performance model derived from the lift, drag, and propulsion system characteristics of the aircraft is used in the synthesis algorithm. The method optimizes the trajectory for the initial aircraft position and wind and temperature profiles encountered during each landing approach. The design theory and the results of simulations and flight tests using the Augmentor Wing Jet STOL Research Aircraft are described.

Erzberger, H.↗

Fuel-conservative guidance system for powered-lift aircraft

A concept for automatic terminal-area guidance, comprising two modes of operation, has been developed and evaluated in flight tests. In the first or predictive mode, fuel-efficient approach trajectories are synthesized in fast time. In the second or tracking mode, the synthesized trajectories are reconstructed and tracked automatically. An energy rate performance model derived from the lift, drag, and propulsion-system characteristics of the aircraft is used in the synthesis algorithm. The method optimizes the trajectory for the initial aircraft position and wind and temperature profiles encountered during each landing approach. The paper describes the design theory and discusses the results of simulations and flight tests using the Augmentor Wing Jet STOL Research Aircraft.

Erzberger, H.↗

NASA/RAE collaboration on nonlinear control using the F-8C digital fly-by-wire aircraft

Design procedures are reviewed for variable integral control to optimize response (VICTOR) algorithms and results of preliminary flight tests are presented. The F-8C aircraft is operated in the remotely augmented vehicle (RAV) mode, with the control laws implemented as FORTRAN programs on a ground-based computer. Pilot commands and sensor information are telemetered to the ground, where the data are processed to form surface commands which are then telemetered back to the aircraft. The RAV mode represents a singlestring (simplex) system and is therefore vulnerable to a hardover since comparison monitoring is not possible. Hence, extensive error checking is conducted on both the ground and airborne computers to prevent the development of potentially hazardous situations. Experience with the RAV monitoring and validation procedures is described.

Butler, G. F.↗

Automated preprocessing of spaceborne SAR data

An efficient algorithm has been developed for estimation of the echo phase delay in spaceborne synthetic aperture radar (SAR) data. This algorithm utilizes the spacecraft ephemeris data and the radar echo data to produce estimates of two parameters: (1) the centroid of the Doppler frequency spectrum f(d) and (2) the Doppler frequency rate. Results are presented from tests conducted with Seasat SAR data. The test data indicates that estimation accuracies of 3 Hz for f(d) and 0.3 Hz/sec for the Doppler frequency rate are attainable. The clutterlock and autofocus techniques used for estimation of f(d) and the Doppler frequency rate, respectively are discussed and the algorithm developed for optimal implementation of these techniques is presented.

Curlander, J. C.↗

Geometric registration and rectification of spaceborne SAR imagery

This paper describes the development of automated location and geometric rectification techniques for digitally processed synthetic aperture radar (SAR) imagery. A software package has been developed that is capable of determining the absolute location of an image pixel to within 60 m using only the spacecraft ephemeris data and the characteristics of the SAR data collection and processing system. Based on this location capability algorithms have been developed that geometrically rectify the imagery, register it to a common coordinate system and mosaic multiple frames to form extended digital SAR maps. These algorithms have been optimized using parallel processing techniques to minimize the operating time. Test results are given using Seasat SAR data.

Curlander, J. C.↗