Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution optimization”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Software Tools to Support the Assessment of System Health

This presentation provides an overview of three software tools that were developed by the NASA Glenn Research Center to support the assessment of system health: the Propulsion Diagnostic Method Evaluation Strategy (ProDIMES), the Systematic Sensor Selection Strategy (S4), and the Extended Testability Analysis (ETA) tool. Originally developed to support specific NASA projects in aeronautics and space, these software tools are currently available to U.S. citizens through the NASA Glenn Software Catalog. The ProDiMES software tool was developed to support a uniform comparison of propulsion gas path diagnostic methods. Methods published in the open literature are typically applied to dissimilar platforms with different levels of complexity. They often address different diagnostic problems and use inconsistent metrics for evaluating performance. As a result, it is difficult to perform a one ]to ]one comparison of the various diagnostic methods. ProDIMES solves this problem by serving as a theme problem to aid in propulsion gas path diagnostic technology development and evaluation. The overall goal is to provide a tool that will serve as an industry standard, and will truly facilitate the development and evaluation of significant Engine Health Management (EHM) capabilities. ProDiMES has been developed under a collaborative project of The Technical Cooperation Program (TTCP) based on feedback provided by individuals within the aircraft engine health management community. The S4 software tool provides a framework that supports the optimal selection of sensors for health management assessments. S4 is structured to accommodate user ]defined applications, diagnostic systems, search techniques, and system requirements/constraints. One or more sensor suites that maximize this performance while meeting other user ]defined system requirements that are presumed to exist. S4 provides a systematic approach for evaluating combinations of sensors to determine the set or sets of sensors that optimally meet the performance goals and the constraints. It identifies optimal sensor suite solutions by utilizing a merit (i.e., cost) function with one of several available optimization approaches. As part of its analysis, S4 can expose fault conditions that are difficult to diagnose due to an incomplete diagnostic philosophy and/or a lack of sensors. S4 was originally developed and applied to liquid rocket engines. It was subsequently used to study the optimized selection of sensors for a simulation ]based aircraft engine diagnostic system. The ETA Tool is a software ]based analysis tool that augments the testability analysis and reporting capabilities of a commercial ]off ]the ]shelf (COTS) package. An initial diagnostic assessment is performed by the COTS software using a user ]developed, qualitative, directed ]graph model of the system being analyzed. The ETA Tool accesses system design information captured within the model and the associated testability analysis output to create a series of six reports for various system engineering needs. These reports are highlighted in the presentation. The ETA Tool was developed by NASA to support the verification of fault management requirements early in the Launch Vehicle process. Due to their early development during the design process, the TEAMS ]based diagnostic model and the ETA Tool were able to positively influence the system design by highlighting gaps in failure detection, fault isolation, and failure recovery.

Melcher, Kevin J.↗
NASA NTRS2016

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

Mission proposals that land spacecraft on asteroids are becoming increasingly popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site with pinpoint precision. The problem under investigation is how to design a propellant optimal powered descent trajectory that can be quickly computed onboard the spacecraft, without interaction from the ground control. The propellant optimal control problem in this work is to determine the optimal finite thrust vector to land the spacecraft at a specified location, in the presence of a highly nonlinear gravity field, subject to various mission and operational constraints. The proposed solution uses convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process for a fixed final time problem. In addition, a second optimization method is wrapped around the convex optimization problem to determine the optimal flight time that yields the lowest propellant usage over all flight times. Gravity models designed for irregularly shaped asteroids are investigated. Success of the algorithm is demonstrated by designing powered descent trajectories for the elongated binary asteroid Castalia.

Pinson, Robin M.↗
NASA NTRS1992

An approach to the functional optimization of the CELSS Test Facility

An optimization of the CELSS Test Facility (CTF) subsystems and the entire CTF is necessary in order to meet strict limitations imposed on mass, volume, and power. Depending on the subsystem, other requirements must also be met. This paper shows the way to examine compatibility of requirements, to define an area of existing solutions (an operational envelope), and to find an optimal solution. The workability of the method is shown using problems of heat load on the Plant Growth Chamber, of optimization of the Vapor-Air Membrane Separation Device, and of finding a CTF configuration with minimum air pressure drop.

Yendler, Boris S.↗
NASA NTRS1989

First and second order convex approximation strategies in structural optimization

In this paper, various methods based on convex approximation schemes are discussed that have demonstrated strong potential for efficient solution of structural optimization problems. First, the convex linearization method (Conlin) is briefly described, as well as one of its recent generalizations, the method of moving asymptotes (MMA). Both Conlin and MMA can be interpreted as first-order convex approximation methods that attempt to estimate the curvature of the problem functions on the basis of semiempirical rules. Attention is next directed toward methods that use diagonal second derivatives in order to provide a sound basis for building up high-quality explicit approximations of the behavior constraints. In particular, it is shown how second-order information can be effectively used without demanding a prohibitive computational cost. Various first-order and second-order approaches are compared by applying them to simple problems that have a closed form solution.

Fleury, C.↗
NASA NTRS1988

Optimal cooperative time-fixed impulsive rendezvous

