Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cost allocation”

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 217 records · Page 12

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Ono, Masahiro↗

Low-frequency radio navigation for the Army's Mobile Automated Field Instrumentation System /MAFIS/

The Jet Propulsion Laboratory is engaged in the early phases of conceptual, preliminary design, and feasibility demonstration studies leading to determination of a design and implementation of the Army's proposed Mobile Automated Field Instrumentation System (MAFIS). An overview is provided of the current design concept for an experimental radio navigation subsystem to be implemented in the field as a part of the MAFIS study effort. Objectives of MAFIS include mobility, field-ruggedness and longevity of equipment, and low acquisition and life-cycle costs. The navigation subsystem comprises a 4-station radio transmitter network, plus the navigation receivers, network monitoring receivers and communications links, and interface to the command/control 'central' for transmitter status monitoring. Attention is given to accuracy goals, radio propagation effects, transmitter arrangement, radio-frequency allocations, position initialization and lane resolution, and transmitter and receiver functions.

Wallis, D. E.↗

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 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.↗

An integrated approach to space station power system autonomous control

Space Station electrical power management must be accomplished autonomously in order to decrease both airborne and ground support costs. Attention is presently given to the augmentation of terrestrial utility algorithmic decision aids for power dispatching for space station use, using expert systems to direct power demand analyses and the integration of results into operational decisions. Functions to be thus managed encompass power scheduling, energy allocation, failure cause diagnoses, goal proposal and plan preparation, consequence evaluation, and execution plan selection. The operating states of the system are normal, preventive, emergency, and restorative.

Dolce, James L.↗

Impacting Space Station Freedom design with operations and safety requirements - An availability process

The unusually long mission duration of Space Station Freedom leads to operations costs that have significant impacts on life-cycle cost relative to previous manned space programs. Maintaining an affordable program requires that operations costs be considered throughout the design process. An appropriate means of impacting the design with operations concerns is to specify requirements that ensure operational effectiveness when implemented. The Space Station Freedom Program has developed a process defining such requirements. It focuses on specifying functional profiles and allocating resources such that designers gain a better understanding of the operational envelope in which their systems must perform. This paper examines the details of the process, where it came from, and why it is effective.

Garegnani, Jerry J.↗

International cooperation in the Space Station

The principles and policies governing participation in the International Space Station are examined from a NASA perspective. The history of the program is reviewed; the most important aspects of the partnership concept (functional allocation, shared access, and interface commonality) are considered in detail; and the ongoing outfitting studies are briefly characterized. Major issues remaining to be negotiated include (1) the overall management structure; (2) the division of responsibilities for system design, integration, operation, and utilization; and (3) the sharing of operating costs.

Raney, William P.↗

Cooperation and Coordination Between Fuzzy Reinforcement Learning Agents in Continuous State Partially Observable Markov Decision Processes

Successful operations of future multi-agent intelligent systems require efficient cooperation schemes between agents sharing learning experiences. We consider a pseudo-realistic world in which one or more opportunities appear and disappear in random locations. Agents use fuzzy reinforcement learning to learn which opportunities are most worthy of pursuing based on their promise rewards, expected lifetimes, path lengths and expected path costs. We show that this world is partially observable because the history of an agent influences the distribution of its future states. We consider a cooperation mechanism in which agents share experience by using and-updating one joint behavior policy. We also implement a coordination mechanism for allocating opportunities to different agents in the same world. Our results demonstrate that K cooperative agents each learning in a separate world over N time steps outperform K independent agents each learning in a separate world over K*N time steps, with this result becoming more pronounced as the degree of partial observability in the environment increases. We also show that cooperation between agents learning in the same world decreases performance with respect to independent agents. Since cooperation reduces diversity between agents, we conclude that diversity is a key parameter in the trade off between maximizing utility from cooperation when diversity is low and maximizing utility from competitive coordination when diversity is high.

Berenji, Hamid R.↗

Sharing the 620-790 MHz band allocated to terrestrial television with an audio-bandwidth social service satellite system

A study was carried out to identify the optimum uplink and downlink frequencies for audio-bandwidth channels for use by a satellite system distributing social services. The study considered functional-user-need models for five types of social services and identified a general baseline system that is appropriate for most of them. Technical aspects and costs of this system and of the frequency bands that it might use were reviewed, leading to the identification of the 620-790 MHz band as a perferred candidate for both uplink and downlink transmissions for nonmobile applications. The study also led to some ideas as to how to configure the satellite system.

Smith, E. K.↗

Iterative-deepening heuristic search for optimal and semi-optimal resource allocation

It is demonstrated that when iterative-deepening A asterisk (IDA asterisk) is applied to one type of resource allocation problem, it uses far less storage than A asterisk, but opens far more nodes and thus has unacceptable time complexity. This is shown to be due, at least in part, to the low-valued effective branching factor that is a characteristic of problems with real-valued cost functions. The semi-optimal, epsilon-admissible IDA asterisk sub epsilon search algorithm that the authors described was shown to open fewer nodes than both A asterisk and IDA asterisk with storage complexity proportional to the depth of the search tree.

Bridges, Susan M.↗

Non-Maximally Decimated Filter Banks Enable Adaptive Frequency Hopping for Unmanned Aircraft Vehicles

