SEARCH · Engineering Papers

Results for “Maximization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

All sources NASA NTRS DOE OSTI

NASA NTRS1999

A Flight Demonstration of Plasma Rocket Propulsion

The Advanced Space Propulsion Laboratory at the Johnson Space Center has been engaged in the development of a magneto-plasma rocket for several years. This type of rocket could be used in the future to propel interplanetary spacecraft. One advantageous feature of this rocket concept is the ability to vary its specific impulse so that it can be operated in a mode which maximizes propellant efficiency or a mode which maximizes thrust. This presentation will describe a proposed flight experiment in which a simple version of the rocket will be tested in space. In addition to the plasma rocket, the flight experiment will also demonstrate the use of a superconducting electromagnet, extensive use of heat pipes, and possibly the transfer of cryogenic propellant in space.

Petro, Andrew↗

NASA NTRS2000

Interference Lattice-based Loop Nest Tilings for Stencil Computations

A common method for improving performance of stencil operations on structured multi-dimensional discretization grids is loop tiling. Tile shapes and sizes are usually determined heuristically, based on the size of the primary data cache. We provide a lower bound on the numbers of cache misses that must be incurred by any tiling, and a close achievable bound using a particular tiling based on the grid interference lattice. The latter tiling is used to derive highly efficient loop orderings. The total number of cache misses of a code is the sum of (necessary) cold misses and misses caused by elements being dropped from the cache between successive loads (replacement misses). Maximizing temporal locality is equivalent to minimizing replacement misses. Temporal locality of loop nests implementing stencil operations is optimized by tilings that avoid data conflicts. We divide the loop nest iteration space into conflict-free tiles, derived from the cache miss equation. The tiling involves the definition of the grid interference lattice an equivalence class of grid points whose images in main memory map to the same location in the cache-and the construction of a special basis for the lattice. Conflicts only occur on the boundaries of the tiles, unless the tiles are too thin. We show that the surface area of the tiles is bounded for grids of any dimensionality, and for caches of any associativity, provided the eccentricity of the fundamental parallelepiped (the tile spanned by the basis) of the lattice is bounded. Eccentricity is determined by two factors, aspect ratio and skewness. The aspect ratio of the parallelepiped can be bounded by appropriate array padding. The skewness can be bounded by the choice of a proper basis. Combining these two strategies ensures that pathologically thin tiles are avoided. They do not, however, minimize replacement misses per se. The reason is that tile visitation order influences the number of data conflicts on the tile boundaries. If two adjacent tiles are visited successively, there will be no replacement misses on the shared boundary. The iteration space may be covered with pencils larger than the size of the cache while avoiding data conflicts if the pencils are traversed by a scanning-face method. Replacement misses are incurred only on the boundaries of the pencils, and the number of misses is minimized by maximizing the volume of the scanning face, not the volume of the tile. We present an algorithm for constructing the most efficient scanning face for a given grid and stencil operator. In two dimensions it is based on a continued fraction algorithm. In three dimensions it follows Voronoi's successive minima algorithm. We show experimental results of using the scanning face, and compare with canonical loop orderings.

VanderWijngaart, Rob F.↗

NASA NTRS2000

Artificial Gravity for Mars Missions: The Different Design and Development Options