A method has been developed for determining optimal, i.e., minimum fuel, trajectories for the fixed-time cooperative rendezvous of two spacecraft. The method presently assumes that the vehicles perform a total of three impulsive maneuvers with each vehicle being active, that is, making at least one maneuver. The cost of a feasible 'reference' trajectory is improved by an optimizer which uses an analytical gradient developed using primer vector theory and a new solution for the optimal terminal (rendezvous) maneuver. Results are presented for a large number of cases in which the initial orbits of both vehicles are circular but in which the initial positions of the vehicles and the allotted time for rendezvous are varied. In general, the cost of the cooperative rendezvous is less than that of rendezvous with one vehicle passive. Further improvement in cost may be obtained in the future when additional, i.e., midcourse, impulses are allowed and inserted as indicated for some cases by the primer vector histories which are generated by the program.

Mirfakhraie, Koorosh↗
NASA NTRS1990

A novel multireceiver communications system configuration based on optimal estimation theory

A multireceiver configuration for the purpose of carrier arraying and/or signal arraying is presented. Such a problem arises for example, in the NASA Deep Space Network where the same data-modulated signal from a spacecraft is received by a number of geographically separated antennas and the data detection must be efficiently performed on the basis of the various received signals. The proposed configuration is arrived at by formulating the carrier and/or signal arraying problem as an optimal estimation problem. Two specific solutions are proposed. The first solution is to simultaneously and optimally estimate the various phase processes received at different receivers with coupled phase locked loops (PLLs) wherein the individual PLLs acquire and track their respective receivers' phase processes, but are aided by each other in an optimal manner. However, when the phase processes are relatively weakly correlated, and for the case of relatively high values of symbol energy-to-noise spectral density ratio, a novel configuration for combining the data modulated, loop-output signals is proposed. The scheme can be extended to the case of low symbol energy-to-noise case by performing the combining/detection process over a multisymbol period. Such a configuration results in the minimization of the effective radio loss at the combiner output, and thus a maximization of energy per bit to noise-power spectral density ration is achieved.

Kumar, R.↗
NASA NTRS2005

Optimizing Parameters for Deep-Space Optical Communication

A paper discusses the optimization of the parameters of a high-rate, deep-space optical communication link that utilizes pulse-position modulation (PPM) and an error-correcting code (ECC). The parameters in question include the PPM order (number of pulse time slots in one symbol period), the ECC rate, and the uncoded symbol error rate. In simple terms, the optimization problem is to choose the combination of these parameters that maximizes the throughput data rate at a given bit-error-rate (BER), subject to several constraints, including limits on the average and peak power and possibly a limit on the uncoded symbol error rate. This is a complex, multidimensional optimization problem, the solution of which involves computation of channel capacities for various combinations of the parameters. The paper presents extensive theoretical analyses and numerical predictions that elucidate the many facets of the optimization problem. It shows how a nearly optimum solution can be obtained by choosing the optimum PPM order for the desired number of bits per slot and concatenating the PPM mapping with an error-correction code so that the decoded bits satisfy some BER threshold.

Moison, Bruce↗
NASA NTRS2003

Route Monopolie and Optimal Nonlinear Pricing

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform distribution of agent types and explain the implications for airlines in terms of service differentiation.

Tournut, Jacques↗
NASA NTRS2010

Traffic Flow Management Using Aggregate Flow Models and the Development of Disaggregation Methods

A linear time-varying aggregate traffic flow model can be used to develop Traffic Flow Management (tfm) strategies based on optimization algorithms. However, there are no methods available in the literature to translate these aggregate solutions into actions involving individual aircraft. This paper describes and implements a computationally efficient disaggregation algorithm, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate TFM schedules for a typical day in the U.S. National Airspace System. The results show that the disaggregation algorithm generates control actions for individual flights while keeping the air traffic behavior very close to the optimal solution.

Sun, Dengfeng↗
NASA NTRS2006

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Rai, Man Mohan↗
NASA NTRS1977

Trajectory optimization for the Atlas/Centaur launch vehicle

A method for finding solutions to complex trajectory optimization problems with detailed hardware and launch vehicle constraints is presented. The trajectory optimization problem is formulated as a constrained function minimization problem by modeling the control by a function of a finite number of parameters. Although any parametric control model may be selected, the natural choice of parameters is the actual parameters of the parametric guidance equations flown on the flight digital computer. A variation of the method of multipliers is presented for performing the constrained function minimization. A functional is proposed that allows incorporation of state variable inequality constraints. Finally, optimization of the HEAO-A direct-ascent trajectory is discussed. The HEAO-A mission demonstrates profile optimization to meet range safety, tracking, heating, structural integrity, and attitude rate constraints.

Brusch, R. G.↗
NASA NTRS1984

Optimal low-thrust, three-burn orbit transfers with large plane changes

Optimal low-thrust, three-burn solutions have been obtained for orbit transfers between a 28.5-degree inclined low earth orbit and a series of 63.4-degree inclined circular orbits as well as a series of 63.4-degree inclined elliptical orbits with twelve hour periods. Solutions have also been obtained for orbit transfers between 97-degree inclined orbits and a 57-degree inclined low earth orbit. Thrust to weight ratios as low as 0.02 were considered. A hybrid nonlinear programming method was used to obtain the solutions. Analysis of the optimal steering during various burns reveals a natural division of the steering strategies into two categories based on whether a burn results in a change predominantly in semi-major axis or orbit plane. The similarity of these optimal steering strategies to previously obtained simple near-optimal steering strategies is discussed.