In the last few years, radio technologies for unmanned aircraft vehicle (UAV) have advanced very rapidly. The increasing need to fly unmanned aircraft systems (UAS) in the national airspace system (NAS) to perform missions of vital importance to national security, defense, and science has pushed ahead the design and implementation of new radio platforms. However, a lot still has to be done to improve those radios in terms of performance and capabilities. In addition, an important aspect to account for is hardware cost and the feasibility to implement these radios using commercial off-the-shelf (COTS) components. UAV radios come with numerous technical challenges and their development involves contributions at different levels of the design. Cognitive algorithms need to be developed in order to perform agile communications using appropriate frequency allocation while maintaining safe and efficient operations in the NAS and, digital reconfigurable architectures have to be designed in order to ensure a prompt response to environmental changes. Command and control (C2) communications have to be preserved during "standard" operations while crew operations have to be minimized. It is clear that UAV radios have to be software-defined systems, where size, weight and power consumption (SWaP) are critical parameters. This paper provides preliminary results of the efforts performed to design a fully digital radio architecture as part of a NASA Phase I STTR. In this paper, we will explain the basic idea and technical principles behind our dynamic/adaptive frequency hopping radio for UAVs. We will present our Simulink model of the dynamic FH radio transmitter design for UAV communications and show simulation results and FPGA system analysis.

UAV↗

System design of the Pioneer Venus spacecraft. Volume 2: Science

The objectives of the low-cost Pioneer Venus space probe program are discussed. The space mission and science requirements are analyzed. The subjects considered are as follows: (1) the multiprobe mission, (2) the orbiter mission, (3) science payload accomodations, and (4) orbiter spacecraft experimental interface specifications. Tables of data are provided to show the science allocations for large and small probes. Illustrations of the systems and components of various probe configurations are included.

Acheson, L. K.↗

Performance evaluation of a simulated data-flow computer with low-resolution actors

Basic problems related to the exploitation of parallelism in a program include sequencing of the instructions and communication of the data. It is pointed out that the data-flow approach offers an elegant solution to the sequencing problem, since all data dependencies are automatically handled and only instructions with ready input sets are activated. It is shown that a change in the level of subcomputations (actors) affects communications costs. The concept of variable resolution is discussed, and the testbed environment is examined. Attention is given to the architecture of the processing elements, the communication network, and the simulators. A description of the analytical model is also provided. Simulation and results are discussed, taking into account test programs and allocation, the variation of the number of processing elements, the variation of the resolution in directed acyclic graphs, performance in processing loops, and array handling.

Gaudiot, J. L.↗

From Global Reconnaissance to Sample Return: A Proposal for a Post-2009 Strategy to Follow the Water on Mars

Since the mid-1990's, the stated strategy of the Mars Exploration Program has been to Follow the Water. Although this strategy has been widely publicized, its degree of influence -- and the logic behind its current implementation (as reflected in mission planning, platform and instrument selection, and allocation of spacecraft resources) remains unclear. In response to this concern, we propose an integrated strategy for the post-2009 exploration of Mars that identifies the scientific objectives, rationale, sequence of missions, and specific investigations, that we believe provides the maximum possible science return by pursuing the most direct, cost-effective, and technically capable approach to following the water. This strategy is based on the orbital identification, high-resolution surface investigation, and ultimate sampling of the highest priority targets: near-surface liquid water and massive ground ice (potentially associated with the discharge of the outlflow channels or the relic of a former ocean). The analysis of such samples, in conjunction with the data acquired by the necessary precursor investigations (to identify the locations and characterize the environments of the optimum sampling sites), is expected to address a majority of the goals and high priority science objectives identified by MEPAG.

S M Clifford↗

Concept of Operations for RCO SPO

Reduced crew operations (RCO) refers to the reduction of crew members flying long-haul or military operations with more than one pilot onboard. Single pilot operations (SPO) refers to flying a commercial transport aircraft with only one pilot on board the aircraft, assisted by advanced onboard automation andor ground operators providing piloting support services. Properly implemented, RCO/SPO could provide operating cost savings while maintaining a level of safety no less than conventional two-pilot commercial operations. A concept of operations (ConOps) for any paradigm describes the characteristics of its various components and their integration in a multi-dimensional design space. This paper presents key options for humanautomation function allocation being considered by NASA in its ongoing development of RCO/SPO ConOps.

ConOps↗

Advisory Algorithm for Scheduling Open Sectors, Operating Positions, and Workstations

Air traffic controller supervisors configure available sector, operating position, and work-station resources to safely and efficiently control air traffic in a region of airspace. In this paper, an algorithm for assisting supervisors with this task is described and demonstrated on two sample problem instances. The algorithm produces configuration schedule advisories that minimize a cost. The cost is a weighted sum of two competing costs: one penalizing mismatches between configurations and predicted air traffic demand and another penalizing the effort associated with changing configurations. The problem considered by the algorithm is a shortest path problem that is solved with a dynamic programming value iteration algorithm. The cost function contains numerous parameters. Default values for most of these are suggested based on descriptions of air traffic control procedures and subject-matter expert feedback. The parameter determining the relative importance of the two competing costs is tuned by comparing historical configurations with corresponding algorithm advisories. Two sample problem instances for which appropriate configuration advisories are obvious were designed to illustrate characteristics of the algorithm. Results demonstrate how the algorithm suggests advisories that appropriately utilize changes in airspace configurations and changes in the number of operating positions allocated to each open sector. The results also demonstrate how the advisories suggest appropriate times for configuration changes.

Bloem, Michael↗

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗

An expansion plan for the 60 Hz power distribution system at KSC: LC-39 substations load allocation plan

The increasing load density in the LC-39 area of Kennedy Space Center (KSC) can be met by either modifying the existing substation and increasing its capacity or by planning an additional new substation. Evidence that the later approach is more economical, enhances the system reliability, and would produce more satisfactory performance indices is provided. Network theory is the basis for the optimal location determination of the proposed substation. A load reallocation plan which minimizes investment cost and power losses and meets other desirable system features is drafted. The report should be useful to the system designer and can be a useful guideline for future facility planners.

Kalu, Alex↗