SEARCH · Engineering Papers
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.
OPTIM generates profile of altitude, airspeed, and flightpath angle as function of range between given set or origin and destination points for particular models of transport aircraft. Profile is optimized in sense of minimizing fuel or time or in minimizing direct operating cost expressed as combination of fuel and time.
The landing footprint of a conceptual high-lift transatmospheric vehicle is defined for aeromaneuvering entry from a typical low-earth orbit. The flight strategy for trajectory construction to maximize the landing area by extending downrange and crossrange as far as possible is developed in four phases by optimal programming of the vehicle's roll angle. Trajectories that reach any given landing site were calculated with the corresponding heating rates at three critical vehicle locations (stagnation point, wing leading edge, and body centerline). An optimization methodology was developed that demonstrates the trades between crossrange, peak heating and total heat loads as a function of three key flight parameters (altitude, flight-path angle, and vehicle roll angle). The maximum extent of the landing footprint was found to be 29,690 km downrange and 6560 km crossrange. Large variations in the ballistic coefficient had negligible effect on the extent of the footprint but could significantly affect heating. However, the footprint's longitude was displaced downstream or upstream with increasing or decreasing ballistic coefficient, respectively.
A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends upon knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined which accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.
A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine s performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least-squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.
A new linear point design technique is presented for the determination of tuning parameters that enable the optimal estimation of unmeasured engine outputs, such as thrust. The engine's performance is affected by its level of degradation, generally described in terms of unmeasurable health parameters related to each major engine component. Accurate thrust reconstruction depends on knowledge of these health parameters, but there are usually too few sensors to be able to estimate their values. In this new technique, a set of tuning parameters is determined that accounts for degradation by representing the overall effect of the larger set of health parameters as closely as possible in a least squares sense. The technique takes advantage of the properties of the singular value decomposition of a matrix to generate a tuning parameter vector of low enough dimension that it can be estimated by a Kalman filter. A concise design procedure to generate a tuning vector that specifically takes into account the variables of interest is presented. An example demonstrates the tuning parameters ability to facilitate matching of both measured and unmeasured engine outputs, as well as state variables. Additional properties of the formulation are shown to lend themselves well to diagnostics.
Recent experiences in utilizing the global optimization methodology, based on polynomial and neural network techniques for fluid machinery design are summarized. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. Another advantage is that these methods do not need to calculate the sensitivity of each design variable locally. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables and methods for predicting the model performance. Examples of applications selected from rocket propulsion components including a supersonic turbine and an injector element and a turbulent flow diffuser are used to illustrate the usefulness of the global optimization method.
As electric vehicles (EVs) are evolving, innovative technologies like “energized composite” that can store energy in the car's body helps extend its range per charge. The composite's unique ability to function as both structural body panel and charge storage medium stems from its unique pattern design between “electrochemical areas (EcA)” and “epoxy area (EpA)”. Herein, a design optimization study is presented to obtain a balanced ratio between EcA versus EpA to maximize the charge storage ability of the composite while maintaining a decent tensile and bending strength. Simulations using ANSYS software and experimental confirmation using universal testing machines and electrochemical analyzers are used to derive optimum ratios between EcA and EpA. Uniaxial tension test and 3-point bend test have been performed to optimize the tensile and bend strengths, whereas cyclic voltammetry, galvanic charge–discharge, and electrochemical impedance spectroscopy are used to determine the electrochemical performance of various design configurations by modulating the ratios of EcA versus EpA. Overall, the highest achieved energy storage per lamina is 2531 mWh m−2 for a maximum of 81.6% EcA with a tensile strength of 417.73 MPa and bending strength of 263.13 MPa. This study is highly beneficial for EVs and aerospace applications.
Linear autonomous system theory and optimal control analysis for launch vehicle stability and antenna pointing direction
Interpolating scattered data points is a problem of wide ranging interest. A number of approaches for interpolation have been proposed both from theoretical domains such as computational geometry and in applications' fields such as geostatistics. Our motivation arises from geological and mining applications. In many instances data can be costly to compute and are available only at nonuniformly scattered positions. Because of the high cost of collecting measurements, high accuracy is required in the interpolants. One of the most popular interpolation methods in this field is called ordinary kriging. It is popular because it is a best linear unbiased estimator. The price for its statistical optimality is that the estimator is computationally very expensive. This is because the value of each interpolant is given by the solution of a large dense linear system. In practice, kriging problems have been solved approximately by restricting the domain to a small local neighborhood of points that lie near the query point. Determining the proper size for this neighborhood is a solved by ad hoc methods, and it has been shown that this approach leads to undesirable discontinuities in the interpolant. Recently a more principled approach to approximating kriging has been proposed based on a technique called covariance tapering. This process achieves its efficiency by replacing the large dense kriging system with a much sparser linear system. This technique has been applied to a restriction of our problem, called simple kriging, which is not unbiased for general data sets. In this paper we generalize these results by showing how to apply covariance tapering to the more general problem of ordinary kriging. Through experimentation we demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods for solving large sparse systems. We demonstrate our approach on large data sizes arising both from synthetic sources and from real applications.
The optimal-control problem arising in coplanar orbital transfer using aeroassist technology is addressed. The maneuver involves the transfer from high earth orbit to low earth orbit with minimum fuel consumption. Simulations are carried out to obtain a corridor of entry conditions which are suitable for flying the spacecraft through the atmosphere. A highlight of the present work is the application of an efficient multiple shooting method for handling the difficult nonlinear two-point boundary value problem resulting from the optimization procedure.
The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.
In an aircraft configuration optimization, the information of interest is the sensitivity of optimal block fuel consumption and wing aspect ratio and area, to variations of required range and payload. The objectives of this study are: (1) to show how the equations capable of yielding the sensitivity derivatives (the sensitivity equations) can be obtained for a constrained optimum regardless of the type of optimization algorithm that was used to arrive at the optimum point, (2) to review the solvability of the sensitivity equations and (3) to report on applications on structural optimization. Numerical examples, which demonstrate the sensitivity analysis, include a tubular column and a three-bar truss for which closed form solutions are obtained, a ten-bar truss that requires the use of a finite element analysis, and a thin-walled beam characterized by strongly nonlinear constraints for local buckling. It is concluded that a practically significant extrapolation accuracy may be obtained for a reasonably broad range of parameter changes; and that accuracy does not depend strongly on the degree of convergence of the optimum solution from which the sensitivity derivatives are obtained.
This paper discusses the calculation of sensitivities. or derivatives, for optimization problems involving systems governed by differential equations and other state relations. The subject is examined from the point of view of nonlinear programming, beginning with the analytical structure of the first and second derivatives associated with such problems and the relation of these derivatives to implicit differentiation and equality constrained optimization. We also outline an error analysis of the analytical formulae and compare the results with similar results for finite-difference estimates of derivatives. We then attend to an investigation of the nature of the adjoint method and the adjoint equations and their relation to directions of steepest descent. We illustrate the points discussed with an optimization problem in which the variables are the coefficients in a differential operator.
A parametric optimization study is performed on the nozzle of a laboratory rotating detonation rocket engine (RDRE) using a three-dimensional computational fluid dynamic simulation. The primary optimization objective is maximum nozzle thrust. The basic nozzle configuration is a shrouded, truncated plug. The fluid in the RDRE chamber leading to the nozzle is choked at its exit so that its cyclic behavior is unaffected by any changes to the nozzle design. Optimization is performed for a single operating point. Parameters varied are the overall nozzle area expansion ratio and the fraction of the expansion area that is provided by the shroud. These two parameters indirectly affect the angle of the plug nozzle cone, and the bluff body area associated with its truncation. Nozzle thrust is evaluated as the difference between the thrust of the RDRE chamber-plus-nozzle combination and that of the chamber alone. The nozzle produces approximately 20% of the total engine thrust. The baseline nozzle is found to perform well, yielding 58.1% of the thrust calculated for a notional ideal RDRE nozzle which can instantaneously change shape to allow isentropic expansion of every fluid element. Optimization improves the performance, bringing the nozzle thrust to 70.0% of the notional ideal, and total engine thrust (chamber-plus-nozzle) to 94% of the ideal.
A parametric optimization study is performed on the nozzle of a laboratory rotating detonation rocket engine (RDRE) using a three-dimensional computational fluid dynamic simulation. The primary optimization objective is maximum nozzle thrust. The basic nozzle configuration is a shrouded, truncated plug. The fluid in the RDRE chamber leading to the nozzle is choked at its exit so that its cyclic behavior is unaffected by any changes to the nozzle design. Optimization is performed for a single operating point. Parameters varied are the overall nozzle area expansion ratio and the fraction of the expansion area that is provided by the shroud. These two parameters indirectly affect the angle of the plug nozzle cone, and the bluff body area associated with its truncation. Nozzle thrust is evaluated as the difference between the thrust of the RDRE chamber-plus-nozzle combination and that of the chamber alone. The nozzle produces approximately 20% of the total engine thrust. The baseline nozzle is found to perform well, yielding 58.1% of the thrust calculated for a notional ideal RDRE nozzle which can instantaneously change shape to allow isentropic expansion of every fluid element. Optimization improves the performance, bringing the nozzle thrust to 70.0% of the notional ideal, and total engine thrust (chamber-plus-nozzle) to 94% of the ideal.
An evaluation is conducted of two numerical techniques developed by Richmond (1961, 1966) for wire antennas and scattering bodies. It is concluded that a more efficient and accurate scheme can be devised by suitably combining the two techniques. This scheme, which is called the 'hybrid method', is well suited for a wire antenna mounted in a cavity. Reaction matching is employed in the case of the antenna, while point matching is used for the support structure. The described approach makes it possible to consider voltage generators without the use of any equivalent magnetic frill current sources. The number of unknown currents to be determined is essentially optimized by this combination of reaction matching and point matching. The resulting current distribution is a quantized distribution on the support structure and is continuous on the main radiator.
A computationally efficient method for calculating near-optimal solutions to the three-objective, linear control allocation problem is disclosed. The control allocation problem is that of distributing the effort of redundant control effectors to achieve some desired set of objectives. The problem is deemed linear if control effectiveness is affine with respect to the individual control effectors. The optimal solution is that which exploits the collective maximum capability of the effectors within their individual physical limits. Computational efficiency is measured by the number of floating-point operations required for solution. The method presented returned optimal solutions in more than 90% of the cases examined; non-optimal solutions returned by the method were typically much less than 1% different from optimal and the errors tended to become smaller than 0.01% as the number of controls was increased. The magnitude of the errors returned by the present method was much smaller than those that resulted from either pseudo inverse or cascaded generalized inverse solutions. The computational complexity of the method presented varied linearly with increasing numbers of controls; the number of required floating point operations increased from 5.5 i, to seven times faster than did the minimum-norm solution (the pseudoinverse), and at about the same rate as did the cascaded generalized inverse solution. The computational requirements of the method presented were much better than that of previously described facet-searching methods which increase in proportion to the square of the number of controls.
A computational wing optimization procedure was developed and verified by an experimental investigation of a semi-span variable camber wing model in the NASA Ames Research Center 14 foot transonic wind tunnel. The Bailey-Ballhaus transonic potential flow analysis and Woodward-Carmichael linear theory codes were linked to Vanderplaats constrained minimization routine to optimize model configurations at several subsonic and transonic design points. The 35 deg swept wing is characterized by multi-segmented leading and trailing edge flaps whose hinge lines are swept relative to the leading and trailing edges of the wing. By varying deflection angles of the flap segments, camber and twist distribution can be optimized for different design conditions. Results indicate that numerical optimization can be both an effective and efficient design tool. The optimized configurations had as good or better lift to drag ratios at the design points as the best designs previously tested during an extensive parametric study.