Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cost 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 1,135 records · Page 63

Space Tug systems study (storable). Volume 1: Overview presentation

Program plans are established for a storable propellant space tug used to perform high energy orbit transfers from the space transportation system (STS) orbiter. The mission model for the STS in the 1980's is analyzed. Performance and mission requirements are determined. Various flight operations modes are evaluated and selected. Subsystems are selected and synthesized into various tug configurations. Program options for these configurations are defined, analyzed, and selected. Selected program options are further defined and optimized, including program requirements, tug vehicle definition, mission accomplishment, ground and flight operations, programmatics and costs.

Source record↗

Parallel, iterative solution of sparse linear systems: Models and architectures

A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

Parallel, iterative solution of sparse linear systems - Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problem in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.

Reed, D. A.↗

Elimination sequence optimization for SPAR

SPAR is a large-scale computer program for finite element structural analysis. The program allows user specification of the order in which the joints of a structure are to be eliminated since this order can have significant influence over solution performance, in terms of both storage requirements and computer time. An efficient elimination sequence can improve performance by over 50% for some problems. Obtaining such sequences, however, requires the expertise of an experienced user and can take hours of tedious effort to affect. Thus, an automatic elimination sequence optimizer would enhance productivity by reducing the analysts' problem definition time and by lowering computer costs. Two possible methods for automating the elimination sequence specifications were examined. Several algorithms based on the graph theory representations of sparse matrices were studied with mixed results. Significant improvement in the program performance was achieved, but sequencing by an experienced user still yields substantially better results. The initial results provide encouraging evidence that the potential benefits of such an automatic sequencer would be well worth the effort.

Hogan, Harry A.↗

A new method of boundary parameter estimation for a two-dimensional diffusion system under noisy observations

The purpose of this paper is to establish a method for identifying unknown parameters involved in the boundary state of a class of diffusion systems under noisy observations. A mathematical model of the system dynamics is given by a two-dimensional diffusion equation. Noisy observations are made by sensors allocated on the system boundary. Starting with the mathematical model mentioned above, an online parameter estimation algorithm is proposed within the framework of the maximum likelihood estimation. Existence of the optimal solution and related necessary conditions are discussed. By solving a local variation of the cost functional with respect to the perturbation of parameters, the estimation mechanism is proposed in a form of recursive computations. Finally, the feasibility of the estimator proposed here is demonstrated through results of digital simulation experiments.

Sunahara, Y.↗

A flexible on-board demultiplexer/demodulator

Optimization of satellite communications system performance from the point of view of reduced overall system cost per unit of service delivered, requires that economies be exercised at all levels. Introduction of onboard regeneration which necessarily involves on-board demultiplexing and demodulation is an essential ingredient in meeting this goal. To achieve maximum benefit from this approach, the uplink transmission data rate and bandwidth from each earth terminal and consequently uplink EIRP needs to be minimized. This necessarily introduces multiple carriers of different bandwidths on the uplinks and creates an attending need onboard for simultaneous demodulation of many carriers. This paper addresses a digitally implemented bulk demultiplexer/demodulator that processes a large number of carriers having differing carrier bandwidths, bit rates and center rrequencies. The device is programmable from the ground to accommodate changes in the complexion of the carriers.

Campanella, S. Joseph↗

A method of boundary parameter estimation for a two-dimensional diffusion system under noisy observations

The purpose of this paper is to establish a method for identifying unknown parameters involved in the boundary state of a class of diffusion systems under noisy observations. A mathematical model of the system dynamics is given by a two-dimensional diffusion equation. Noisy observations are made by sensors allocated on the system boundary. Starting with the mathematical model mentioned above, an online parameter estimation algorithm is proposed within the framework of the maximum likelihood estimation. Existence of the optimal solution and related necessary conditions are discussed. By solving a local variation of the cost functional with respect to the perturbation of parameters, the estimation mechanism is proposed in a form of recursive computations. Finally, the feasibility of the estimator proposed here is demonstrated through results of digital simulation experiments.

Sunahara, Y.↗

A new adaptive control approach for aerospace vehicles with parameter uncertainties

A new stochastic adaptive control structure is developed for the problem of combined parameter estimation and control of aerospace vehicles with changing parameters. Parameter uncertainties are modeled as first-order Gauss-Markov processes, and are introduced to the system dynamics through a small parameter. It is assumed that an accurate inertial measurement unit gives perfect measurements of the state variables. Since the stochastic system is assumed to be Gauss-Markov, the density function of the parameters given these measurements is conditionally Gaussian. Based on this conditionally Gaussian density, the problem of minimizing a quadratic cost over an infinite time horizon can be set up within the framework of stochastic optimal control theory. The optimal feedback control law is derived from a straightforward expansion of the Hamilton-Jacobi-Bellman equation, based on the LQG solution. The resulting nonlinear controller is applied to the pitch axis control of a space platform with uncertain moments of inertia and is shown to produce marked improvement over a fixed controller.

Hahn, Yungsun↗

Power Converters Maximize Outputs Of Solar Cell Strings

Microprocessor-controlled dc-to-dc power converters devised to maximize power transferred from solar photovoltaic strings to storage batteries and other electrical loads. Converters help in utilizing large solar photovoltaic arrays most effectively with respect to cost, size, and weight. Main points of invention are: single controller used to control and optimize any number of "dumb" tracker units and strings independently; power maximized out of converters; and controller in system is microprocessor.

Frederick, Martin E.↗

Robust neighboring extremal guidance for the advanced launch system