One of the major impediments to human Mars missions is the development of appropriate countermeasures for long term physiological response to the micro-gravity environment. A plethora of countermeasure approaches have been advanced from strictly pharmacological measures to large diameter rotating spacecraft that would simulate a 1-g environment (the latter being the most conservative from a human health perspective). The different approaches have significantly different implications not only on the overall system design of a Mars Mission Vehicle (MMV) but on the necessary earth-orbiting platform that would be required to qualify the particular countermeasure system. it is found that these different design options can be conveniently categorized in terms of the order of magnitude of the rotation diameter required (100's, 10's, 1's, 0 meters). From this, the different mass penalties associated with each category can be generally compared. The overall objective of the countermeasure system should be to maximize crew safety and comfort, minimize exercise protocol time (i.e., the time per day that each crew member would have to participate in the exercise/countermeasure), maximize countermeasure effectiveness, and minimize the associated system mass penalty of the Mars Mission Vehicle (in terms of fraction of IMLEO - Injected Mass in Low Earth Orbit).

Murbach, Marcus↗

NASA NTRS2001

NASA Regional Planetary Image Facility

The Regional Planetary Image Facility (RPIF) provided access to data from NASA planetary missions and expert assistance about the data sets and how to order subsets of the collections. This ensures that the benefit/cost of acquiring the data is maximized by widespread dissemination and use of the observations and resultant collections. The RPIF provided education and outreach functions that ranged from providing data and information to teachers, involving small groups of highly motivated students in its activities, to public lectures and tours. These activities maximized dissemination of results and data to the educational and public communities.

Arvidson, Raymond E.↗

NASA NTRS1994

Optimizations on Designing High-Resolution Finite-Difference Schemes

We describe a general optimization procedure for both maximizing the resolution characteristics of existing finite differencing schemes as well as designing finite difference schemes that will meet the error tolerance requirements of numerical solutions. The procedure is based on an optimization process. This is a generalization of the compact scheme introduced by Lele in which the resolution is improved for single, one-dimensional spatial derivative, whereas in the present approach the complete scheme, after spatial and temporal discretizations, is optimized on a range of parameters of the scheme and the governing equations. The approach is to linearize and Fourier analyze the discretized equations to check the resolving power of the scheme for various wave number ranges in the solution and optimize the resolution to satisfy the requirements of the problem. This represents a constrained nonlinear optimization problem which can be solved to obtain the nodal weights of discretization. An objective function is defined in the parametric space of wave numbers, Courant number, Mach number and other quantities of interest. Typical criterion for defining the objective function include the maximization of the resolution of high wave numbers for acoustic and electromagnetic wave propagations and turbulence calculations. The procedure is being tested on off-design conditions of non-uniform mesh, non-periodic boundary conditions, and non-constant wave speeds for scalar and system of equations. This includes the solution of wave equations and Euler equations using a conventional scheme with and without optimization and the design of an optimum scheme for the specified error tolerance.

Liu, Yen↗

NASA NTRS2001

A Unique Power System For The ISS Fluids And Combustion Facility

Unique power control technology has been incorporated into an electrical power control unit (EPCU) for the Fluids and Combustion Facility (FCF). The objective is to maximize science throughput by providing a flexible power system that is easily reconfigured by the science payload. Electrical power is at a premium on the International Space Station (ISS). The EPCU utilizes advanced power management techniques to maximize the power available to the FCF experiments. The EPCU architecture enables dynamic allocation of power from two ISS power channels for experiments. Because of the unique flexible remote power controller (FRPC) design, power channels can be paralleled while maintaining balanced load sharing between the channels. With an integrated and redundant architecture, the EPCU can tolerate multiple faults and still maintain FCF operation. It is important to take full advantage of the EPCU functionality. The EPCU acts as a buffer between the experimenter and the ISS power system with all its complex requirements. However, FCF science payload developers will still need to follow guidelines when designing the FCF payload power system. This is necessary to ensure power system stability, fault coordination, electromagnetic compatibility, and maximum use of available power for gathering scientific data.

Fox, David A.↗

NASA NTRS1995

Speed Discrimination: Multiple Stimuli Appear Better Than One

We reported that for a 21FC task with multiple moving grating patches (Gabors) in each interval, thresholds for speed discrimination decreased with the number of patches, while increasing the area of a single grating produced no such effect. Furthermore, this decrease occurred regardless of the spacing of the patches about a circle of eccentricity 4 degrees, i.e., whether they were maximally separated or almost touching. These results suggest that it is the multiple, discrete grating patches that cause thresholds to decrease, rather than the spatial arrangement. To test this hypothesis, we measured the effect of dividing a large grating into four quadrants, by superimposing a mean-luminance cross on it. The mean speed discrimination thresholds (Weber Fractions) for four observers were 19, 15, and 11 plus or minus 2%, for the single large grating, the grating with cross, and the 4 maximally-separated, small gratings, respectively. Thus, breaking up a single large grating into multiple parts caused thresholds to improve, despite the fact that less of the original patch was visible. To investigate the possible contribution of total bounding contour length, we measured the effect of coalescing three small grating patches into a single banana-shaped patch, while keeping the total contour length constant. These two conditions were compared to a single, circular Gabor patch of equivalent area that had (necessarily) a smaller contour length. Preliminary data from 3 of 4 observers were similar for the small-grating and banana configurations, but increased for the single, large grating, suggesting that contour length might play a role. We are also investigating the role of low-level factors pertinent to the large grating, such as the pooling of signals from motion units at different eccentricities, and the stimulation of extended inhibitory motion surrounds, as well as the possible contribution of topdown influences that segment the stimulus into distinct objects.

Verghese, Preeti↗

NASA NTRS2001

Designing Agent Collectives For Systems With Markovian Dynamics

The "Collective Intelligence" (COIN) framework concerns the design of collectives of agents so that as those agents strive to maximize their individual utility functions, their interaction causes a provided "world" utility function concerning the entire collective to be also maximized. Here we show how to extend that framework to scenarios having Markovian dynamics when no re-evolution of the system from counter-factual initial conditions (an often expensive calculation) is permitted. Our approach transforms the (time-extended) argument of each agent's utility function before evaluating that function. This transformation has benefits in scenarios not involving Markovian dynamics, in particular scenarios where not all of the arguments of an agent's utility function are observable. We investigate this transformation in simulations involving both linear and quadratic (nonlinear) dynamics. In addition, we find that a certain subset of these transformations, which result in utilities that have low "opacity (analogous to having high signal to noise) but are not "factored" (analogous to not being incentive compatible), reliably improve performance over that arising with factored utilities. We also present a Taylor Series method for the fully general nonlinear case.

Wolpert, David H.↗

NASA NTRS2003

Formation Flying Design and Applications in Weak Stability Boundary Regions

Weak Stability regions serve as superior locations for interferometric scientific investigations. These regions are often selected to minimize environmental disturbances and maximize observing efficiency. Design of formations in these regions are becoming ever more challenging as more complex missions are envisioned. The development of algorithms to enable the capability for formation design must be further enabled to incorporate better understanding of WSB solution space. This development will improve the efficiency and expand the capabilities of current approaches. The Goddard Space Flight Center (GSFC) is currently supporting multiple formation missions in WSB regions. This end-to-end support consists of mission operations, trajectory design, and control. It also includes both algorithm and software development. The Constellation-X, Maxim, and Stellar Imager missions are examples of the use of improved numerical methods for attaining constrained formation geometries and controlling their dynamical evolution. This paper presents a survey of formation missions in the WSB regions and a brief description of the formation design using numerical and dynamical techniques.

Folta, David↗

NASA NTRS2002

Singular Vectors for Moisture-Measuring Norms

In dynamic meteorology, singular vectors (SVs) are the structures that maximize a given norm of a forecast perturbation given a tangent linear model and a quadratic constraint on the initial perturbation. That constraint is a prescription of the value of either the same or a different norm applied to the initial perturbations. In the sense that SVs maximize the forecast perturbations according to a specified measure, they may be considered as optimal perturbations. SVs are used to characterize predictability, to identify and correct possible initial errors given forecast errors, to create a set of significant perturbations for ensemble forecasting, or to determine locations for observation targeting. They are a specific application of generally defined singular vectors in mathematics.

Errico, Ronald M.↗

NASA NTRS2003

Mars Mission Optimization Based on Collocation of Resources

This paper presents a powerful approach for analyzing Martian data and for optimizing mission site selection based on resource collocation. This approach is implemented in a program called PROMT (Planetary Resource Optimization and Mapping Tool), which provides a wide range of analysis and display functions that can be applied to raw data or imagery. Thresholds, contours, custom algorithms, and graphical editing are some of the various methods that can be used to process data. Output maps can be created to identify surface regions on Mars that meet any specific criteria. The use of this tool for analyzing data, generating maps, and collocating features is demonstrated using data from the Mars Global Surveyor and the Odyssey spacecraft. The overall mission design objective is to maximize a combination of scientific return and self-sufficiency based on utilization of local materials. Landing site optimization involves maximizing accessibility to collocated science and resource features within a given mission radius. Mission types are categorized according to duration, energy resources, and in-situ resource utilization. Optimization results are shown for a number of mission scenarios.

G E Chamitoff↗

NASA NTRS2003

Runway Operations Planning: A Two-Stage Heuristic Algorithm

Anagnostakis, Ioannis↗

NASA NTRS2003

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

NASA NTRS2004

Linear State-Space Representation of the Dynamics of Relative Motion, Based on Restricted Three Body Dynamics

Precision Formation Flying is an enabling technology for a variety of proposed space-based observatories, including the Micro-Arcsecond X-ray Imaging Mission (MAXIM) , the associated MAXIM pathfinder mission, Stellar Imager (SI) and the Terrestrial Planet Finder (TPF). An essential element of the technology is the control algorithm, requiring a clear understanding of the dynamics of relative motion. This paper examines the dynamics of relative motion in the context of the Restricted Three Body Problem (RTBP). The natural dynamics of relative motion are presented in their full nonlinear form. Motivated by the desire to apply linear control methods, the dynamics equations are linearized and presented in state-space form. The stability properties are explored for regions in proximity to each of the libration points in the Earth/Moon - Sun rotating frame. The dynamics of relative motion are presented in both the inertial and rotating coordinate frames.

Luquette,Richard J.↗

NASA NTRS2004

Development of an Information Fusion System for Engine Diagnostics and Health Management

Aircraft gas-turbine engine data are available from a variety of sources including on-board sensor measurements, maintenance histories, and component models. An ultimate goal of Propulsion Health Management (PHM) is to maximize the amount of meaningful information that can be extracted from disparate data sources to obtain comprehensive diagnostic and prognostic knowledge regarding the health of the engine. Data Fusion is the integration of data or information from multiple sources, to achieve improved accuracy and more specific inferences than can be obtained from the use of a single sensor alone. The basic tenet underlying the data/information fusion concept is to leverage all available information to enhance diagnostic visibility, increase diagnostic reliability and reduce the number of diagnostic false alarms. This paper describes a basic PHM Data Fusion architecture being developed in alignment with the NASA C17 Propulsion Health Management (PHM) Flight Test program. The challenge of how to maximize the meaningful information extracted from disparate data sources to obtain enhanced diagnostic and prognostic information regarding the health and condition of the engine is the primary goal of this endeavor. To address this challenge, NASA Glenn Research Center (GRC), NASA Dryden Flight Research Center (DFRC) and Pratt & Whitney (P&W) have formed a team with several small innovative technology companies to plan and conduct a research project in the area of data fusion as applied to PHM. Methodologies being developed and evaluated have been drawn from a wide range of areas including artificial intelligence, pattern recognition, statistical estimation, and fuzzy logic. This paper will provide a broad overview of this work, discuss some of the methodologies employed and give some illustrative examples.

Volponi, Allan J.↗

NASA NTRS2004

Time-Extended Policies in Mult-Agent Reinforcement Learning

Reinforcement learning methods perform well in many domains where a single agent needs to take a sequence of actions to perform a task. These methods use sequences of single-time-step rewards to create a policy that tries to maximize a time-extended utility, which is a (possibly discounted) sum of these rewards. In this paper we build on our previous work showing how these methods can be extended to a multi-agent environment where each agent creates its own policy that works towards maximizing a time-extended global utility over all agents actions. We show improved methods for creating time-extended utilities for the agents that are both "aligned" with the global utility and "learnable." We then show how to crate single-time-step rewards while avoiding the pi fall of having rewards aligned with the global reward leading to utilities not aligned with the global utility. Finally, we apply these reward functions to the multi-agent Gridworld problem. We explicitly quantify a utility's learnability and alignment, and show that reinforcement learning agents using the prescribed reward functions successfully tradeoff learnability and alignment. As a result they outperform both global (e.g., team games ) and local (e.g., "perfectly learnable" ) reinforcement learning solutions by as much as an order of magnitude.

Tumer, Kagan↗

NASA NTRS2004

Team Formation in Partially Observable Multi-Agent Systems

Sets of multi-agent teams often need to maximize a global utility rating the performance of the entire system where a team cannot fully observe other teams agents. Such limited observability hinders team-members trying to pursue their team utilities to take actions that also help maximize the global utility. In this article, we show how team utilities can be used in partially observable systems. Furthermore, we show how team sizes can be manipulated to provide the best compromise between having easy to learn team utilities and having them aligned with the global utility, The results show that optimally sized teams in a partially observable environments outperform one team in a fully observable environment, by up to 30%.

Agogino, Adrian K.↗

NASA NTRS2004

Access from Space: A New Perspective on NASA's Space Transportation Technology Requirements and Opportunities

The need for robust and reliable access from space is clearly demonstrated by the recent loss of the Space Shuttle Columbia; as well as the NASA s goals to get the Shuttle re-flying and extend its life, build new vehicles for space access, produce successful robotic landers and s a q k ret~rr? ~llisrions, and maximize the science content of ambitious outer planets missions that contain nuclear reactors which must be safe for re-entry after possible launch aborts. The technology lynch pin of access from space is hypersonic entry systems such the thermal protection system, along with navigation, guidance and control (NG&C). But it also extends to descent and landing systems such as parachutes, airbags and their control systems. Current space access technology maturation programs such as NASA s Next Generation Launch Technology (NGLT) program or the In-Space Propulsion (ISP) program focus on maturing laboratory demonstrated technologies for potential adoption by specific mission applications. A key requirement for these programs success is a suitable queue of innovative technologies and advanced concepts to mature, including mission concepts enabled by innovative, cross cutting technology advancements. When considering space access, propulsion often dominates the capability requirements, as well as the attention and resources. From the perspective of access from space some new cross cutting technology drivers come into view, along with some new capability opportunities. These include new miniature vehicles (micro, nano, and picosats), advanced automated systems (providing autonomous on-orbit inspection or landing site selection), and transformable aeroshells (to maximize capabilities and minimize weight). This paper provides an assessment of the technology drivers needed to meet future access from space mission requirements, along with the mission capabilities that can be envisioned from innovative, cross cutting access from space technology developments.

Rasky, Daniel J.↗