Zondervan, K. P.↗
NASA NTRS1998

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia↗
NASA NTRS1989

Guidance analysis of the aeroglide plane change maneuver as a turning point problem

The development of guidance approximations for the atmospheric (aeroglide) portion of the minimum fuel, orbital plane change, trajectory optimization problem is described. Asymptotic methods are used to reduce the two point, boundary value, optimization problem to a turning point problem from the bank angle control. The turning point problem solution, which yields an approximate optimal control policy, is given in terms of parabolic cylinder functions, which are tabulated, and integral expressions, which must be numerically computed. Comparisons of the former, over their region of validity, with optimal control solutions show good qualitative agreement. Additional work and analysis is needed to compute the guidance approximation work.

Gracey, Christopher↗
NASA NTRS1994

The Evolution of Technology in the Deep Space Network: A History of the Advanced Systems Program

The Deep Space Network (DSN) of 1995 might be described as the evolutionary result of 45 years of deep space communication and navigation, together with the synergistic activities of radio science and radar and radio astronomy. But the evolution of the DSN did not just happen - it was carefully planned and created. The evolution of the DSN has been an ongoing engineering activity, and engineering is a process of problem solving under constraints, one of which is technology. In turn, technology is the knowledge base providing the capability and experience for practical application of various areas of science, when needed. The best engineering solutions result from optimization under the fewest constraints, and if technology needs are well anticipated (ready when needed), then the most effective engineering solution is possible. Throughout the history of the DSN it has been the goal and function of DSN advanced technology development (designated the DSN Advanced Systems Program from 1963 through 1994) to supply the technology needs of the DSN when needed, and thus to minimize this constraint on DSN engineering. Technology often takes considerable time to develop, and when that happens, it is important to have anticipated engineering needs; at times, this anticipation has been by as much as 15 years. Also, on a number of occasions, mission malfunctions or emergencies have resulted in unplanned needs for technology that has, in fact, been available from the reservoir of advanced technology provided by the DSN Advanced Systems Program. Sometimes, even DSN engineering personnel fail to realize that the organization of JPL permits an overlap of DSN advanced technology activities with subsequent engineering activities. This can result in the flow of advanced technology into DSN engineering in a natural and sometimes almost unnoticed way. In the following pages, we will explore some of the many contributions of the DSN Advanced Systems Program that were provided to DSN Engineering and Implementation. These contributions are, for the most part, unique capabilities that have met the requirements of flight projects for 45 years. These unique capabilities include not only the world's best deep-space communications system, but also outstanding competency in the fields of radio metric measurement, radar and radio astronomy, and radio science.

Layland, J. W.↗
NASA NTRS2016

Introducing a Degree of Freedom in the Family of Generalized Logarithmic Spirals

The versatility of the family of generalized logarithmic spirals is improved by introducing a degree of freedom in the solution. The low-thrust acceleration profile now includes a control term that affects both the magnitude and the direction of the thrust. Exact and fully analytic solutions to the trajectory, the velocity, the time of flight, etc. are made available. Two integrals of motion are preserved. The first one is a generalization of the equation of the energy and depends on the values of the control parameter. The second one relates to the equation of the angular momentum. The problem of finding spiral transfers between two arbitrary state vectors reduces to solving one algebraic equation with one unknown. The degree of freedom allows fixing the time of flight of the transfer. If the time of flight is fixed, then there are two equations with two unknowns. No other iterative procedures are required. Coast arcs can be introduced in the solution naturally. An explicit expression for the maximum acceleration reached along the transfer is provided. Thanks to the symmetry properties of the solution a simple algorithm for generating periodic orbits is presented. An arbitrary number of intermediate nodes can be introduced to improve the flexibility of the solution when facing optimization problems. An example of a low-thrust gravity-assist Earth-Mars-Ceres trajectory shows that the solution is comparable to that obtained with other preliminary design techniques.

Roa, Javier↗
NASA NTRS1976

Elliptic integral solutions to a class of space flight optimization problems

This paper is initially concerned with the minimum-time, exoatmospheric flight of a rocket with constant thrust acceleration magnitude, as in the cases of nuclear and solar electric propulsion. Gravitational acceleration is assumed to be a constant scalar multiple of the radius vector, plus a correction term which is a given function of time. The solution to the state equations is obtained in terms of elliptic integrals. A method is presented for the solution of the two-point boundary-condition problem associated with orbital transfer. At most, the latter method requires iteration upon final time, angle of injection, and two other parameters which are bounded. An example problem is provided which involves a rocket with very low thrust and a spiraling trajectory of many revolutions, but an altitude change of only several hundred miles above the earth. Finally, the original elliptic integral solution is extended to a larger class of low and intermediate thrust problems with constant thrust magnitude, mass decreasing with time, and an inverse square gravitational force.

Andrus, J. F.↗