With the availability of modern flight computers, realtime neighboring extremal guidance seems feasible. To overcome sensitivity to unknown system parameters and environmental uncertainties, a robust neighboring extremal guidance scheme is proposed. About the optimal trajectory, the accessory problem in the calculus of variations is formed, generating a quadratic cost criterion in the perturbed states and controls. By formulating a disturbance attenuation problem based upon the second variation cost criterion, a differential game is formulated. The game theoretic cost criterion is minimized with respect to the perturbed control but maximized with respect to the unknown parameters in the linearized dynamics. The resulting differential game problem gives rise to a two-point boundary-value problem solved using the sweep method. The sweep method solution provides a linear robust neighboring extremal guidance scheme that is applied to the Advanced Launch System.

Bain, John↗

The Use of Human Factors Simulation to Conserve Operations Expense

In preparation for on-orbit operations, NASA performs experiments aboard a KC-135 which performs parabolic maneuvers, resulting in short periods of microgravity. While considerably less expensive than space operations, the use of this aircraft is costly. Simulation of tasks to be performed during the flight can allow the participants to optimize hardware configuration and crew interaction prior to flight. This presentation will demonstrate the utility of such simulation. The experiment simulated is the fluid dynamics of epoxy components which may be used in a patch kit in the event of meteoroid damage to the International Space Station. Improved configuration and operational efficiencies were reflected in early and increased data collection.

Hamilton, George S.↗

Displacement Damage in Bipolar Linear Integrated Circuits

Although many different processes can be used to manufacture linear integrated circuits, the process that is used for most circuits is optimized for high voltage -- a total power supply voltage of about 40 V -- and low cost. This process, which has changed little during the last twenty years, uses lateral and substrate p-n-p transistors. These p-n-p transistors have very wide base regions, increasing their sensitivity to displacement damage from electrons and protons. Although displacement damage effects can be easily treated for individual transistors, the net effect on linear circuits can be far more complex because circuit operation often depends on the interaction of several internal transistors. Note also that some circuits are made with more advanced processes with much narrower base widths. Devices fabricated with these newer processes are not expected to be significantly affected by displacement damage for proton fluences below 1 x 10(exp 12) p/sq cm. This paper discusses displacement damage in linear integrated circuits with more complex failure modes than those exhibited by simpler devices, such as the LM111 comparator, where the dominant response mode is gain degradation of the input transistor. Some circuits fail catastrophically at much lower equivalent total dose levels compared to tests with gamma rays. The device works satisfactorily up to nearly 1 Mrad(Si) when it is irradiated with gamma rays, but fails catastrophically between 50 and 70 krad(Si) when it is irradiated with protons.

Rax, B. G.↗

Power Station Design

Kuljian Corporation provides design engineering and construction management services for power generating plants in more than 20 countries. They used WASP (Calculating Water and Steam Properties), a COSMIC program to optimize power station design. This enabled the company to substantially reduce lead time and software cost in a recent design project.

Source record↗

Performance and Reliability Optimization for Aerospace Systems subject to Uncertainty and Degradation

This report summarizes work performed by the Space Systems Laboratory (SSL) for NASA Langley Research Center in the field of performance optimization for systems subject to uncertainty. The objective of the research is to develop design methods and tools to the aerospace vehicle design process which take into account lifecycle uncertainties. It recognizes that uncertainty between the predictions of integrated models and data collected from the system in its operational environment is unavoidable. Given the presence of uncertainty, the goal of this work is to develop means of identifying critical sources of uncertainty, and to combine these with the analytical tools used with integrated modeling. In this manner, system uncertainty analysis becomes part of the design process, and can motivate redesign. The specific program objectives were: 1. To incorporate uncertainty modeling, propagation and analysis into the integrated (controls, structures, payloads, disturbances, etc.) design process to derive the error bars associated with performance predictions. 2. To apply modern optimization tools to guide in the expenditure of funds in a way that most cost-effectively improves the lifecycle productivity of the system by enhancing the subsystem reliability and redundancy. The results from the second program objective are described. This report describes the work and results for the first objective: uncertainty modeling, propagation, and synthesis with integrated modeling.

Miller, David W.↗

Wireless Channel Characterization in the Airport Surface Environment

Given the anticipated increase in air traffic in the coming years, modernization of the National Airspace System (NAS) is a necessity. Part of this modernization effort will include updating current communication, navigation, and surveillance (CNS) systems to deal with the increased traffic as well as developing advanced CNS technologies for the systems. An example of such technology is the integrated CNS (ICNS) network being developed by the Advanced CNS Architecture and Systems Technology (ACAST) group for use in the airport surface environment. The ICNS network would be used to convey voice/data between users in a secure and reliable manner. The current surface system only supports voice and does so through an obsolete physical infrastructure. The old system is vulnerable to outages and costly to maintain. The proposed ICNS network will include a wireless radio link. To ensure optimal performance, a thorough and accurate characterization of the channel across which the link would operate is necessary. The channel is the path the signal takes from the transmitter to the receiver and is prone to various forms of interference. Channel characterization involves a combination of analysis, simulation, and measurement. My work this summer was divided into four tasks. The first task required compiling and reviewing reference material that dealt with the characterization and modeling of aeronautical channels. The second task involved developing a systematic approach that could be used to group airports into classes, e.g. small airfields, medium airports, large open airports, large cluttered airports, etc. The third task consisted of implementing computer simulations of existing channel models. The fourth task entailed measuring possible interference sources in the airport surface environment via a spectrum analyzer.

Neville, Joshua T.↗

At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

Janich, Karl W.↗

Improving Learning Performance Through Rational Resource Allocation

This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning cost and show that the problem of efficient learning can be cast as a resource optimization problem. Solutions found in this way can be significantly more efficient than the best solutions that do not account for these factors. We introduce a heuristic learning algorithm that approximately solves this optimization problem and document its performance improvements on synthetic and real-world problems.

resource optimization↗